Strategic Approximation of Human Algorithms: a Request for Comments on a Thesis Ryan Kaulakis Applied Cognitive.

Slides:

Advertisements

Similar presentations

Image Registration  Mapping of Evolution. Registration Goals Assume the correspondences are known Find such f() and g() such that the images are best.

Advertisements

Constraint Based Reasoning over Mutex Relations in Graphplan Algorithm Pavel Surynek Charles University, Prague Czech Republic.

Ch2 Data Preprocessing part3 Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2009.

Yuri R. Tsoy, Vladimir G. Spitsyn, Department of Computer Engineering

ICONIP 2005 Improve Naïve Bayesian Classifier by Discriminative Training Kaizhu Huang, Zhangbing Zhou, Irwin King, Michael R. Lyu Oct

VIVO Cornell: Lessons from the field Kathy Chiang, Jon Corson-Rikert, Elizabeth Hines, Joseph McEnerney Stella Mitchell, Christopher Westling, Tim Worrall.

Input Space versus Feature Space in Kernel- Based Methods Scholkopf, Mika, Burges, Knirsch, Muller, Ratsch, Smola presented by: Joe Drish Department of.

Computer vision: models, learning and inference Chapter 18 Models for style and identity.

Multiple View Based 3D Object Classification Using Ensemble Learning of Local Subspaces ( ThBT4.3 ) Jianing Wu, Kazuhiro Fukui

Kalervo Järvelin – Issues in Context Modeling – ESF IRiX Workshop - Glasgow THEORETICAL ISSUES IN CONTEXT MODELLING Kalervo Järvelin

Substance Abuse, Multi-Stage Decisions, Generalization Error How are they connected?! S.A. Murphy Univ. of Michigan CMU, Nov., 2004.

Evolution of a Dynamic Theory of Collaboration: Modeling Intergovernmental Use of Information Technology Prepared for the 2002 System Dynamics Research.

Reporter : Mac Date : Multi-Start Method Rafael Marti.

Learning From Data Chichang Jou Tamkang University.

Margin Based Sample Weighting for Stable Feature Selection Yue Han, Lei Yu State University of New York at Binghamton.

Hierarchical Reinforcement Learning Ersin Basaran 19/03/2005.

Models of Human Performance Dr. Chris Baber. 2 Objectives Introduce theory-based models for predicting human performance Introduce competence-based models.

Bootstrapping LING 572 Fei Xia 1/31/06.

Bagging LING 572 Fei Xia 1/24/06. Ensemble methods So far, we have covered several learning methods: FSA, HMM, DT, DL, TBL. Question: how to improve results?

Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.

COMPUTATIONAL MODELING OF INTEGRATED COGNITION AND EMOTION Bob MarinierUniversity of Michigan.

Overview of Distributed Data Mining Xiaoling Wang March 11, 2003.

Approximating the Algebraic Solution of Systems of Interval Linear Equations with Use of Neural Networks Nguyen Hoang Viet Michal Kleiber Institute of.

Copyright R. Weber Machine Learning, Data Mining ISYS370 Dr. R. Weber.

