Monotone Conditional Complexity Bounds on Future Prediction Errors

We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true distribution µ by the algorithmic complexity

• Type: Conference
• Year: 2005
• Where: ALT
• Authors: Alexey V. Chernov, Marcus Hutter
• Keywords: ALT 2005, Machine Learning, Stochastic Sequence Online, Total Deviation, Universal Predictor