701 search results - page 52 / 141 » Self Bounding Learning Algorithms |
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we consider the problem of policy evaluation in reinforcement learning, i.e., learning the value function of a fixed policy, using the least-squares temporal-differe...
108
Voted
EUROCOLT
1999
Springer
15 years 4 months ago
1999
Springer
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
109
Voted
COLT
2001
Springer
15 years 5 months ago
2001
Springer
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
120
click to vote
PKDD
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...