Integration of Search and Learning Algorithms Eugene Fink.

Slides:



Advertisements
Similar presentations
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal.
Advertisements

ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Probabilistic Planning (goal-oriented) Action Probabilistic Outcome Time 1 Time 2 Goal State 1 Action State Maximize Goal Achievement Dead End A1A2 I A1.
Key-word Driven Automation Framework Shiva Kumar Soumya Dalvi May 25, 2007.
Master/Slave Architecture Pattern Source: Pattern-Oriented Software Architecture, Vol. 1, Buschmann, et al.
Prof. Carolina Ruiz Computer Science Department Bioinformatics and Computational Biology Program WPI WELCOME TO BCB4003/CS4803 BCB503/CS583 BIOLOGICAL.
Part2 AI as Representation and Search
Development of Parallel Simulator for Wireless WCDMA Network Hong Zhang Communication lab of HUT.
SBSE Course 3. EA applications to SE Analysis Design Implementation Testing Reference: Evolutionary Computing in Search-Based Software Engineering Leo.
The Experience Factory May 2004 Leonardo Vaccaro.
Evaluation of representations in AI problem solving Eugene Fink.
Artificial Intelligence MEI 2008/2009 Bruno Paulette.
Concurrent Markov Decision Processes Mausam, Daniel S. Weld University of Washington Seattle.
Parallelized Evolution System Onur Soysal, Erkin Bahçeci Erol Şahin Dept. of Computer Engineering Middle East Technical University.
1 Learning from Behavior Performances vs Abstract Behavior Descriptions Tolga Konik University of Michigan.
Machine Learning Methods for Personalized Cybersecurity Jaime G. Carbonell Eugene Fink Mehrbod Sharifi Applying machine learning and artificial intelligence.
Automated Changes of Problem Representation Eugene Fink LTI Retreat 2007.
1RADAR – Scheduling Task © 2003 Carnegie Mellon University RADAR – Scheduling Task May 20, 2003 Manuela Veloso, Stephen Smith, Jaime Carbonell, Brett Browning,
Hierarchical GUI Test Case Generation Using Automated Planning Atif M. Memon, Student Member, IEEE, Martha E. Pollack, and Mary Lou Soffa, Member, IEEE.
A Multi-Agent Learning Approach to Online Distributed Resource Allocation Chongjie Zhang Victor Lesser Prashant Shenoy Computer Science Department University.
Oct 30, 2001 Richard Fateman1 Do Math Making Computers Do Math Prof. Richard Fateman Fall, 2001 University of California, Berkeley.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill Technology Education Copyright © 2006 by The McGraw-Hill Companies,
Artificial Intelligence
Artificial Intelligence Course outline Introduction Problem solving Generic algorithms Knowledge Representation and Reasoning Expert Systems Uncertainty.
31 st October, 2012 CSE-435 Tashwin Kaur Khurana.
Using Provenance to Support Real-Time Collaborative Design of Workflows Tommy Ellkvist 1, Erik Anderson 2, David Koop 2, Juliana Freire 2, and Claudio.
Data Mining Chun-Hung Chou
1 Lyle H. Ungar, University of Pennsylvania What is AI? “Artificial Intelligence is the study of how to make computers do things at which, at the moment,
Beyond Intelligent Interfaces: Exploring, Analyzing, and Creating Success Models of Cooperative Problem Solving Gerhard Fischer & Brent Reeves.
UPC/SHMEM PAT High-level Design v.1.1 Hung-Hsun Su UPC Group, HCS lab 6/21/2005.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
INTEGRATED SYSTEMS 1205 Technology Education A Curriculum Review Sabine Schnepf-Comeau July 19, 2011 ED 4752.
System Concepts & Components Dr. Dania Bilal IS582 Spring 2009.
Stochastic Algorithms Some of the fastest known algorithms for certain tasks rely on chance Stochastic/Randomized Algorithms Two common variations – Monte.
Research, Development, Consulting, Training High Fidelity Modeling and Simulation Where we are going… …future plans.
Project Report Jeff Pape Cheng Chen. Pains Losing bets Unmeasurable stats(teamwork, chemistry, etc) Coaches not understanding teams.
ITR: Collaborative research: software for interpretation of cosmogenic isotope inventories - a combination of geology, modeling, software engineering and.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
Fundamentals of Information Systems, Third Edition2 Principles and Learning Objectives Artificial intelligence systems form a broad and diverse set of.
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
Web Services and Application of Multi-Agent Paradigm for DL Yueyu Fu & Javed Mostafa School of Library and Information Science Indiana University, Bloomington.
Data Mining By Dave Maung.
I Robot.
Introducing Unit Specifications and Unit Assessment Support Packs National 3, 4 and 5.
1 The main topics in AI Artificial intelligence can be considered under a number of headings: –Search (includes Game Playing). –Representing Knowledge.
Cooperative Classifiers Rozita Dara Supervisor: Prof. Kamel Pattern Analysis and Machine Intelligence Lab University of Waterloo.
Chapter 4 Decision Support System & Artificial Intelligence.
AI ● Dr. Ahmad aljaafreh. What is AI? “AI” can be defined as the simulation of human intelligence on a machine, so as to make the machine efficient to.
Schreiber, Yevgeny. Value-Ordering Heuristics: Search Performance vs. Solution Diversity. In: D. Cohen (Ed.) CP 2010, LNCS 6308, pp Springer-
Simon Model of Decision Making
David W. Aha Navy Center for Applied Research in AI Naval Research Laboratory Co-chairs Gheorghe Tecuci Learning Agents Center George Mason University.
CONFIDENTIAL © 2007 Maplesoft, a division of Waterloo Maple Inc. Confidential MapleSim Pilot Test Program.
What Dynamic Programming (DP) is a fundamental problem solving technique that has been widely used for solving a broad range of search and optimization.
CISC Machine Learning for Solving Systems Problems Presented by: Eunjung Park Dept of Computer & Information Sciences University of Delaware Solutions.
Of An Expert System.  Introduction  What is AI?  Intelligent in Human & Machine? What is Expert System? How are Expert System used? Elements of ES.
Finding Optimal Solutions to Cooperative Pathfinding Problems Trevor Standley Computer Science Department University of California, Los Angeles
Presented by:- Reema Tariq Artificial Intelligence.
Organic Evolution and Problem Solving Je-Gun Joung.
Some Thoughts to Consider 5 Take a look at some of the sophisticated toys being offered in stores, in catalogs, or in Sunday newspaper ads. Which ones.
Lecture 6 Title: Project Cost Management MIS 434.
Developing a diagnostic system through integration of fuzzy case-based reasoning and fuzzy ant colony system Expert Systems with Applications 28(2005)
Learning Analytics isn’t new Ways in which we might build on the long history of adaptive learning systems within contemporary online learning design Professor.
Scheduling with uncertain resources Collaboration with the user Eugene Fink, Ulaş Bardak, Brandon Rothrock, Jaime Carbonell Carnegie Mellon University.
On the Relation Between Simulation-based and SAT-based Diagnosis CMPE 58Q Giray Kömürcü Boğaziçi University.
Chapter 11 Managing Knowledge.
Learning Fast and Slow John E. Laird
An Artificial Intelligence Approach to Precision Oncology
“Intelligent User Interfaces” by Hefley and Murray A 1993 Perspective
Chapter 11 Managing Knowledge.
TEACHING TO ENHANCE LEARNING AND DEVELOPMENT
Presentation transcript:

Integration of Search and Learning Algorithms Eugene Fink

Basic intuition An intelligent system should select or invent an effective approach to a given problem.

Challenges Select among available search algorithms (or invent a new algorithm) Restate the problem, to improve the efficiency of the selected algorithm

Search algorithm search problem

Search algorithm search problemsolution ?

Search algorithm search problemsolution ? A search module inputs a problem and runs until finding a solution, failing, or reaching a time limit.

Speed-up learning algorithm speed-up learning problem

Speed-up learning algorithm speed-up learning problem problem and new knowledge

Speed-up learning algorithm speed-up learning problem problem and new knowledge search

Speed-up learning algorithm speed-up learning problem An algorithm inputs a problem and generates additional knowledge, which improves search efficiency. problem and new knowledge search

… or static-analysis algorithm static analysis problem An algorithm inputs a problem and generates additional knowledge, which improves search efficiency. problem and new knowledge search

Goals Construct an architecture for integration of multiple search and learning modules Centralized architecture Integration tools

Goals Construct an architecture for integration of multiple search and learning modules Develop a control mechanism that chooses appropriate modules for each problem Centralized architecture Integration tools Top-level control decisions Reuse of accumulated knowledge

Related work AI systems with multiple learning and search modules: Soar, Prodigy, … Integration tools: Multiagent Planning Architecture (Wilkins and Myers), Plan++ (Yang et al.) Selection among available algorithms: Horvitz, Breese, Russell, Minton,...

Shaper system Three main parts: Library of search modules Library of learning modules Top-level control mechanism

System outline

Control center

System outline Manual control Automatic control Control center

System outline Manual control Automatic control Control center Given a new problem: Select appropriate modules Apply them to solve the problem Repeat if necessary

Features of the top-level control Fast: Less than a second per problem General: Independent of specific modules Allows participation of a human expert: Initial knowledge and interactive advice

Features of the automatic control Several learning mechanisms Symbolic and statistical techniques Combining exploitation and exploration

Automatic control Solve the problem or learn additional knowledge?

Automatic control Which learner to apply? Which past results to use? Solve the problem or learn additional knowledge?

Automatic control Which learner to apply? Which past results to use? Invoke the selected learning module Solve the problem or learn additional knowledge?

Automatic control Which learner to apply? Which past results to use? Solve or skip the problem? With which search module? Which learned data to use? Invoke the selected learning module Solve the problem or learn additional knowledge?

Automatic control Which learner to apply? Which past results to use? Solve or skip the problem? With which search module? Which learned data to use? Invoke the selected learning module Invoke the selected search module Wait for the next problem Solve the problem or learn additional knowledge?

Automatic control Which learner to apply? Which past results to use? Solve or skip the problem? With which search module? Which learned data to use? Invoke the selected learning module Invoke the selected search module Wait for the next problem Solve the problem or learn additional knowledge?

Performance example Solving a series of 50 problems, and learning which modules are the best. order of solving problems

Performance example Solving a series of 50 problems, and learning which modules are the best. order of solving problems

Performance example Solving a series of 500 problems, and learning which modules are the best. order of solving problems

Applications Past: AI planning (Prodigy) Present: Hardware design (power estimates) Future: Biomedical data, vision,...