18 search results - page 1 / 4 » New Error Bounds for Solomonoff Prediction |
85
Voted
CORR
1999
Springer
14 years 10 months ago
1999
Springer
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 i...
90
Voted
CORR
2007
Springer
14 years 11 months 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...
75
Voted
DAGSTUHL
2006
15 years 9 days 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...
81
Voted
CJ
2008
14 years 11 months ago
2008
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
77
Voted
ICASSP
2011
IEEE
14 years 2 months ago
2011
IEEE
We describe a new approach for phoneme recognition which aims at minimizing the phoneme error rate. Building on structured prediction techniques, we formulate the phoneme recogniz...