Skip navigation
Skip navigation

Sequence prediction based on monotone complexity

Hutter, Marcus


This paper studies sequence prediction based on the monotone Kolmogorov complexity Km = − logm, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonoff’s 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 closeness of...[Show more]

CollectionsANU Research Publications
Date published: 2003
Type: Conference paper
DOI: 10.1007/978-3-540-45167-9_37


File Description SizeFormat Image
Hutter Sequence Prediction based on Monotone Complexity 2003.pdf276.89 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