Sciweavers

733 search results - page 58 / 147
» Learning Riemannian Metrics
Sort
View
ESANN
2008
13 years 10 months ago
Similarities and differences between policy gradient methods and evolution strategies
Natural policy gradient methods and the covariance matrix adaptation evolution strategy, two variable metric methods proposed for solving reinforcement learning tasks, are contrast...
Verena Heidrich-Meisner, Christian Igel

Presentation
896views
13 years 6 months ago
Exponential families and simplification of mixture models
Presentation of the exponential families, of the mixtures of such distributions and how to learn it. We then present algorithms to simplify mixture model, using Kullback-Leibler di...
ICML
2007
IEEE
14 years 9 months ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
ICMLA
2003
13 years 10 months ago
Reinforcement Learning Task Clustering
This work represents the first step towards a task library system in the reinforcement learning domain. Task libraries could be useful in speeding up the learning of new tasks th...
James L. Carroll, Todd S. Peterson, Kevin D. Seppi
ICML
2009
IEEE
14 years 9 months ago
Efficient learning algorithms for changing environments
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
Elad Hazan, C. Seshadhri