Bias-optimal incremental problem solving

Advances in Neural Information Processing Systems

Volumn , Issue , 2003, Pages

  Schmidhuber, Jürgen ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY DISTRIBUTIONS;

COMPUTING SOLUTIONS; GENERAL SYSTEMS; INCREMENTAL LEARNING; MINIMAL SOLUTIONS; RUNTIMES; SEARCH TIME; TESTED PROGRAMS; TOWERS OF HANOI;

SOFTWARE TESTING;

EID: 84898985714     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. C.W. Anderson. Learning and Problem Solving with Multilayer Connectionist Systems. PhD thesis, University of Massachusetts, Dept. of Comp. and Inf. Sei., 1986.
2. N. L. Cramer. A representation for the adaptive generation of simple sequential programs. In J.J. Grefenstette, editor, Proceedings of an International Conference on Genetic Algorithms and Their Applications, Carnegie-Mellon University, July 24-26, 1985, Hillsdale NJ, 1985. Lawrence Erlbaum Associates.
3. M. Hutter. The fastest and shortest algorithm for all well-defined problems. International Journal of Foundations of Computer Science, 13(3): 431-443, 2002.
4. L.P. Kaelbling, M.L. Littman, and A.W. Moore. Reinforcement learning: a survey. Journal of AI research, 4: 237-285, 1996.
5. P. Langley. Learning to search: from weak methods to domain-specific heuristics. Cognitive Science, 9: 217-260, 1985.
6. L. A. Levin. Universal sequential search problems. Problems of Information Transmission, 9(3): 265-266, 1973.
7. M. Li and P. M. B. Vitányi. An Introduction to Kolmogorov Complexity and its Applications (2nd edition). Springer, 1997.
8. C. H. Moore and G. C. Leach. FORTH - a language for interactive computing, 1970. http://www.ultratechnology.com.
9. J. Schmidhuber. Optimal ordered problem solver. Technical Report IDSIA-12-02, arXivxs.AI/0207097v1, IDSIA, Manno-Lugano, Switzerland, July 2002.
10. J. Schmidhuber, J. Zhao, and M. Wiering. Shifting inductive bias with success-story algorithm, adaptive Levin search, and incremental self-improvement. Machine Learning, 28: 105-130, 1997.
11. R.J. Solomonoff An application of algorithmic probability to problems in artificial intelligence. In L. N. Kanal and J. F. Lemmer, editors, Uncertainty in Artificial Intelligence, pages 473-491. Elsevier Science Publishers, 1986.