On the Masking Effect

Machine learning approaches to knowledge compilation seek to improve the perfonnance of problem-solvers by storing solutions to previously solved problems in an efficient, generalized fonn. The problem-solver retrieves these learned solutions in appropriate later situations to obtain results more efficiently. However, by relying on its learned knowledge to provide a solution, the problem-solver may miss an alternative solution of higher quality - one that could have been generated using the original (non-learned) problem-solving knowledge. This phenomenon is referred to as the ITUlSking effect of learning. In this paper, we examine a sequence of possible solutions for the masking effect. Each solution refines and builds on the previous one. The fmal solution is based on cascaded filters. When learned knowledge is retrieved, these filters alert the system about the inappropriateness of this knowledge so that the system can then derive a better alternative solution. We analyze conditions under which this solution will perfonn better than the others, and present experimental data supportivt: of the analysis. This investigation is based on a simulated robot domain called Groundworld.

[1]  John R. Anderson The Architecture of Cognition , 1983 .

[2]  Milind Tambe,et al.  Flexible integration of path-planning capabilities , 1993, Other Conferences.

[3]  Subbarao Kambhampati,et al.  A Theory of Plan Modification , 1990, AAAI.

[4]  Charles Elkan,et al.  Incremental, Approximate Planning , 1990, AAAI.

[5]  Allen Newell,et al.  A Preliminary Analysis of the Soar Architecture as a Basis for General Intelligence , 1991, Artif. Intell..

[6]  Yishai A. Feldman,et al.  Reasoning with Simplifying Assumptions: A Methodology and Example , 1986, AAAI.

[7]  Yolanda Gil,et al.  Acquiring domain knowledge for planning by experimentation , 1992 .

[8]  Joseph S. B. Mitchell,et al.  An Algorithmic Approach to Some Problems in Terrain Navigation , 1988, Artif. Intell..

[9]  David E. Smith,et al.  Reasoning About Action II: The Qualification Problem , 1988, Artif. Intell..

[10]  John E. Laird,et al.  Overgeneralization during knowledge compilation in Soar , 1993 .

[11]  Vladimir Lifschitz,et al.  Formal Theories of Action (Preliminary Report) , 1987, IJCAI.

[12]  Prasad Tadepalli,et al.  Lazy ExplanationBased Learning: A Solution to the Intractable Theory Problem , 1989, IJCAI.

[13]  David J. Israel,et al.  Plans and resource‐bounded practical reasoning , 1988, Comput. Intell..

[14]  Steve A. Chien Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains , 1989, IJCAI.

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

[16]  Jaime G. Carbonell,et al.  Derivational analogy: a theory of reconstructive problem solving and expertise acquisition , 1993 .

[17]  Kristian J. Hammond Learning to Anticipate and Avoid Planning Problems through the Explanation of Failures , 1986, AAAI.

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

[19]  Jaime G. Carbonell,et al.  Towards a General Framework for Composing Disjunctive and Iterative Macro-operators , 1989, IJCAI.

[20]  Thomas Ellman,et al.  Approximate Theory Formation: An Explanation-Based Approach , 1988, AAAI.

[21]  Milind Tambe Eliminating combinatorics from production match , 1991 .

[22]  Gregg Collins,et al.  Reference features as guides to reasoning about opportunities , 1992 .

[23]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[24]  Marianne Winslett Validating Generalized Plans in the Presence of Incomplete Information , 1987, AAAI.

[25]  Mark S. Boddy,et al.  Solving Time-Dependent Planning Problems , 1989, IJCAI.

[26]  Peter Clark,et al.  Lazy Partial Evaluation: An Integration of Explanation-Based Generalization and Partial Evaluation , 1992, ML.