Skip navigation
Skip navigation

Sequential predictions based on algorithmic complexity

Hutter, Marcus


This paper studies sequence prediction based on the monotone Kolmogorov complexity Km = − log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonoff’s universal prior M, the latter being an excellent predictor in deterministic as well as probabilistic environments, where performance is measured in terms of convergence of posteriors or losses. Despite this closeness to M, it is difficult to assess the prediction quality of m, since little is known about the...[Show more]

CollectionsANU Research Publications
Date published: 2006-02
Type: Journal article
Source: Journal of Computer and System Sciences
DOI: 10.1016/j.jcss.2005.07.001


File Description SizeFormat Image
Hutter et al Sequential Predictions based on Algorithmic Complexity 2006.pdf357.29 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