412 search results - page 27 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
ML
2002
ACM
14 years 11 months ago
2002
ACM
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
101
click to vote
COLT
2006
Springer
15 years 3 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
110
click to vote
COLT
1993
Springer
15 years 3 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
103
click to vote
JMLR
2006
14 years 11 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
104
Voted
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract— For many tasks in populated environments, robots need to keep track of present and future motion states of people. Most approaches to people tracking make weak assumpti...