9841 search results - page 775 / 1969 » Distributed Value Functions |
197
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...
193
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper, we present a new interpretation of AdaBoost.ECC and AdaBoost.OC. We show that AdaBoost.ECC performs stage-wise functional gradient descent on a cost function, defin...
221
click to vote
ICML
2003
IEEE
16 years 8 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
211
click to vote
STOC
2007
ACM
16 years 8 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
208
click to vote
ATAL
2009
Springer
16 years 2 months ago
2009
Springer
The field of transfer learning aims to speed up learning across multiple related tasks by transferring knowledge between source and target tasks. Past work has shown that when th...