A Multi-Domain Evaluation of Scaling in Soar’s Episodic Memory Nate Derbinsky, Justin Li, John E. Laird University of Michigan.

Slides:



Advertisements
Similar presentations
A LLISON S EIBERT & A LEXANDRA W ARLEN Efficient Episode Recall and Consolidation E MILIA V ANDERWERF & R OBERT S TILES.
Advertisements

Integrated Episodic and Semantic Memory in Robotics Steve Furtwangler, with Robert Marinier, Jacob Crossman.
Yoshiharu Ishikawa (Nagoya University) Yoji Machida (University of Tsukuba) Hiroyuki Kitagawa (University of Tsukuba) A Dynamic Mobility Histogram Construction.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
Introduction to Data-driven Animation Jinxiang Chai Computer Science and Engineering Texas A&M University.
Search Engines and Information Retrieval
A Query Mechanism for Inspecting Behavior History Tolga Konik University of Michigan.
1 Episodic Memory for Soar Andrew Nuxoll 15 June 2005.
A Markov Random Field Model for Term Dependencies Donald Metzler and W. Bruce Croft University of Massachusetts, Amherst Center for Intelligent Information.
1 Learning from Behavior Performances vs Abstract Behavior Descriptions Tolga Konik University of Michigan.
1 Episodic Memory for Soar Agents Andrew Nuxoll 11 June 2004.
Impact of Working Memory Activation on Agent Design John Laird, University of Michigan 1.
1 Soar Semantic Memory Yongjia Wang University of Michigan.
Design Patterns for Efficient Graph Algorithms in MapReduce Jimmy Lin and Michael Schatz University of Maryland Tuesday, June 29, 2010 This work is licensed.
The Importance of Architecture for Achieving Human-level AI John Laird University of Michigan June 17, th Soar Workshop
A Soar’s Eye View of ACT-R John Laird 24 th Soar Workshop June 11, 2004.
Web Projections Learning from Contextual Subgraphs of the Web Jure Leskovec, CMU Susan Dumais, MSR Eric Horvitz, MSR.
Designing clustering methods for ontology building: The Mo’K workbench Authors: Gilles Bisson, Claire Nédellec and Dolores Cañamero Presenter: Ovidiu Fortu.
1 Information Retrieval and Extraction 資訊檢索與擷取 Chia-Hui Chang, Assistant Professor Dept. of Computer Science & Information Engineering National Central.
A New Soar Debugger in Java Douglas Pearson ThreePenny Software
CS294-6 Reconfigurable Computing Day 3 September 1, 1998 Requirements for Computing Devices.
Scalable Network Distance Browsing in Spatial Database Samet, H., Sankaranarayanan, J., and Alborzi H. Proceedings of the 2008 ACM SIGMOD international.
© 2004 Soar Technology, Inc.  July 13, 2015  Slide 1 Thinking… …inside the box Soar Workshop Presentation Presented on 10 June 2004 by Jacob Crossman.
Hashed Samples Selectivity Estimators for Set Similarity Selection Queries.
L-3 PROPRIETARY 1 Real-time IO-oriented Soar Agent for Base Station-Mobile Control David Daniel, Scott Hastings L-3 Communications.
Chapter 11: Artificial Intelligence
Search Engines and Information Retrieval Chapter 1.
Dialogue Act Tagging Using TBL Sachin Kamboj CISC 889: Statistical Approaches to NLP Spring 2003 September 14, 2015September 14, 2015September 14, 2015.
1 Intelligent Systems ISCRAM 2013 Validating Procedural Knowledge in the Open Virtual Collaboration Environment Gerhard Wickler AIAI, University.
New SVS Implementation Joseph Xu Soar Workshop 31 June 2011.
1 CPS216: Advanced Database Systems Notes 04: Operators for Data Access Shivnath Babu.
Query Optimization Chap. 19. Evaluation of SQL Conceptual order of evaluation – Cartesian product of all tables in from clause – Rows not satisfying where.
Research Ranked Recall: Efficient Classification by Learning Indices That Rank Omid Madani with Michael Connor (UIUC)
Integrating Background Knowledge and Reinforcement Learning for Action Selection John E. Laird Nate Derbinsky Miller Tinkerhess.
Keyword Searching and Browsing in Databases using BANKS Seoyoung Ahn Mar 3, 2005 The University of Texas at Arlington.
RecBench: Benchmarks for Evaluating Performance of Recommender System Architectures Justin Levandoski Michael D. Ekstrand Michael J. Ludwig Ahmed Eldawy.
Future Memory Research in Soar Nate Derbinsky University of Michigan.
PAPER BY JONATHAN MUGAN & BENJAMIN KUIPERS PRESENTED BY DANIEL HOUGH Learning Distinctions and Rules in a Continuous World through Active Exploration.
Computer Science 101 Theory of Computing. Computer Science is... The study of algorithms, with respect to –their formal properties –their linguistic realizations.
Joseph Xu Soar Workshop Learning Modal Continuous Models.
Space-Efficient Online Computation of Quantile Summaries SIGMOD 01 Michael Greenwald & Sanjeev Khanna Presented by ellery.
CSCI 4310 Lecture 2: Search. Search Techniques Search is Fundamental to Many AI Techniques.
Leaving the Script Justin Permar Soar Workshop June 5, 2013 ADAM GT 1
Beyond Chunking: Learning in Soar March 22, 2003 John E. Laird Shelley Nason, Andrew Nuxoll and a cast of many others University of Michigan.
Lecture 15: Query Optimization. Very Big Picture Usually, there are many possible query execution plans. The optimizer is trying to chose a good one.
Instance Discovery and Schema Matching With Applications to Biological Deep Web Data Integration Tantan Liu, Fan Wang, Gagan Agrawal {liut, wangfa,
Competence-Preserving Retention of Learned Knowledge in Soar’s Working and Procedural Memories Nate Derbinsky, John E. Laird University of Michigan.
Meta-Path-Based Ranking with Pseudo Relevance Feedback on Heterogeneous Graph for Citation Recommendation By: Xiaozhong Liu, Yingying Yu, Chun Guo, Yizhou.
Overview Issues in Mobile Databases – Data management – Transaction management Mobile Databases and Information Retrieval.
Use of Soar for Modeling Cyber Operations 36 th Soar Workshop Ann Arbor, Michigan Denise Nicholson, Ph.D., Director of X Ryan O’Grady, Software Engineer.
Action Modeling with Graph-Based Version Spaces in Soar
Cognitive Language Processing for Rosie
Learning Fast and Slow John E. Laird
CPS216: Data-intensive Computing Systems
Miller Tinkerhess University of Michigan
Efficient Image Classification on Vertically Decomposed Data
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Associative Query Answering via Query Feature Similarity
Efficient Image Classification on Vertically Decomposed Data
John Laird, Nate Derbinsky , Jonathan Voigt University of Michigan
Random Sampling over Joins Revisited
John E. Laird 32nd Soar Workshop
Joseph Xu Soar Workshop 31 June 2011
SAT-Based Area Recovery in Technology Mapping
Bryan Stearns University of Michigan Soar Workshop - May 2018
Learning the Task Definition of Games through ITL
Topological Signatures For Fast Mobility Analysis
Tantan Liu, Fan Wang, Gagan Agrawal The Ohio State University
Fast, Interactive, Language-Integrated Cluster Computing
Presentation transcript:

A Multi-Domain Evaluation of Scaling in Soar’s Episodic Memory Nate Derbinsky, Justin Li, John E. Laird University of Michigan

Motivation Prior Work Nuxoll & Laird (‘12): integration and capabilities Derbinsky & Laird (‘09): efficient algorithms Core Question To what extent is Soar’s episodic memory effective and efficient for real-time agents that persist for long periods of time across a variety of tasks? 20 June 2012Soar Workshop Ann Arbor, MI2

Approach: Multi-Domain Evaluation Existing agents from diverse tasks (49) – Linguistics, planning, games, robotics Long agent runs – Hours-days RT (10 5 – 10 8 episodes) Evaluate at each X episodes – Memory consumption – Reactivity for >100 task relevant cues Maximum time for cue matching < ? 50 msec. 20 June 2012Soar Workshop Ann Arbor, MI3

Outline Overview of Soar’s EpMem Word Sense Disambiguation (WSD) Planning Video Games & Robotics 20 June 2012Soar Workshop Ann Arbor, MI4

Working Memory Episodic Memory Problem Formulation 20 June Representation Episode: connected di-graph Store: temporal sequence Encoding/Storage Automatic No dynamics Retrieval Cue: acyclic graph Semantics: desired features in context Find the most recent episode that shares the most leaf nodes in common with the cue Episodic Memory EncodingStorage Matching Cue Soar Workshop Ann Arbor, MI

Episodic Memory Algorithmic Overview Storage – Capture WM-changes as temporal intervals Cue Matching (reverse walk of cue-relevant Δ’s) – 2-phase search Only graph-match episodes that have all cue features independently – Only evaluate episodes that have changes relevant to cue features – Incrementally re-score episodes 20 June 2012Soar Workshop Ann Arbor, MI6

Episodic Memory Storage Characterization 20 June 2012Soar Workshop Ann Arbor, MI7 1 week, 8GB 1 day, 8GB

Episodic Memory Retrieval Characterization Assumptions – Few changes per episode (temporal contiguity) – Representational re-use (structural regularity) – Small cue Scaling – Search distance (# changes to walk) Temporal Selectivity: how often does a WME change Feature Co-Occurrence: how often do WMEs co-occur within a single episode (related to search-space size) – Episode scoring (similar to rule matching) Structural Selectivity: how many ways can a cue WME match an episode (i.e. multi-valued attributes) 20 June 2012Soar Workshop Ann Arbor, MI8

Word Sense Disambiguation Experimental Setup Input: ; Output: sense #; Result – Corpus: SemCor (~900K eps/exposure) Agent – Maintain context as n-gram – Query EpMem for context If success, get next episode, output result If failure, null 20 June 2012Soar Workshop Ann Arbor, MI9 AccuracyFirstSecond 2-gram14.57%92.82% 3-gram2.32%99.47%

Word Sense Disambiguation Results Storage – Avg. 234 bytes/episode Cue Matching – All 1-, 2-, and 3-gram cues reactive – 0.2% of 4-grams exceed 50msec. 20 June 2012Soar Workshop Ann Arbor, MI10

N-gram Retrieval Scaling Retrieval Time (msec) vs. Episodes (x1000) 20 June Feature Co-Occurrence Temporal Selectivity Soar Workshop Ann Arbor, MI

Planning Experimental Setup 12 automatically converted PDDL domains – Logistics, Blocksworld, Eight-puzzle, Grid, Gripper, Hanoi, Maze, Mine-Eater, Miconic, Mystery, Rockets, and Taxi – 44 distinct problem instances (e.g. # blocks) Agent: randomly explore state space – 50K episodes, measure every 1K 20 June 2012Soar Workshop Ann Arbor, MI12

Planning Results Storage – Reactive: <12.04 msec./episode – Memory: 562 – 5454 bytes/episode Cue Matching (reactive: < 50 msec.) 1.Full State: only smallest state + space size (12) 2.Relational: none 3.Schema: all (max = 0.08 msec.) 20 June 2012Soar Workshop Ann Arbor, MI13

Video Games & Mobile Robotics Experimental Setup Hand-coded cues (per domain) 20 June 2012Soar Workshop Ann Arbor, MI14 DomainAgentDurationEval. Rate TankSoarmapping-bot3.5M50K Eatersadvanced-move3.5M50K Infinite Mario[Mohan & Laird ‘11]3.5M50K Rooms World[Laird, Derbinsky & Voigt ‘11]12 hours300K

Data: Eaters 20 June Soar Workshop Ann Arbor, MI 813 bytes/episode

Data: Infinite Mario 20 June Structural Selectivity Soar Workshop Ann Arbor, MI 2646 bytes/episode

Data: TankSoar 20 June Co-Occurrence Soar Workshop Ann Arbor, MI 1035 bytes/episode

Data: Mobile Robotics 20 June Temporal Selectivity Soar Workshop Ann Arbor, MI 113 bytes/episode

Summary of Results Generality – Demonstrated 7 cognitive capabilities Virtual sensing, action modeling, long-term goal management, … Reactivity – <50 msec. storage time for all tasks (ex. temporal discontiguity) – <50 msec. cue matching for many cues Scalability – No growth in cue matching for many cues (days!) Validated predictive performance models – kb/episode (days – months) 20 June Soar Workshop Ann Arbor, MI

Evaluation Nuggets Unprecedented evaluation of general episodic memory – Breadth, temporal extent, analysis Characterization of EpMem performance via task- independent properties Soar’s EpMem (v9.3.2) is effective and efficient for many tasks and cues! Domains and cues available Coal Still easy to construct domain/cue that makes Soar unreactive Unbounded memory consumption (given enough time) 20 June 2012Soar Workshop Ann Arbor, MI20 For more details, see paper in proceedings of AAAI 2012 For more details, see paper in proceedings of AAAI 2012