412 search results - page 43 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
104
click to vote
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— In this paper we predict the amount of slip an exploration rover would experience using stereo imagery by learning from previous examples of traversing similar terrain. To do t...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. We call devices with that structure “inference de...
JMLR
2010
14 years 6 months ago
2010
Hsu et al. (2009) recently proposed an efficient, accurate spectral learning algorithm for Hidden Markov Models (HMMs). In this paper we relax their assumptions and prove a tighte...
122
click to vote
COLT
2000
Springer
15 years 4 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...