Skip navigation
Skip navigation

New error bounds for Solomonoff prediction

Hutter, Marcus


Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when it knows the true probability distribution of the sequence. Several new relations between universal Solomonoff sequence prediction and informed prediction and general probabilistic prediction schemes will be proved. Among others, they show that the number of errors in Solomonoff prediction is finite for computable...[Show more]

CollectionsANU Research Publications
Date published: 2001-06
Type: Journal article
Source: Journal of Computer and System Sciences
DOI: 10.1006/jcss.2000.1743


File Description SizeFormat Image
Hutter New Error Bounds for Solomonoff Prediction 2001.pdf195.77 kBAdobe PDFThumbnail

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator