On the Foundations of Universal Sequence Prediction
Marcus Hutter
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.
Create a lesson
Related papers
TopGQ: Fast GNN Post-Training Quantization Leveraging Topology Information
Dain Kwon, Kanghyun Choi, Hyeyoon Lee et al.
Foundation Models Meet Agriculture: Challenges Beyond Pretraining
Vishal Nedungadi, Xingguo Xiong, Marc Rußwurm et al.
Uncertainty of Vision Medical Foundation Models
Haoxu Huang, Narges Razavian
DASC: Decay-Aware State Compression for Hybrid Linear-Attention Serving
Yanqi Yu, Pingwei Sun, Jianchao Tan et al.
RSLM: Training-Free Vector Quantization for Approximate Nearest Neighbor Search
Rastislav Lenhardt, Teodora Dobos, Thomas Vecchiato et al.
Convergence rates for the RMSprop optimizer with full control of the hyperparameters
Steffen Dereich, Arnulf Jentzen