Monotone conditional complexity bounds on future prediction errors
Download (212.14 kB)
-
Altmetric Citations
Chernov, Alexey; Hutter, Marcus
Description
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 μ by the algorithmic complexity of μ. 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 μ given x, plus the complexity of the randomness deficiency of x. The new complexity is...[Show more]
Collections | ANU Research Publications |
---|---|
Date published: | 2005 |
Type: | Conference paper |
URI: | http://hdl.handle.net/1885/15038 |
Book Title: | Algorithmic Learning Theory: 16th International Conference, ALT 2005, Singapore, October 8-11, 2005. Proceedings |
DOI: | 10.1007/11564089_32 |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
Chernov and Hutter Monotone COnditional Complexicty Bounds 2005.pdf | 212.14 kB | Adobe PDF |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator