Dynamic Optimization

We distinguish static and dynamic optimization of programs: whereas static optimization modifies a program before runtime and is based only its syntactical structure, dynamic optimization is based on the statistical properties of the input source and examples of program execution. Explanation-based generalization is a commonly used dynamic optimization method, but its effectiveness as a speedup-learning method is limited, in part because it fails to separate the learning process from the program transformation process. This paper describes a dynamic optimization technique called a learn-optimize cycle that first uses a learning element to uncover predictable patterns in the program execution and then uses an optimization algorithm to map these patterns into beneficial transformations. The technique has been used successfully for dynamic optimization of pure Prolog.

[1]  R. Vidal.  Dynamic optimization: The calculus of variations and optimal control in economics and management: Morton I. KAMIEN and Nancy L. SCHWARTZ Volume 4 in: Dynamic Economics: Theory and Applications, North-Holland, New York, 1981, xi + 331 pages, Dfl.90.00 , 1982 .

[2]  H. Halkin.  Necessary conditions for optimal control problems with infinite horizons , 1974 .

[3]  Oren Etzioni,et al.  Why PRODIGY/EBL Works , 1990, AAAI.

[4]  Ronald Saul,et al.  Discrete Sequence Prediction and Its Applications , 2004, Machine Learning.

[5]  E. Polak,et al.  Theory of optimal control and mathematical programming , 1969 .

[6]  Benjamin W. Wah,et al.  Efficient reordering of Prolog programs , 1988, Proceedings. Fourth International Conference on Data Engineering.

[7]  Ronald Saul,et al.  Discrete sequence prediction and its applications , 2005, Machine Learning.

[8]  Leon Sterling,et al.  The Art of Prolog , 1987, IEEE Expert.

[9]  H. Hotelling.  The economics of exhaustible resources , 1931, Journal of Political Economy.

[10]  Stanley Letovsky,et al.  Operationality Criteria for Recursive Predicates , 1990, AAAI.

[11]  Jaime G. Carbonell,et al.  Learning effective search control knowledge: an explanation-based approach , 1988 .

[12]  Hisao Tamaki,et al.  Unfold/Fold Transformation of Logic Programs , 1984, ICLP.

[13]  George Hendrikse,et al.  The Theory of Industrial Organization , 1989 .

[14]  R. Dorfman.  An Economic Interpretation of Optimal Control Theory , 1969 .

[15]  Philip D. Laird,et al.  Efficient unsupervised learning , 1988, COLT '88.

[16]  D. Ryan,et al.  Dynamic Macroeconomic Theory , 1988 .

[17]  K BhargavaHemant,et al.  Computing as Utility , 2004 .

[18]  Seiji Yamada,et al.  Computing the Utility of EBL in a Logic Programming Environment , 1992 .

[19]  G. Chow,et al.  Dynamic Economics: Optimization by the Lagrange Method , 1997 .

[20]  Shaul Markovitch,et al.  Utilization Filtering: A Method for Reducing the Inherent Harmfulness of Deductively Learned Knowledge , 1989, IJCAI.

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

[22]  Joseph E. Stiglitz,et al.  Monopoly and the Rate of Extraction of Exhaustible Resources , 1976 .

[23]  G. Hadley,et al.  Variational methods in economics , 1972 .

[24]  Naoki Abe,et al.  On the computational complexity of approximating distributions by probabilistic automata , 1990, Machine Learning.

[25]  Jon M. Conrad,et al.  Natural Resource Economics: Notes and Problems , 1987 .

[26]  J. Shavlik.  Acquiring Recursive and Iterative Concepts with Explanation-Based Learning , 1990, Machine Learning.

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

[28]  Russell Greiner,et al.  Towards a Formal Analysis of EBL , 1989, ML.

[29]  Philip D. Laird,et al.  EBG and Term-Rewriting Systems , 1990, ALT.

[30]  P. Samuelson.  LIFETIME PORTFOLIO SELECTION BY DYNAMIC STOCHASTIC PROGRAMMING , 1969 .

[31]  A. Dixit.  Optimization in Economic Theory , 1976 .