Singularity Institute for Artificial Intelligence

Slides:



Advertisements
Similar presentations
Eliezer Yudkowsky yudkowsky.net Eliezer Yudkowsky Research Fellow Singularity Institute for Artificial Intelligence yudkowsky.net Yeshiva University March.
Advertisements

Pretty-Good Tomography Scott Aaronson MIT. Theres a problem… To do tomography on an entangled state of n qubits, we need exp(n) measurements Does this.
Turing Machines January 2003 Part 2:. 2 TM Recap We have seen how an abstract TM can be built to implement any computable algorithm TM has components:
Effective Assessment and Feedback
By Anthony Campanaro & Dennis Hernandez
Presentation on Artificial Intelligence
Science as a Process Chapter 1 Section 2.
Order Statistics Sorted
Learning Objectives Explain similarities and differences among algorithms, programs, and heuristic solutions List the five essential properties of an algorithm.
Planning under Uncertainty
CS 357 – Intro to Artificial Intelligence  Learn about AI, search techniques, planning, optimization of choice, logic, Bayesian probability theory, learning,
Science Is Part of Everyday Human Existence Scientific understanding and a sense of wonder about nature are not mutually exclusive.
Recursion Chapter 7. Chapter 7: Recursion2 Chapter Objectives To understand how to think recursively To learn how to trace a recursive method To learn.
1 4 questions (Revisited) What are our underlying assumptions about intelligence? What kinds of techniques will be useful for solving AI problems? At what.
Recursion Chapter 7. Chapter 7: Recursion2 Chapter Objectives To understand how to think recursively To learn how to trace a recursive method To learn.
ECI 2007: Specification and Verification of Object- Oriented Programs Lecture 0.
Professionals in Health Critical Thinking and Problem Solving.
By: Mike Neumiller & Brian Yarbrough
Effective Questioning in the classroom
Mind Is All That Matters: Reasons to Focus on Cognitive Technologies
Section 2: Science as a Process
Of 28 Probabilistically Checkable Proofs Madhu Sudan Microsoft Research June 11, 2015TIFR: Probabilistically Checkable Proofs1.
Gaussian process modelling
8th Grade Science Introduction to Physical Science
Ch1 AI: History and Applications Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
Artificial Intelligence in Game Design Problems and Goals.
Tennessee Technological University1 The Scientific Importance of Big Data Xia Li Tennessee Technological University.
Lesson Overview Lesson Overview Science in Context Lesson Overview 1.2 Science in Context.
Recursion Chapter 7. Chapter Objectives  To understand how to think recursively  To learn how to trace a recursive method  To learn how to write recursive.
Lesson Overview Lesson Overview Science in Context Lesson Overview 1.2 Science in Context.
Big Idea 1: The Practice of Science Description A: Scientific inquiry is a multifaceted activity; the processes of science include the formulation of scientifically.
Scientific Inquiry & Skills
Journal Write a paragraph about a decision you recently made. Describe the decision and circumstances surrounding it. How did it turn out? Looking back,
Limits and Horizon of Computing Post silicon computing.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
Chapter 4 MODELING AND ANALYSIS. Model component Data component provides input data User interface displays solution It is the model component of a DSS.
Unsolvability and Infeasibility. Computability (Solvable) A problem is computable if it is possible to write a computer program to solve it. Can all problems.
1 The Scientist Game Chris Slaughter, DrPH (courtesy of Scott Emerson) Dept of Biostatistics Vanderbilt University © 2002, 2003, 2006, 2008 Scott S. Emerson,
Prioritizing and Goal Setting for Academic Success.
Lesson Overview 1.2 Science in Context.
Lesson Overview Science in Context THINK ABOUT IT Scientific methodology is the heart of science. But that vital “heart” is only part of the full “body”
Free Will FREEDOM VERSUS DETERMINISM. Are human beings free to make moral decisions and to act upon them? Are they determined by forces outside and.
Section 10.1 Confidence Intervals
Thinking & Language Ms. Kamburov. Automatic vs. Effortful Processing Automatic Effortful O Barely noticing what you are doing as you do it, taking little.
1 The Theory of NP-Completeness 2 Cook ’ s Theorem (1971) Prof. Cook Toronto U. Receiving Turing Award (1982) Discussing difficult problems: worst case.
Introduction to Earth Science Section 2 Section 2: Science as a Process Preview Key Ideas Behavior of Natural Systems Scientific Methods Scientific Measurements.
CSE373: Data Structures & Algorithms Lecture 22: The P vs. NP question, NP-Completeness Lauren Milne Summer 2015.
INTERVENTIONS AND INFERENCE / REASONING. Causal models  Recall from yesterday:  Represent relevance using graphs  Causal relevance ⇒ DAGs  Quantitative.
Consciousness in Human and Machine A Theory (with falsifiable predictions) Richard Loosemore.
What can Business Psychology do to map and measure Organisation Culture? A presentation for the Association of Business Psychologists 22nd September 2003.
©2005, Pearson Education/Prentice Hall CHAPTER 1 Goals and Methods of Science.
Introduction to Psychology Critical Thinking, Research & Ethics.
Bitwise Sort By Matt Hannon. What is Bitwise Sort It is an algorithm that works with the individual bits of each entry in order to place them in groups.
What is Artificial Intelligence?
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
5 Questions What is Theory? Why do we have theory? What is the relationship between theory and research? What is the relationship between theory and reality?
We Have Not Yet Begun to Learn Rich Sutton AT&T Labs.
NP ⊆ PCP(n 3, 1) Theory of Computation. NP ⊆ PCP(n 3,1) What is that? NP ⊆ PCP(n 3,1) What is that?
On the Difficulty of Achieving Equilibrium in Interactive POMDPs Prashant Doshi Dept. of Computer Science University of Georgia Athens, GA Twenty.
1 Artificial Intelligence & Prolog Programming CSL 302.
1.2 Science in Context SC912.N.3.1 Created by Lynn Collins (April, 2013)
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
Lesson Overview Lesson Overview Science in Context Lesson Overview 1.2 Science in Context Scientific methodology is the heart of science. But that vital.
Technical Problems in Long-Term AI SafetyAndrew Critch Technical (and Non-Technical) Problems in Long-Term AI Safety Andrew Critch.
Lesson Overview Lesson Overview Science in Context Lesson Overview 1.2 Science in Context (Lesson Summary)
Artificial Intelligence
Wishful Thinker Critical Thinker I need to feel powerful, important and safe. I believe things that make me feel comfortable. I believe things that make.
Behavioral Issues in Multiple Criteria Decision Making Jyrki Wallenius, Aalto University School of Business Summer School on Behavioral Operational Research:
WHAT IS THE NATURE OF SCIENCE?
University of Northern IA
Presentation transcript:

