Algorithmic complexity bounds on future prediction errors

DOI10.1016/j.ic.2006.10.004zbMath1107.68044arXivcs/0701120OpenAlexW2139750407WikidataQ58012403 ScholiaQ58012403MaRDI QIDQ865627

Jürgen Schmidhuber, Marcus Hutter, Alexei Chernov

Publication date: 20 February 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0701120

zbMATH Keywords

Kolmogorov complexityrandomness deficiencySolomonoff priortotal errorfuture lossmonotone conditional complexityonline sequential predictionposterior bounds

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (5)

On universal prediction and Bayesian confirmation ⋮ Open problems in universal induction \& intelligence ⋮ A philosophical treatise of universal induction ⋮ Unnamed Item ⋮ On calibration error of randomized forecasting algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Universal artificial intelligence. Sequential decisions based on algorithmic probability.
• Sequential predictions based on algorithmic complexity
• HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
• Clustering by Compression
• Convergence and loss bounds for bayesian sequence prediction
• Complexity-based induction systems: Comparisons and convergence theorems
• Learning Theory
• Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences
• 10.1162/1532443041827952
• Relations between varieties of kolmogorov complexities
• Learning Theory and Kernel Machines
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• A formal theory of inductive inference. Part I
• New error bounds for Solomonoff prediction

This page was built for publication: Algorithmic complexity bounds on future prediction errors