On the foundations of universal sequence prediction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3959 LNCS, Issue , 2006, Pages 408-420

  Hutter, Marcus ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; MATHEMATICAL MODELS; PHASE SEQUENCE INDICATORS; STATISTICAL METHODS;

BAYESIAN FRAMEWORK; BAYESIAN SEQUENCE PREDICTION; SOLOMONOFF'S MODEL;

PROBLEM SOLVING;

EID: 33745814798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11750321_39     Document Type: Conference Paper

References (14)

1. [CB90] B. S. Clarke and A. R. Barron. Information-theoretic asymptotics of Bayes methods. IEEE Transactions on Information Theory, 36:453-471, 1990.
2. [CV05] R. Cilibrasi and P. M. B. Vitányi. Clustering by compression. IEEE Trans. Information Theory, 51(4):1523-1545, 2005.
3. [Ear93] J. Earman. Bayes or Bust? A Critical Examination of Bayesian Confirmation Theory. MIT Press, Cambridge, MA, 1993.
4. [Hut04] M. Hutter. Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. Springer, Berlin, 2004. 300 pages, http://wwv.idsia.ch/~marcus/ai/uaibook.htm.
5. [KW96] R. E. Kass and L. Wasserman. The selection of prior distributions by formal rules. Journal of the American Statistical Association, 91 (435):1343-1370, 1996.
6. [LV97] M. Li and P. M. B. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer, Berlin, 2nd edition, 1997.
7. [PH04] J. Poland and M. Hutter. On the convergence speed of MDL predictions for Bernoulli sequences. In Proc. 15th International Conf. on Algorithmic Learning Theory (ALT'04), volume 3244 of LNAI, pages 294-308, Padova, 2004. Springer, Berlin.
8. [Sch02] J. Schmidhuber. Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit. International Journal of Foundations of Computer Science, 13(4):587-612, 2002.
9. [Sch04] J. Schmidhuber. Optimal ordered problem solver. Machine Learning, 54(3):211-254, 2004.
10. [Sol64] R. J. Solomonoff. A formal theory of inductive inference: Parts 1 and 2. Information and Control, 7:1-22 and 224-254, 1964.
11. [Sol78] R. J. Solomonoff. Complexity-based induction systems: Comparisons and convergence theorems. IEEE Transactions on Information Theory, IT-24:422-432, 1978.
12. [Wal96] P. Walley. Inferences from multinomial data: learning about a bag of marbles. Journal of the Royal Statistical Society B, 58(1):3-57, 1996.
13. [Wal05] C. S. Wallace. Statistical and Inductive Inference by Minimum Message Length. Springer, Berlin, 2005.
14. [ZL70] A. K. Zvonkin and L. A. Levin. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys, 25(6):83-124, 1970.