Singularity Institute for Artificial Intelligence AI as a Precise Art Eliezer Yudkowsky Singularity Institute for Artificial Intelligence singinst.org

Eliezer Yudkowsky Singularity Institute for AI Cards 70% blue, 30% red, randomized sequence Subjects paid 5¢ for each correct guess Subjects only guessed blue 76% of the time (on average) Optimal strategy is "Always guess blue" Strategy need not resemble cards - noisy strategy doesn't help in noisy environment (Tversky, A. and Edwards, W. 1966. Information versus reward in binary choice. Journal of Experimental Psychology, 71, 680-683.) Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Vernor Vinge: Can't predict any entity smarter than you, or you would be that smart Deep Blue played better chess than its programmers, from which it follows that programmers couldn't predict exact move Why go to all that work to write a program whose moves you couldn't predict? Why not just use a random move generator? Takes vast amount of work to craft AI actions predictably so good you can't predict them We run a program because we know something about the output and we don't know the output Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Gilovich: If we wish to disbelieve, we ask if the evidence compels us to accept the discomforting belief. If we wish to believe, we ask if the evidence prohibits us from keeping our preferred belief. The less you know, the less likely you are to get good results, but the easier it is to allow yourself to believe in good results. (Gilovich, T. 2000, June. Motivated skepticism and motivated credulity: Differential standards of evidence in the evaluation of desired and undesired propositions. Address presented at the 12th Annual Convention of the American Psychological Society, Miami Beach, Florida. Quoted in Brenner, L. A., Koehler, D. J. and Rottenstreich, Y. 2002. "Remarks on support theory: Recent advances and future directions." In Gilovich, T., Griffin, D. and Kahneman, D. eds. 2003. Heuristics and Biases: The Psychology of Intuitive Judgment. Cambridge, U.K.: Cambridge University Press.) Eliezer Yudkowsky Singularity Institute for AI

Mind Projection Fallacy: If I am ignorant about a phenomenon, this is a fact about my state of mind, not a fact about the phenomenon. Confusion exists in the mind, not in reality. There are mysterious questions. Never mysterious answers. (Inspired by Jaynes, E.T. 2003. Probability Theory: The Logic of Science. Cambridge: Cambridge University Press.) Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI "The influence of animal or vegetable life on matter is infinitely beyond the range of any scientific inquiry hitherto entered on. Its power of directing the motions of moving particles, in the demonstrated daily miracle of our human free-will, and in the growth of generation after generation of plants from a single seed, are infinitely different from any possible result of the fortuitous concurrence of atoms... Modern biologists were coming once more to the acceptance of something and that was a vital principle." -- Lord Kelvin Eliezer Yudkowsky Singularity Institute for AI

