Speedup Learning

Speedup learning is a branch of machine learning that studies learning mechanisms for speeding up problem solvers based on problem solving experience. The input to a speedup learner typically consists of observations of prior problem-solving experience, which may include traces of the problem solver’s operations and/or solutions to solved problems. The output is knowledge that the problem solver can exploit to find solutions more quickly than before learning without seriously effecting solution quality. The most distinctive feature of speedup learning, compared to most branches of machine learning, is that the learned knowledge does not provide the problem solver with the ability to solve new problem instances. Rather, the learned knowledge is intended solely to facilitate faster solution times compared to the solver without the knowledge.

[1]  Prasad Tadepalli,et al.  A Formal Framework for Speedup Learning from Problems and Solutions , 1996, J. Artif. Intell. Res..

[2]  Oren Etzioni,et al.  Explanation-Based Learning: A Problem Solving Perspective , 1989, Artif. Intell..

[3]  Roni Khardon,et al.  Learning Action Strategies for Planning Domains , 1999, Artif. Intell..

[4]  Sudeshna Sarkar,et al.  Learning while solving problems in best first search , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[5]  Henry A. Kautz,et al.  Towards Understanding and Harnessing the Potential of Clause Learning , 2004, J. Artif. Intell. Res..

[6]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

[7]  Subbarao Kambhampati,et al.  On the Relations Between Intelligent Backtracking and Failure-Driven Explanation-Based Learning in Constraint Satisfaction and Planning , 1998, Artif. Intell..

[8]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[9]  Bart Selman,et al.  Learning Declarative Control Rules for Constraint-BAsed Planning , 2000, ICML.

[10]  Vipin Kumar,et al.  A Data-Dependency-Based Intelligent Backtracking Scheme for Prolog , 1987, J. Log. Program..

[11]  Steven Minton,et al.  Machine Learning Methods for Planning , 1994 .

[12]  Richard Fikes,et al.  Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

[13]  Terry L. Zimmerman,et al.  Learning-Assisted Automated Planning: Looking Back, Taking Stock, Going Forward , 2003, AI Mag..

[14]  Thomas Schiex,et al.  Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[15]  Andrew W. Moore,et al.  Learning Evaluation Functions for Global Optimization and Boolean Satisfiability , 1998, AAAI/IAAI.