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]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.