On the foundations of universal sequence prediction
Loading...
Date
Authors
Hutter, Marcus
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag
Abstract
Solomonoff completed the Bayesian framework by providing a rigorous, unique, formal, and universal choice for the model class and the prior. We discuss in breadth how and in which sense universal (non-i.i.d.) sequence prediction solves various (philosophical) problems of traditional Bayesian sequence prediction. We show that Solomonoff’s model possesses many desirable properties: Fast convergence and strong bounds, and in contrast to most classical continuous prior densities has no zero p(oste)rior problem, i.e. can confirm universal hypotheses, is reparametrization and regrouping invariant, and avoids the old-evidence and updating problem. It even performs well (actually better) in non-computable environments.
Description
Citation
Collections
Source
Type
Book Title
Theory and Applications of Models of Computation: Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006. Proceedings
Entity type
Access Statement
License Rights
Restricted until
Downloads
File
Description