Explanation-Based Learning (EBL) One definition: Learning general problem-solving techniques by observing and analyzing human solutions to specific problems.

Slides:



Advertisements
Similar presentations
Explanation-Based Learning (borrowed from mooney et al)
Advertisements

Analytical Learning.
Pat Langley School of Computing and Informatics Arizona State University Tempe, Arizona USA Modeling Social Cognition in a Unified Cognitive Architecture.
Some Prolog Prolog is a logic programming language
Heuristic Search techniques
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Inference Rules Universal Instantiation Existential Generalization
 2002, G.Tecuci, Learning Agents Laboratory 1 Learning Agents Laboratory Computer Science Department George Mason University Prof. Gheorghe Tecuci Deductive.
CHAPTER 13 Inference Techniques. Reasoning in Artificial Intelligence n Knowledge must be processed (reasoned with) n Computer program accesses knowledge.
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Copyright © 2002 Cycorp Logical Aspects of Inference Incompleteness in Searching Incompleteness from Resource Bounds and Continuable Searches Inference.
Knowledge Representation and Reasoning Learning Sets of Rules and Analytical Learning Harris Georgiou – 4.
Combining Inductive and Analytical Learning Ch 12. in Machine Learning Tom M. Mitchell 고려대학교 자연어처리 연구실 한 경 수
Best-First Search: Agendas
Problem Solving and Search in AI Part I Search and Intelligence Search is one of the most powerful approaches to problem solving in AI Search is a universal.
Learning control knowledge and case-based planning Jim Blythe, with additional slides from presentations by Manuela Veloso.
Introduction to SOAR Based on “a gentle introduction to soar: an Architecture for Human Cognition” by Jill Fain Lehman, John Laird, Paul Rosenbloom. Presented.
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
Getting Students to Produce Their Own Worked Examples Dr. Mok, Y.F.
1 Planning. R. Dearden 2007/8 Exam Format  4 questions You must do all questions There is choice within some of the questions  Learning Outcomes: 1.Explain.
Methods of Proof Chapter 7, second half.
Cognitive Processes PSY 334 Chapter 8 – Problem Solving May 21, 2003.
EXPERT SYSTEMS Part I.
Models of Human Performance Dr. Chris Baber. 2 Objectives Introduce theory-based models for predicting human performance Introduce competence-based models.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 22 Jim Martin.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
CS62S: Expert Systems Based on: The Engineering of Knowledge-based Systems: Theory and Practice A. J. Gonzalez and D. D. Dankel.
1 Knowledge Based Systems (CM0377) Lecture 12 (Last modified 2nd May 2002)
1 Machine Learning: Lecture 11 Analytical Learning / Explanation-Based Learning (Based on Chapter 11 of Mitchell, T., Machine Learning, 1997)
 Knowledge Acquisition  Machine Learning. The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Artificial Intelligence
An Introduction to Design Patterns. Introduction Promote reuse. Use the experiences of software developers. A shared library/lingo used by developers.
Knowledge based Humans use heuristics a great deal in their problem solving. Of course, if the heuristic does fail, it is necessary for the problem solver.
THE SCIENTIFIC METHOD. What is Scientific Inquiry? SCIENCE  Science assumes the natural world is  Consistent  Predictable  Goals of science are 
Knowledge Representation CPTR 314. The need of a Good Representation  The representation that is used to represent a problem is very important  The.
Chapter 9: Rules and Expert Systems Lora Streeter.
CS 5751 Machine Learning Chapter 11 Explanation-Based Learning 1 Explanation-Based Learning (EBL) One definition: Learning general problem- solving techniques.
Machine Learning Chapter 5. Artificial IntelligenceChapter 52 Learning 1. Rote learning rote( โรท ) n. วิถีทาง, ทางเดิน, วิธีการตามปกติ, (by rote จากความทรงจำ.
Logic Programming CSC 358/ Outline Pattern matching Unification Logic programming.
Chapter 11 Statistical Techniques. Data Warehouse and Data Mining Chapter 11 2 Chapter Objectives  Understand when linear regression is an appropriate.
KU NLP Machine Learning1 Ch 9. Machine Learning: Symbol- based  9.0 Introduction  9.1 A Framework for Symbol-Based Learning  9.2 Version Space Search.
The AI War LISP and Prolog Basic Concepts of Logic Programming
Explanation Based Learning (EBL) By M. Muztaba Fuad.
GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Ch. 13 Ch. 131 jcmt CSE 3302 Programming Languages CSE3302 Programming Languages (notes?) Dr. Carter Tiernan.
Learning to Share Meaning in a Multi-Agent System (Part I) Ganesh Padmanabhan.
What is Science? Science is  A way of learning about the natural world through observations and logical reasoning.  This information can grow and change.
Science As a Process!!!!!. Science A process through which nature is studied, discovered, and understood. A process through which nature is studied, discovered,
The Scientific Method. UNIT OBJECTIVES 1. Define the concept of science as a process. 2. List the steps of the scientific method 3. Determine type of.
SAT 2009 Ashish Sabharwal Backdoors in the Context of Learning (short paper) Bistra Dilkina, Carla P. Gomes, Ashish Sabharwal Cornell University SAT-09.
Machine Learning Concept Learning General-to Specific Ordering
1 Knowledge Based Systems (CM0377) Introductory lecture (Last revised 28th January 2002)
CpSc 810: Machine Learning Analytical learning. 2 Copy Right Notice Most slides in this presentation are adopted from slides of text book and various.
Lecture №1 Role of science in modern society. Role of science in modern society.
Planning I: Total Order Planners Sections
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
Search Control.. Planning is really really hard –Theoretically, practically But people seem ok at it What to do…. –Abstraction –Find “easy” classes of.
#1 Make sense of problems and persevere in solving them How would you describe the problem in your own words? How would you describe what you are trying.
Learning Teleoreactive Logic Programs by Observation
EA C461 – Artificial Intelligence Logical Agent
Knowledge Representation
Knowledge Representation
CAPE INFORMATION TECHNOLOGY
Cognitive Processes PSY 334
Science A process through which nature is studied, discovered, and understood. All areas of science involve posing INQUIRIES (questions) about nature.
CAPE INFORMATION TECHNOLOGY
CAPE INFORMATION TECHNOLOGY
LEARNING.
Presentation transcript:

Explanation-Based Learning (EBL) One definition: Learning general problem-solving techniques by observing and analyzing human solutions to specific problems.

The EBL Hypothesis By understanding why an example is a member of a concept, can learn the essential properties of the concept Trade-off the need to collect many examples for the ability to “explain” single examples (a “domain” theory)

Learning by Generalizing Explanations Given –Goal (e.g., some predicate calculus statement) –Situation Description (facts) –Domain Theory (inference rules) –Operationality Criterion Use problem solver to justify, using the rules, the goal in terms of the facts. Generalize the justification as much as possible. The operationality criterion states which other terms can appear in the generalized result.

Standard Approach to EBL

Unification-Based Generalization An explanation is an inter-connected collection of “pieces” of knowledge (inference rules, rewrite rules, etc.) These “rules” are connected using unification, as in Prolog The generalization task is to compute the most general unifier that allows the “knowledge pieces” to be connected together as generally as possible

The EGGS Algorithm (Mooney, 1986) bindings = { } FOR EVERY equality between patterns P and Q in explanation DO bindings = unify(P,Q,bindings) FOR EVERY pattern P DO P = substitute-in-values(P,bindings) Collect leaf nodes and the goal node

Sample EBL Problem Initial Domain Theory knows(?x,?y) AND nice-person(?y) -> likes(?x,?y) animate(?z) -> knows(?z,?z) human(?u) -> animate(?u) friendly(?v) -> nice-person(?v) happy(?w) -> nice-person(?w) Specific Example Given human(John) AND happy(John) AND male(John), show that likes(John,John)

Explanation to Solve Problem

Explanation Structure

Prototypical EBL Architecture

Imperfect Theories and EBL Incomplete Theory Problem Cannot build explanations of specific problems because of missing knowledge Intractable Theory Problem Have enough knowledge, but not enough computer time to build specific explanation Inconsistent Theory Problem Can derive inconsistent results from a theory (e.g., because of default rules)

Some Complications Inconsistencies and Incompleteness may be due to abstractions and assumptions that make a theory tractable. Inconsistencies may arise from missing knowledge (incompleteness). e.g., making the closed-world assumption

Issues with Imperfect Theories Detecting imperfections –“broken” explanations (missing clause) –contradiction detection (proving P and not P) –multiple explanations (but expected!) –resources exceeded Correcting imperfections experimentation - motivated by failure type (explanation- based) make approximations/assumptions - assume something is true

EBL as Operationalization (Speedup Learning) Assuming a complete problem solver and unlimited time, EBL already knows how to recognize all the concepts it will know. What it learns is how to make its knowledge operational (Mostow). Is this learning? Isn’t 99% of human learning of this type?

Knowledge-Level Learning (Newell, Dietterich) Knowledge closure all things that can be inferred from a collection of rules and facts “Pure” EBL only learns how to solve faster, not how to solve problems previously insoluble. Inductive learners make inductive leaps and hence can solve more after learning. What about considering resource-limits (e.g., time) on problem solving?

Negative Effects of Speedup Learning The “Utility Problem” Time wasted checking “promising” rules rules that almost match waste more time than obviously irrelevant ones General, broadly-applicable rules mask more efficient special cases

Defining Utility (Minton) Utility = (AvgSav * ApplFreq) - AvgMatchCost where AvgSav - time saved when rule used ApplFreq - probability rule succeeds given its preconditions tested AvgMatchCost - cost of checking rule’s preconditions Rules with negative utility are discarded estimated on training data

Learning for Search-Based Planners Two options 1) Save composite collections of primitive operators, called MACROPS explanation turned into rule added to knowledge base 2) Have a domain theory about your problem solver use explicit declarative representation build explanations about how problems were solved –which choices lead to failure, success, etc. –learn evaluation functions (prefer pursuing certain operations in certain situations)

Reasons for Control Rules Improve search efficiency (prevent going down “blind alleys”) To improve solution quality (don’t necessarily want first solution found via depth-first search) To lead problem solver down seemingly unpromising paths overcome default heuristics designed to keep problem solver from being overly combinatoric

PRODIGY - Learning Control Knowledge (Minton, 1989) Have domain theory about specific problem AND another about the problem solver itself Choices to be made during problem solving: –which node in current search tree to expand –which sub-goal of overall goal to explore –relevant operator to apply –binding of variables to operators Control rules can –lead to the choice/rejection of a candidate –lead to a partial ordering of candidates (preferences)

SOAR (Rosenbloom, Laird, and Newell, 1986) Production system that chunks productions via EBL Production system - forward chaining rule system for problem solving Key Idea: IMPASSES –occur when system cannot decide which rule to apply –solution to impasse generalized into new rule

Summary of SOAR A “Production System” with three parts: A general-purpose forward search procedure A collection of operator-selection rules that help decide which operator to apply A look-ahead search procedure invoked when at an impasse When the impasse occurs, can learn new rules to add to collection of operator-selection rules

Reasoning by Analogy Create a description of a situation with a known solution and then use that solution in structurally similar situations Problem: a doctor can use a beam of radiation to destroy a cancer, but at the high amount needed, it will also destroy the healthy tissue in any path it follows Idea: find a similar (some how) situation and use it to create a solution

Reasoning by Analogy Story Similar story: a general needs to send his troops to a particular city for a battle by a particular time, but there is no road wide enough to accommodate all of his troops in the time remaining (even though there are several roads) Solution: break up the troops into smaller groups and send each group down a different road How to solve the radiation situation??