945 search results - page 19 / 189 » Dialog Convergence and Learning |
COLT
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We pose the problem of determining the rate of convergence at which AdaBoost minimizes exponential loss. Boosting is the problem of combining many "weak," high-...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The regularization functional induced by the graph Laplacian of a random neighborhood graph based on the data is adaptive in two ways. First it adapts to an underlying ma...
JMLR
2010
14 years 4 months ago
2010
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
76
Voted
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
In Reinforcement Learning (RL) there has been some experimental evidence that the residual gradient algorithm converges slower than the TD(0) algorithm. In this paper, we use the ...
76
Voted
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...