Self-optimizing and Pareto-optimal policies in general environments based on Bayes-mixtures

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2375, Issue , 2002, Pages 364-379

  Hutter, Marcus ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; COMPUTATION THEORY; MARKOV PROCESSES; MIXTURES; PARETO PRINCIPLE; PROBABILITY DISTRIBUTIONS; REINFORCEMENT LEARNING;

BAYES MIXTURES; BAYESIAN APPROACHES; CLASS OF DISTRIBUTIONS; MARKOV DECISION PROCESSES; MIXTURE DISTRIBUTIONS; SELF-OPTIMIZING; SEQUENTIAL DECISIONS; STRUCTURAL ASSUMPTION;

DECISION THEORY;

EID: 84937417436     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45435-7_25     Document Type: Conference Paper

References (14)

1. [Bel57] R. Bellman. Dynamic Programming. Princeton University Press, New Jersey, 1957.
2. [Ber95] D. P. Bertsekas. Dynamic Programming and Optimal Control, Vol. (I) and (II). Athena Scientific, Belmont, Massachusetts, 1995. Volumes 1 and 2.
3. [BT00] R. I. Brafman and M. Tennenholtz. A near-optimal polynomial time algorithm for learning in certain classes of stochastic games. Artificial Intelligence, 121(1-2):31-47, 2000.
4. [Doo53] J. L. Doob. Stochastic Processes. John Wiley & Sons, New York, 1953.
5. [Hut00] M. Hutter. A theory of universal artificial intelligence based on algorithmic complexity. Technical Report cs.AI/0004001, 62 pages, 2000. http://arxiv.org/abs/cs.AI/0004001.
6. th International Conference on Machine Learning (ICML- 2001), pages 210-217, 2001.
7. [KLM96] L. P. Kaelbling, M. L. Littman, and A. W. Moore. Reinforcement learning: a survey. Journal of AI research, 4:237-285, 1996.
8. [KS98] M. Kearns and S. Singh. Near-optimal reinforcement learning in polynomial time. In Proc. 15th International Conf. on Machine Learning, pages 260-268. Morgan Kaufmann, San Francisco, CA, 1998.
9. [KV86] P. R. Kumar and P. P. Varaiya. Stochastic Systems: Estimation, Identification, and Adaptive Control. Prentice Hall, Englewood Cliffs, NJ, 1986.
10. [LV97] M. Li and P. M. B. Vitányi. An introduction to Kolmogorov complexity and its applications. Springer, 2nd edition, 1997.
11. [RN95] S. J. Russell and P. Norvig. Artificial Intelligence. A Modern Approach. Prentice-Hall, Englewood Cliffs, 1995.
12. [SB98] R. Sutton and A. Barto. Reinforcement learning: An introduction. Cambridge, MA, MIT Press, 1998.
13. [Sch02] J. Schmidhuber. The Speed Prior: a new simplicity measure yielding nearoptimal computable predictions. Proceedings of the 15th Annual Conference on Computational Learning Theory (COLT 2002), 2002.
14. [Sol78] R. J. Solomonoff. Complexity-based induction systems: comparisons and convergence theorems. IEEE Trans. Inform. Theory, IT-24:422-432, 1978.