CONGRESSIONAL SAMPLES FOR APPROXIMATE ANSWERING OF GROUP-BY QUERIES Swarup Acharya Phillip Gibbons Viswanath Poosala ( Information Sciences Research Center,

Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.

Basic Data Mining Technique

Chapter 7 Handling Constraints

Chapter 8 The k-Means Algorithm and Genetic Algorithm.

3 A’s of Computational Thinking. Computational Thinking.

Balancing Exploration and Exploitation Ratio in Reinforcement Learning Ozkan Ozcan (1stLT/ TuAF)

1 A Heuristic Approach Towards Solving the Software Clustering Problem ICSM03 Brian S. Mitchell /

Fuzzy Genetic Algorithm

A Meta-Study of Algorithm Visualization Effectiveness Christopher Hundhausen, Sarah Douglas, John Stasko Presented by David Burlinson 8/10/2015.

Overview of Machine Learning RPI Robotics Lab Spring 2011 Kane Hadley.

Virtual Vector Machine for Bayesian Online Classification Yuan (Alan) Qi CS & Statistics Purdue June, 2009 Joint work with T.P. Minka and R. Xiang.

CISC Machine Learning for Solving Systems Problems Presented by: Satyajeet Dept of Computer & Information Sciences University of Delaware Automatic.

1 A Learning Model of a Long, Non-iterative Spreadsheet Task Frank E. Ritter, Jong W. Kim, and Jaehyon Paik College of IST, Penn State Presented at the.

CS558 Project Local SVM Classification based on triangulation (on the plane) Glenn Fung.

Mixture Kalman Filters by Rong Chen & Jun Liu Presented by Yusong Miao Dec. 10, 2003.

Intelligent Database Systems Lab N.Y.U.S.T. I. M. 1 Mining knowledge from natural language texts using fuzzy associated concept mapping Presenter : Wu,

Leaving the Script Justin Permar Soar Workshop June 5, 2013 ADAM GT 1

Yr 7.  Pupils use mathematics as an integral part of classroom activities. They represent their work with objects or pictures and discuss it. They recognise.

2003/02/19 Chapter 2 1頁1頁 Chapter 2 : Basic Probability Theory Set Theory Axioms of Probability Conditional Probability Sequential Random Experiments Outlines.

RULES Patty Nordstrom Hien Nguyen. "Cognitive Skills are Realized by Production Rules"

SOAR A cognitive architecture By: Majid Ali Khan.

1 Learning through Interactive Behavior Specifications Tolga Konik CSLI, Stanford University Douglas Pearson Three Penny Software John Laird University.

Learning Team Behavior Using Individual Decision Making in Multiagent Settings Using Interactive DIDs Muthukumaran Chandrasekaran THINC Lab, CS Department.

1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.

Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University

Kernel Regression Prof. Bennett Math Model of Learning and Discovery 1/28/05 Based on Chapter 2 of Shawe-Taylor and Cristianini.

Multi-objective evolutionary generation of mamdani fuzzy rule-based systems based on rule and condition selection International Workshop On Genetic And.

Sensor Coordination using Active Dataspaces Steven Cheung NSF NOSS PI Meeting October 18, 2004.

Robot Programming from Demonstration, Feedback and Transfer Yoan Mollard, Thibaut Munzer, Andrea Baisero, Marc Toussaint, Manuel Lopes.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Advisor ： Dr. Hsu Graduate ： Chun Kai Chen Author ： Andrew.

Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Adaptive Clustering for Multiple Evolving Streams Graduate.

1 Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms Dagstuhl – Software Architecture Brian S. Mitchell

Chapter 1.2, Defining Science  Pure Science  research that adds to the body of scientific knowledge  has no practical use  Applied Science (Technology)

1 Chapter 6 Reformulation-Linearization Technique and Applications.

D10A Metode Penelitian MP-04b Metodologi Penelitian di dalam Ilmu Komputer/Informatika Program Studi S-1 Teknik Informatika FMIPA Universitas.

Artificial Intelligence

1 Design and evaluation methods: Objectives n Design life cycle: HF input and neglect n Levels of system design: Going beyond the interface n Sources of.

Data Transformation: Normalization

RESEARCH APPROACH.

Wireless Sensor Network Architectures

Jiawei Han Department of Computer Science

What is Operations Research?

CSc4730/6730 Scientific Visualization

Chapter 0: Introduction

Russell and Norvig: Chapter 3, Sections 3.1 – 3.3

Presentation transcript:

Strategic Approximation of Human Algorithms: a Request for Comments on a Thesis Ryan Kaulakis Applied Cognitive Science Lab Penn State College of IST Presented at the 2013 Soar Workshop At the University of Michigan

Outline ● Why here? ● Generalizing from ACT-R to Soar (theory should apply to most rule-based architectures) ● Need feedback on getting human-like timings from Soar ● Abstract ● Strategic Approximation of Human Algorithms (SAHA): ● Bootstrapping Phase ● Post-Process Phase ● Questions

Abstract A nonlinear general regression technique for matching human data with cognitive architectural models is introduced. This technique is named the Strategic Approximation of Human Algorithms (SAHA), and it provides a means of repre- senting both individual behaviors and aggregate behaviors, as well as functions that operate over these representations to support experimental applications. Sequential problem-solving data generated by humans is used to construct programs in ACT-R which approximate how that data was generated by the humans. These programs will be constructed with Genetic Programming variants designed to evolve programs in ACT-R that solve the same task as the original human, and that accurately match the observed data of a single human by maximizing their match percentage over the greatest subset of the human data. The resulting programs can be viewed as approximations of the algorithm used by the individual human to generate the original data. Further, the results from multiple humans will be aggregated in Program Space and clustered to produce groups of programs that solve problems in similar ways. These clusters are defined as fuzzy clusters, and referred to as Strategy Groups. They are groups which approximate some heuristic which humans use when solving the original problem. Strategy Groups can be used to perform additional key operations which the original unaggregated data cannot, including Expansion and Sampling.