Sciweavers

1419 search results - page 111 / 284
» Approximation Methods for Supervised Learning
Sort
View
102
Voted
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 19 days ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen
126
Voted
ICML
2010
IEEE
15 years 1 months ago
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
CVPR
2010
IEEE
15 years 3 months ago
Classification and Clustering via Dictionary Learning with Structured Incoherence
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
Pablo Sprechmann, Ignacio Ramirez, Guillermo Sapir...
102
Voted
ICML
2009
IEEE
16 years 1 months ago
More generality in efficient multiple kernel learning
Recent advances in Multiple Kernel Learning (MKL) have positioned it as an attractive tool for tackling many supervised learning tasks. The development of efficient gradient desce...
Manik Varma, Bodla Rakesh Babu
ICML
2009
IEEE
16 years 1 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo