Joseph Xu Soar Workshop 31 June 2011

Slides:



Advertisements
Similar presentations
1 Machine Learning: Lecture 4 Artificial Neural Networks (Based on Chapter 4 of Mitchell T.., Machine Learning, 1997)
Advertisements

Integrated Episodic and Semantic Memory in Robotics Steve Furtwangler, with Robert Marinier, Jacob Crossman.
University of Amsterdam Search, Navigate, and Actuate - Quantitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Quantative Navigation.
DARPA Mobile Autonomous Robot SoftwareMay Adaptive Intelligent Mobile Robotics William D. Smart, Presenter Leslie Pack Kaelbling, PI Artificial.
1 Enviromatics Spatial database systems Spatial database systems Вонр. проф. д-р Александар Маркоски Технички факултет – Битола 2008 год.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
Gaussian process emulation of multiple outputs Tony O’Hagan, MUCM, Sheffield.
Instance Based Learning
Learning Shape in Computer Go David Silver. A brief introduction to Go Black and white take turns to place down stones Once played, a stone cannot move.
1 Learning from Behavior Performances vs Abstract Behavior Descriptions Tolga Konik University of Michigan.
Integrating POMDP and RL for a Two Layer Simulated Robot Architecture Presented by Alp Sardağ.
RRT-Connect path solving J.J. Kuffner and S.M. LaValle.
Goals of Adaptive Signal Processing Design algorithms that learn from training data Algorithms must have good properties: attain good solutions, simple.
Computational aspects of motor control and motor learning Michael I. Jordan* Mark J. Buller (mbuller) 21 February 2007 *In H. Heuer & S. Keele, (Eds.),
Learning: Nearest Neighbor Artificial Intelligence CMSC January 31, 2002.
Learning Prepositions for Spatial Relationships in BOLT Soar Workshop 2012 James Kirk, John Laird 6/21/
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Introduction SNR Gain Patterns Beam Steering Shading Resources: Wiki:
A Multi-Domain Evaluation of Scaling in Soar’s Episodic Memory Nate Derbinsky, Justin Li, John E. Laird University of Michigan.
New SVS Implementation Joseph Xu Soar Workshop 31 June 2011.
Plan-Directed Architectural Change for Autonomous Systems Daniel Sykes, William Heaven, Jeff Magee, Jeff Kramer Imperial College London.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Control 1 Keypoints: The control problem Forward models: –Geometric –Kinetic –Dynamic Process characteristics for a simple linear dynamic system.
Augmenting Physical State Prediction Through Structured Activity Inference Nam Vo & Aaron Bobick ICRA 2015.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
Future Memory Research in Soar Nate Derbinsky University of Michigan.
Simultaneously Learning and Filtering Juan F. Mancilla-Caceres CS498EA - Fall 2011 Some slides from Connecting Learning and Logic, Eyal Amir 2006.
Joseph Xu Soar Workshop Learning Modal Continuous Models.
CpSc 881: Machine Learning Instance Based Learning.
CpSc 810: Machine Learning Instance Based Learning.
Learning Integrated Symbolic and Continuous Action Models Joseph Xu & John Laird May 29, 2013.
Competence-Preserving Retention of Learned Knowledge in Soar’s Working and Procedural Memories Nate Derbinsky, John E. Laird University of Michigan.
CS 8751 ML & KDDInstance Based Learning1 k-Nearest Neighbor Locally weighted regression Radial basis functions Case-based reasoning Lazy and eager learning.
Chapter 12 Case Studies Part B. Control System Design.
Action Modeling with Graph-Based Version Spaces in Soar
Chapter 7. Classification and Prediction
CSC2535: Computation in Neural Networks Lecture 11 Extracting coherent properties by maximizing mutual information across space or time Geoffrey Hinton.
Learning Fast and Slow John E. Laird
Functions 12-4 Warm Up Problem of the Day Lesson Presentation
Instance Based Learning
Informatica PowerCenter Performance Tuning Tips
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Table 1. Advantages and Disadvantages of Traditional DM/ML Methods
Reading: Pedro Domingos: A Few Useful Things to Know about Machine Learning source: /cacm12.pdf reading.
Reinforcement Learning
RELATIONS AND FUNCTIONS
Machine Learning Basics
Teach A level Computing: Algorithms and Data Structures
with Daniel L. Silver, Ph.D. Christian Frey, BBA April 11-12, 2017
CHAPTER 2 FORWARD KINEMATIC 1.
Policy Compression for MDPs
K Nearest Neighbor Classification
John E. Laird 32nd Soar Workshop
Teach A level Computing: Algorithms and Data Structures
یادگیری بر پایه نمونه Instance Based Learning Instructor : Saeed Shiry
Instance Based Learning
Classification Algorithms
Chap 8. Instance Based Learning
CS 188: Artificial Intelligence Fall 2008
Recursively Adapted Radial Basis Function Networks and its Relationship to Resource Allocating Networks and Online Kernel Learning Weifeng Liu, Puskal.
1.6 - Relations.
Warm Up What three terms come next? 1. 9, 12, 15, 18, . . .
Warm Up What three terms come next? 1. 9, 12, 15, 18, . . .
Topological Signatures For Fast Mobility Analysis
Math review - scalars, vectors, and matrices
CSC321: Neural Networks Lecture 11: Learning in recurrent networks
Physics-guided machine learning for milling stability:
An approach to quantum Bayesian inference
Word representations David Kauchak CS158 – Fall 2016.
Memory-Based Learning Instance-Based Learning K-Nearest Neighbor
Determining the Risk Level Regarding to the Positioning of an Exam Machine Used in the Nuclear Environment, based of polynomial regression Mihai OPROESCU1,
Presentation transcript:

Joseph Xu Soar Workshop 31 June 2011 Action Modeling in SVS Joseph Xu Soar Workshop 31 June 2011

Environment Relational Abstraction Relational Abstraction Relational Relational State Available Actions Relational State +intersect(robot, red_wp) +intersect(robot, green_wp) ¬intersect (robot, red_wp) (robot, green_wp) intersect (robot, red_wp) ¬intersect (robot, green_wp) Relational Planner Relational Model Relational Abstraction Relational Abstraction Relational Action Continuous State Continuous State Objective Function Continuous Model Pre out Post State Update communication Controller Motor Signals learning Environment usage

Outline Describe continuous model learning algorithm Show learning results in robot domain Discuss problem with algorithm Briefly describe relational model learning Show results on combining relational and continuous models

Continuous Model Learning Formally, learn a function 𝑓(𝑥,𝑢)→𝑦 x: current continuous state u: continuous output y: next state Requirements Online, incremental Robust across wide variety of domains Doesn’t slow down with more training Locally Weighted Regression Instance-based approach (!) Almost parameter free Learns arbitrarily complex functions

Continuous Model Learning Output Continuous Output Continuous Output left voltage: 0.2 right voltage: 0.8 x u y values Spatial Scene Graph World P [ 0.1, 3.4, 0.0 ] R [ 0.0, 0.0, 0.3 ] S [ 1.0, 1.0, 1.0 ] Spatial Scene Graph World P [ 0.3, 3.7, 0.0 ] R [ 0.0, 0.0, 1.7 ] S [ 1.0, 1.0, 1.0 ] X U Y

Continuous Model Prediction ? Motor Command left voltage: -0.6 right voltage: 1.2 x u Fix equation k nearest neighbors Weighted Linear Regression

Hand-coded model fails Robot Domain Example Environment input (x, y) position (x, y) velocity Heading angle Angular velocity Left wheel RPM Right wheel RPM Agent output Left and right motor voltages Using a stand-alone version Learned model adapts Voltage inversion Hand-coded model fails

Continuous Learning Performance in Robot Domain Show slide of task

Continuous Learning Performance in Robot Domain Show slide of task

Problem: Nearest Neighbor Search Slowest part of the prediction Using a brute force search over all training examples leads to linear time increase Smarter data structures such as Kd trees, ball trees, and cover trees degrade quickly as number of dimensions increase Number of dimensions proportional to number of objects in scene, can grow very large Locality sensitive hashing?

Pruning Examples Selectively keep new training examples: For each new example (x, u, y), make a prediction y’ = f(x, u) with continuous model If y’ ≈ y, then assume that (x, u, y) will not improve model performance, so don’t keep it

Table Size w/wo Pruning

Query Time w/wo Pruning

Prediction Error w/wo Pruning

Relational Model Learning S1 S2 S3 snapshot snapshot snapshot Episodic Memory e1 e2 e3 Training examples (s1, o1, s2) (s2, o2, s3) Prediction citation B C A A B C What happens if I try relational operator +on(A, C)? Retrieve Similar Episode B C A A B C Prediction Simple Analogical Mapping Xu, J. Z., Laird, J. E. (2010). Instance-Based Online Learning of Deterministic Relational Action Models. AAAI 2010.

Another Way to Make Relational Predictions Relational State Relational State ¬intersect (robot, red_wp) (robot, green_wp) intersect (robot, red_wp) ¬intersect (robot, green_wp) Continuous Model Pre out Post Relational Abstraction Relational Action Another slide before to embed this in context of multiple prediction methods Spatial Scene Graph World P [ 0.3, 3.7, 0.0 ] R [ 0.0, 0.0, 1.7 ] S [ 1.0, 1.0, 1.0 ] Controller

Combining Relational and Continuous Models Each type of model captures different information Relational model captures qualitative changes that can generalize across analogical situations, but doesn’t understand space Continuous model captures spatial configurations, but doesn’t generalize across analogical situations Since we have both, we can combine them to offset each type’s weakness

Combining Relational and Continuous Models Rooms Domain Series of connected rooms with doors and switches Agent outputs (x,y) velocity to move and can open doors by stepping on switches Relational model doesn’t capture spatial configuration of rooms Continuous model doesn’t understand the relationship between stepping on switches and opening doors

Prediction Performance in Rooms Domain reorder legend Xu, J. Z., Laird, J. E. (2011). Combining Learned Discrete and Continuous Action Models. AAAI 2011.

Conclusion Nuggets Coal Continuous model learns quickly in robot domain Continuous model adapts online to changes in dynamics Demonstrated a simple way to combine relational and continuous learning to improve performance Nearest neighbor search is unbounded

Flattening Scene Graph Spatial Scene Graph B C A World P [ 0.1, 3.4, -12 ] R [ 0.0, 0.0, 1.7 ] S [ 1.0, 1.0, 1.0 ] P [ ... ] R [ ... ] S [ ... ] extra properties Slide for going toward instance based, nn approach Flat Representation position rotation scale B:A C:A A:world values signature P1 P2 P3

Problem: Sharing Training Examples Current implementation of continuous model learning cannot share training examples across structurally distinct states World World World splinter:world splinter:world disc:world splinter:world disc:world