DagSemProc.06051.6.pdf
- Filesize: 295 kB
- 20 pages
Document
Complexity Monotone in Conditions and Future Prediction Errors
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 6051
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-07-31
Cite As Get BibTex
Alexey Chernov, Marcus Hutter, and Jürgen Schmidhuber. Complexity Monotone in Conditions and Future Prediction Errors. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.06051.6
Abstract
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor $M$ from the true distribution $mu$ by the algorithmic complexity of $mu$. Here we assume we are at a time $t>1$ and already observed $x=x_1...x_t$. We bound the future prediction performance on $x_{t+1}x_{t+2}...$ by a new variant of algorithmic complexity of $mu$ given $x$, plus the complexity of the randomness deficiency of $x$. The new
complexity is monotone in its condition in the sense that this complexity can only decrease if the condition is prolonged. We also briefly discuss potential generalizations to Bayesian model classes and to classification problems.
Subject Classification
Keywords
- Kolmogorov complexity
- posterior bounds
- online sequential prediction
- Solomonoff prior
- monotone conditional complexity
- total error
- future loss
- ra
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads