Skip navigation
Skip navigation

Monotone conditional complexity bounds on future prediction errors

Chernov, Alexey; Hutter, Marcus


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]

CollectionsANU Research Publications
Date published: 2005
Type: Conference paper
DOI: 10.1007/11564089_32


File Description SizeFormat Image
Chernov and Hutter Monotone COnditional Complexicty Bounds 2005.pdf212.14 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator