Sciweavers

908 search results - page 102 / 182
» Stochastic Finite Learning
Sort
View
ICML
2010
IEEE
15 years 3 months ago
Toward Off-Policy Learning Control with Function Approximation
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
Hamid Reza Maei, Csaba Szepesvári, Shalabh ...
ICDM
2007
IEEE
157views Data Mining» more  ICDM 2007»
15 years 4 months ago
Training Conditional Random Fields by Periodic Step Size Adaptation for Large-Scale Text Mining
For applications with consecutive incoming training examples, on-line learning has the potential to achieve a likelihood as high as off-line learning without scanning all availabl...
Han-Shen Huang, Yu-Ming Chang, Chun-Nan Hsu
NIPS
2004
15 years 4 months ago
Neighbourhood Components Analysis
In this paper we propose a novel method for learning a Mahalanobis distance measure to be used in the KNN classification algorithm. The algorithm directly maximizes a stochastic v...
Jacob Goldberger, Sam T. Roweis, Geoffrey E. Hinto...
IJCAI
2003
15 years 4 months ago
Covariant Policy Search
We investigate the problem of non-covariant behavior of policy gradient reinforcement learning algorithms. The policy gradient approach is amenable to analysis by information geom...
J. Andrew Bagnell, Jeff G. Schneider
CVPR
2008
IEEE
16 years 4 months ago
Spectral methods for semi-supervised manifold learning
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data poin...
Zhenyue Zhang, Hongyuan Zha, Min Zhang