Intelligence Explosion Hypothesis: The smarter you are, the more creativity you can apply to the task of making yourself even smarter. Prediction: Positive feedback cycle rapidly leading to superintelligence. Extreme case of more common belief that reflectivity / self-modification is one of the Great Keys to AI. (Good, I. J. 1965. Speculations Concerning the First Ultraintelligent Machine. Pp. 31-88 in Advances in Computers, 6, F. L. Alt and M. Rubinoff, eds. New York: Academic Press.) Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI If a transistor operates today, the chance that it will fail before tomorrow is greater than 10-6 (1 failure per 3,000 years) Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI If a transistor operates today, the chance that it will fail before tomorrow is greater than 10-6 (1 failure per 3,000 years) But a modern chip has millions of transistors Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI If a transistor operates today, the chance that it will fail before tomorrow is greater than 10-6 (1 failure per 3,000 years) But a modern chip has millions of transistors Possible because most causes of transistor failure not conditionally independent for each transistor Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI If a transistor operates today, the chance that it will fail before tomorrow is greater than 10-6 (1 failure per 3,000 years) But a modern chip has millions of transistors Possible because most causes of transistor failure not conditionally independent for each transistor Similarly, an AI that remains stable over millions of self-modifications cannot permit any significant probability of failure which applies independently to each modification Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Modern chip may have 155 million interdependent parts, no patches after it leaves the factory Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Modern chip may have 155 million interdependent parts, no patches after it leaves the factory A formal proof of ten billion steps can still be correct (try this with informal proof!) Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Modern chip may have 155 million interdependent parts, no patches after it leaves the factory A formal proof of ten billion steps can still be correct (try this with informal proof!) Humans too slow to check billion-step proof Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Modern chip may have 155 million interdependent parts, no patches after it leaves the factory A formal proof of ten billion steps can still be correct (try this with informal proof!) Humans too slow to check billion-step proof Automated theorem-provers don't exploit enough regularity in the search space to handle large theorems Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Modern chip may have 155 million interdependent parts, no patches after it leaves the factory A formal proof of ten billion steps can still be correct (try this with informal proof!) Humans too slow to check billion-step proof Automated theorem-provers don't exploit enough regularity in the search space to handle large theorems Human mathematicians can do large proofs Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Modern chip may have 155 million interdependent parts, no patches after it leaves the factory A formal proof of ten billion steps can still be correct (try this with informal proof!) Humans too slow to check billion-step proof Automated theorem-provers don't exploit enough regularity in the search space to handle large theorems Human mathematicians can do large proofs ...but not reliably Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Solution: Human+AI Human generates lemmas, mysteriously avoiding exponential explosion of search space Complex theorem-prover generates formal proof leading to next lemma Simple verifier checks proof Could an AGI use a similar combination of abilities to carry out deterministic self-modifications? Eliezer Yudkowsky Singularity Institute for AI

Solution: Human/AI synergy Human generates lemmas, mysteriously avoiding exponential explosion of search space Complex theorem-prover generates formal proof Simple verifier checks proof Could an AGI use a similar combination of abilities to carry out deterministic self-modifications? Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Inside of a chip is deterministic environment Possible to achieve determinism for things that happen inside the chip Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Inside of a chip is deterministic environment Possible to achieve determinism for things that happen inside the chip Success in external world not deterministic, but AI can guarantee that its future self will try to accomplish the same things – this cognition happens within the chip Eliezer Yudkowsky Singularity Institute for AI

Eliezer Yudkowsky Singularity Institute for AI Inside of a chip is deterministic environment Possible to achieve determinism for things that happen inside the chip Success in external world not deterministic, but AI can guarantee that its future self will try to accomplish the same things – this cognition happens within the chip AI cannot predict future self's exact action, but knows criterion that future action will fit Eliezer Yudkowsky Singularity Institute for AI

Difficult to formalize argument! Bayesian framework breaks down on infinite recursion Not clear how to calculate the expected utility of changing the code that calculates the expected utility of changing the code... Eliezer Yudkowsky Singularity Institute for AI

Difficult to formalize argument! Bayesian framework breaks down on infinite recursion Not clear how to calculate the expected utility of changing the code that calculates the expected utility of changing the code... Yet humans don't seem to break down when imagining changes to themselves Never mind an algorithm that does it efficiently – how would you do it at all? Eliezer Yudkowsky Singularity Institute for AI

Wanted: Reflective Decision Theory We have a deep understanding of: Bayesian probability theory Bayesian decision theory Causality and conditional independence We need equally deep understanding of: Reflectivity Self-modification Designing AI will be a precise art when we know how to make an AI design itself Eliezer Yudkowsky Singularity Institute for AI

Singularity Institute for Artificial Intelligence Thank you. Eliezer Yudkowsky Singularity Institute for Artificial Intelligence singinst.org