412 search results - page 1 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
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...
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...
104
click to vote
NIPS
2008
15 years 1 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
106
Voted
VR
2010
IEEE
14 years 10 months ago
2010
IEEE
A collaborative virtual environment (CVE) allows remote users to access and modify shared data through networks, such as the Internet. However, when the users are connected via th...