Sciweavers

744 search results - page 52 / 149
» Information-theoretic metric learning
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Using graph analysis to study networks of adaptive agent
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
Sherief Abdallah
ESANN
2008
13 years 11 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 7 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
2005
IEEE
14 years 10 months ago
Q-learning of sequential attention for visual object recognition from informative local descriptors
This work provides a framework for learning sequential attention in real-world visual object recognition, using an architecture of three processing stages. The first stage rejects...
Lucas Paletta, Gerald Fritz, Christin Seifert
ICML
2007
IEEE
14 years 10 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