A Statistical Approach to Solving the EBL Utility Problem

Many "learning from experience" systems use information extracted from problem solving experiences to modify a performance element PE, forming a new element PE' that can solve these and similar problems more efficiently. However, as transformations that improve performance on one set of problems can degrade performance on other sets, the new PE' is not always better than the original PE; this depends on the distribution of problems. We therefore seek the performance element whose expected performance, over this distribution, is optimal. Unfortunately. the actual distribution. which is needed to determine which element is optimal is usually not known. Moreover, the task of finding the optimal element, even knowing the distribution, is intractable for most interesting spaces of elements. This paper presents a method, PALO, that side-steps these problems by using a set of samples to estimate the unknown distribution, and by using a set of transformations to hill-climb to a local optimum. This process is based on a mathematically rigorous form of utility analysis: in particular, it uses statistical techniques to determine whether the result of a proposed transformation will be better than the original system. We also present an efficient way of implementing this learning system in the context of a general class of performance elements, and include empirical evidence that this approach can work effectively.

[1]  H. Chernoff A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[2]  Herbert A. Simon,et al.  Optimal Problem-Solving Search: All-Oor-None Solutions , 1975, Artif. Intell..

[3]  Tom M. Mitchell,et al.  Models of Learning Systems. , 1979 .

[4]  William F. Clocksin,et al.  Programming in Prolog , 1981, Springer Berlin Heidelberg.

[5]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  William F. Clocksin,et al.  Programming in Prolog , 1987, Springer Berlin Heidelberg.

[7]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[8]  Béla Bollobás,et al.  Random Graphs , 1985 .

[9]  James L. McClelland,et al.  Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations , 1986 .

[10]  Michael R. Genesereth,et al.  Logical foundations of artificial intelligence , 1987 .

[11]  Allen Newell,et al.  SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..

[12]  Mark S. Boddy,et al.  An Analysis of Time-Dependent Planning , 1988, AAAI.

[13]  Richard M. Keller,et al.  Defining Operationality for Explanation-Based Learning , 1987, Artificial Intelligence.

[14]  Prasad Tadepalli,et al.  Two New Frameworks for Learning , 1988, ML.

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

[16]  David E. Smith Controlling Backward Inference , 1989, Artif. Intell..

[17]  Russell Greiner,et al.  Incorporating Redundant Learned Rules: A Preliminary Formal Analysis of EBL , 1989, IJCAI.

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

[19]  Pekka Orponen,et al.  On the sample complexity of finding good search strategies , 1990, COLT '90.

[20]  William W. Cohen Using distribution-free learning theory to analyze chunking , 1990 .

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

[22]  Gerald DeJong,et al.  A Hybrid Approach to Guaranteed Effective Control Strategies , 1991, ML.

[23]  Russell Greiner,et al.  Measuring and Improving the Effectiveness of Representations , 1991, IJCAI.

[24]  Alexander Russell,et al.  A critical look at experimental evaluations of EBL , 1991, Mach. Learn..

[25]  Russell Greiner,et al.  Finding Optimal Derivation Strategies in Redundant Knowledge Bases , 1991, Artif. Intell..

[26]  Pekka Orponen,et al.  Probably Approximately Optimal Derivation Strategies , 1991, KR.

[27]  Gerald DeJong,et al.  COMPOSER: A Probabilistic Solution to the Utility Problem in Speed-Up Learning , 1992, AAAI.

[28]  R. Greiner Probabilistic Hill-climbing: Theory and Applications , 1992 .

[29]  Dale Schuurmans,et al.  Probabilistic , 2019, 99 Variations on a Proof.