Sciweavers

10 search results - page 1 / 2
» Monotone Conditional Complexity Bounds on Future Prediction ...
Sort
View
92
Voted
ALT
2005
Springer
15 years 9 months ago
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 ...
Alexey V. Chernov, Marcus Hutter
86
Voted
DAGSTUHL
2006
15 years 1 months ago
Complexity Monotone in Conditions and 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 dis...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
103
Voted
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 7 days ago
Algorithmic 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 d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
112
Voted
ATAL
2008
Springer
15 years 2 months ago
Approximate predictive state representations
Predictive state representations (PSRs) are models that represent the state of a dynamical system as a set of predictions about future events. The existing work with PSRs focuses ...
Britton Wolfe, Michael R. James, Satinder P. Singh
108
Voted
ML
2000
ACM
103views Machine Learning» more  ML 2000»
15 years 1 days ago
Nonparametric Time Series Prediction Through Adaptive Model Selection
We consider the problem of one-step ahead prediction for time series generated by an underlying stationary stochastic process obeying the condition of absolute regularity, describi...
Ron Meir