Sciweavers

12194 search results - page 53 / 2439
» Numberings Optimal for Learning
Sort
View
93
Voted
DAM
2007
84views more  DAM 2007»
15 years 15 days ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti
134
Voted
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
14 years 10 months ago
Uncertainty handling CMA-ES for reinforcement learning
The covariance matrix adaptation evolution strategy (CMAES) has proven to be a powerful method for reinforcement learning (RL). Recently, the CMA-ES has been augmented with an ada...
Verena Heidrich-Meisner, Christian Igel
93
Voted
ICML
2009
IEEE
16 years 1 months ago
A simpler unified analysis of budget perceptrons
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
Ilya Sutskever
99
Voted
CSDA
2006
94views more  CSDA 2006»
15 years 17 days ago
Signal extraction for simulated games with a large number of players
A signal extraction problem in simulated games is studied. A modelling technique is proposed for deriving beliefs for players in simulated games. Since standard Bayesian games pro...
Aki Lehtinen
109
Voted
ICML
2009
IEEE
16 years 1 months ago
Regularization and feature selection in least-squares temporal difference learning
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
J. Zico Kolter, Andrew Y. Ng