131 search results - page 1 / 27 » Sequence Prediction Based on Monotone Complexity |
113
Voted
COLT
2003
Springer
15 years 5 months ago
2003
Springer
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 Solomon...
91
Voted
JCSS
2006
15 years 6 days ago
2006
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 Solomonof...
92
Voted
ALT
2005
Springer
15 years 9 months ago
2005
Springer
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 ...
86
Voted
DAGSTUHL
2006
15 years 1 months ago
2006
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 dis...
103
Voted
CORR
2007
Springer
15 years 7 days ago
2007
Springer
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 d...