New error bounds for Solomonoff prediction
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]
|Collections||ANU Research Publications|
|Source:||Journal of Computer and System Sciences|
|Hutter New Error Bounds for Solomonoff Prediction 2001.pdf||195.77 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.