We Have Not Yet Begun to Learn Rich Sutton AT&T Labs.

Slides:



Advertisements
Similar presentations
Automated Theorem Proving Lecture 1. Program verification is undecidable! Given program P and specification S, does P satisfy S?
Advertisements

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
A Life in Asset Management
Ontologies: Dynamic Networks of Formally Represented Meaning Dieter Fensel: Ontologies: Dynamic Networks of Formally Represented Meaning, 2001 SW Portal.
Strategies for Supporting Young Children
Comparative Succinctness of KR Formalisms Paolo Liberatore.
Lecture 8: Three-Level Architectures CS 344R: Robotics Benjamin Kuipers.
Situation Calculus for Action Descriptions We talked about STRIPS representations for actions. Another common representation is called the Situation Calculus.
Ai in game programming it university of copenhagen Reinforcement Learning [Outro] Marco Loog.
Feedback training session
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
Dimensions of Creative Work A partial taxonomy for clarifying what is being studied and under what conditions.
Correctness. Until now We’ve seen how to define dataflow analyses How do we know our analyses are correct? We could reason about each individual analysis.
Plans for Today Chapter 2: Intelligent Agents (until break) Lisp: Some questions that came up in lab Resume intelligent agents after Lisp issues.
COMP 3009 Introduction to AI Dr Eleni Mangina
Toward Grounding Knowledge in Prediction or Toward a Computational Theory of Artificial Intelligence Rich Sutton AT&T Labs with thanks to Satinder Singh.
Design and Analysis of Algorithms
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
© Curriculum Foundation1 Section 2 The nature of the assessment task Section 2 The nature of the assessment task There are three key questions: What are.
CSCE 315: Programming Studio Artificial Intelligence.
Common Sense Computing MIT Media Lab Interaction Challenges for Agents with Common Sense Henry Lieberman MIT Media Lab Cambridge, Mass. USA
McGraw-Hill © 2006 The McGraw-Hill Companies, Inc. All rights reserved. The Nature of Research Chapter One.
Computability and Modeling Computation What are some really impressive things that computers can do? –Land the space shuttle (and other aircraft) from.
THE NEW ERA OF LIFE. Introduction: Artificial Intelligence (AI) is the area of computer science focusing on creating machines that can engage on behaviors.
Introduction to Behavior- Based Robotics Based on the book Behavior- Based Robotics by Ronald C. Arkin.
CSCI 4410 Introduction to Artificial Intelligence.
1 Intelligent Systems Q: Where to start? A: At the beginning (1940) by Denis Riordan Reference Modern Artificial Intelligence began in the middle of the.
1 Validation & Verification Chapter VALIDATION & VERIFICATION Very Difficult Very Important Conceptually distinct, but performed simultaneously.
The Thinking Machine Based on Tape. Computer Has Some Intelligence Now Playing chess Solving calculus problems Other examples:
Artificial Intelligence CIS 479/579 Bruce R. Maxim UM-Dearborn.
Knowledge representation
Survey of AI for games. AI vs. AI for games Traditional AI: – Made to handle unseen inputs, large state space – Too many options possible to compute an.
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
Developing Communicative Dr. Michael Rost Language Teaching.
1 ECE-517: Reinforcement Learning in Artificial Intelligence Lecture 6: Optimality Criterion in MDPs Dr. Itamar Arel College of Engineering Department.
Exam Taking Kinds of Tests and Test Taking Strategies.
Software Engineering 2003 Jyrki Nummenmaa 1 SOFTWARE PRODUCT QUALITY Today: - Software quality - Quality Components - ”Good” software properties.
1 ECE-517 Reinforcement Learning in Artificial Intelligence Lecture 7: Finite Horizon MDPs, Dynamic Programming Dr. Itamar Arel College of Engineering.
AI in games Roger Crawfis/Eric Fosler-Lussier CSE 786 Game Design.
OHTO -99 SOFTWARE ENGINEERING “SOFTWARE PRODUCT QUALITY” Today: - Software quality - Quality Components - ”Good” software properties.
SCIENCE What does “theory” mean? Common Definition Guess Opinion General beliefs Hypothesis System of ideas/statements Scientific Definition A set of scientific.
1 CS 2710, ISSP 2610 Foundations of Artificial Intelligence introduction.
Introduction to Problem Solving. Steps in Programming A Very Simplified Picture –Problem Definition & Analysis – High Level Strategy for a solution –Arriving.
University of Windsor School of Computer Science Topics in Artificial Intelligence Fall 2008 Sept 11, 2008.
AI in games Roger Crawfis CSE 786 Game Design. AI vs. AI for games AI for games poses a number of unique design challenges AI for games poses a number.
Ethics for Machines J Storrs Hall. Stick-Built AI ● No existing AI is intelligent ● Intelligence implies the ability to learn ● Existing AIs are really.
Software Engineering 2004 Jyrki Nummenmaa 1 SOFTWARE PRODUCT QUALITY Today: - Software quality - Quality Components - ”Good” software properties.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Chapter 1 –Defining AI Next Tuesday –Intelligent Agents –AIMA, Chapter 2 –HW: Problem.
Scientific Debugging. Errors in Software Errors are unexpected behaviors or outputs in programs As long as software is developed by humans, it will contain.
Software Engineering – University of Tampere, CS DepartmentJyrki Nummenmaa SOFTWARE PRODUCT QUALITY Today: - Software quality -
University of Kurdistan Artificial Intelligence Methods (AIM) Lecturer: Kaveh Mollazade, Ph.D. Department of Biosystems Engineering, Faculty of Agriculture,
11 Artificial Intelligence CS 165A Thursday, October 25, 2007  Knowledge and reasoning (Ch 7) Propositional logic 1.
What is Artificial Intelligence?
Feng Zhiyong Tianjin University Fall  An agent is anything that can be viewed as perceiving its environment through sensors and acting upon that.
Observation: A process and skill. Observation is a key skill for any investigator or personnel in the field for forensics Observation is a key skill for.
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
A Brief History of AI Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Strategic Reasoning with Game Description Language Ji Ruan, Prof. W. van der Hoek, Prof. M. Wooldridge Department of Computer Science From Specific Game.
Copyright © 2011 Wolters Kluwer Health | Lippincott Williams & Wilkins Chapter 1 Research: An Overview.
Naïve Bayes Classifier April 25 th, Classification Methods (1) Manual classification Used by Yahoo!, Looksmart, about.com, ODP Very accurate when.
1 Artificial Intelligence & Prolog Programming CSL 302.
Managing with Imperfect Information 1 6/14/2016. Perfect Information 2 1 – Source is WikipediaWikipedia Perfect information refers to the situation in.
1 Web Search/Thinkin g It may not seem this way, but there are robots being used all around us all the time! What are some examples of everyday.
Ch. 5 Measurement Concepts.
Introduction to Artificial Intelligence
Course Instructor: knza ch
Chapter 9: Planning and Learning
Fact and Opinion: Is There Really a Difference
COMP3710 Artificial Intelligence Thompson Rivers University
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Presentation transcript:

We Have Not Yet Begun to Learn Rich Sutton AT&T Labs

We Have Not Yet Begun to Learn None of our ML and RL systems learn anything like the things that people animals know and use everyday

Intelligence can be defined as using knowledge flexibly to achieve goals/purposes A working definition that matches our intuitions Sufficiently sufficient

AI systems Chess-playing programs Planners Heuristic search Dynamic programming SOAR Calendar agents Reactive robots Navigating robots Theorem Provers CYC Quality of knowledge  amount  scope  relevance/utility  accuracy Flexibility with which knowledge is used Kinds of knowledge  policy  transition  implication  value Knowledge

So What Holds AI Back? For the problems of interest, it is hard to get the knowledge right  people must manually tune it to make it right  and often it’s not quite clear what “right” means –may be “right” mainly because of what it causes to happen The complex web of knowledge becomes unwieldy  brittle  difficult to change  unreliable More responsibility needs to be given to the machine To autonomously maintain and verify its knowledge

Reliable Knowledge Requires Verification To know something reliably, robustly, you have to be able to tell, by yourself, whether it is correct  policies do they get reward?  predictionsdo they come true?  theoremsdo they have valid proofs?  plansdo they achieve their goals?

Conclusion: Reliable Knowledge Requires Verification We can distinguish 1. Having knowledge 2. Having the ability to verify knowledge I.e., there is something beyond having knowledge which we might call understanding its meaning and which is key in practice to building powerful AIs

Let’s Focus on Transition Knowledge Projective/predictive knowledge of what follows what  Strips Operators  Action models  Physics, dynamics, causation The key kind of knowledge in planners/search systems  chess players, state-based planning, SOAR A paradigm case in knowledge that can be verified and learned from experience

Verifying Transition Knowledge Must have experience Knowledge must be expressed in term of experience Verification must be in terms of experience “Dyna” and successors did this for 1-step transitions But 1-step predictions are not expressive enough Need predictions of arbitrary experiments  a closed-loop policy  with closed-loop, temporally-flexible termination Need something like option models + options

Anatomy of a Super-Prediction 1 Predictor (option model) Recognizes the conditions, makes the prediction 2 Experiment (option) - policy - termination condition - measurement function(s) knowledge verifier

“Reliable Knowledge Requires Verification” is an Example of Purposive Design “Purposive” = control by consequences  Fixed ends achieved by variable means Widely seen as the hallmark of mind  “the mark and criterion of mentality” William James, 1890  “Purposive Behavior in Animals and Man” Edward Tolman, 1932 Achieving systems vs Purposive systems achieve the fixed end achieve the fixed end more often, by varying means. requires ability to verify/recognize the fixed end

There is a tension between achievement and purposive design It’s always easier to build than to meta-build  easier to write a policy than a policy-learner  easier to plan than to write a planner  easier to add knowledge than to add its verifier Even at the policy level, many advocate direct building  reactive systems  simple expert systems At the knowledge level, it is easier to rely on human interpretation than to write explicit verifiers  can talk at human level - objects, times, properties, space  rather than experience level - actions, observations, rewards

Conclusion: Reliable Knowledge Requires Verification We can distinguish 1. Having knowledge 2. Having the ability to verify knowledge I.e., there is something beyond having knowledge which we might call understanding its meaning and which is key in practice to building powerful AIs