3050 search results - page 138 / 610 » On-line Algorithms in Machine Learning |
119
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
In recent work, Kalai, Klivans, Mansour, and Servedio [KKMS05] studied a variant of the "Low-Degree (Fourier) Algorithm" for learning under the uniform probability distr...
140
click to vote
ICMLC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we present a new method, time-striding hidden Markov model (TSHMM), to learn from long-term motion for atomic behaviors and the statistical dependencies among them. T...
122
click to vote
COLT
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
129
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Several algorithms for learning near-optimal policies in Markov Decision Processes have been analyzed and proven efficient. Empirical results have suggested that Model-based Inter...
117
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
Relativized options combine model minimization methods and a hierarchical reinforcement learning framework to derive compact reduced representations of a related family of tasks. ...