Sciweavers

3837 search results - page 293 / 768
» Learning Approximate Consistencies
Sort
View
ICML
2005
IEEE
16 years 8 months ago
Fast maximum margin matrix factorization for collaborative prediction
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
Jason D. M. Rennie, Nathan Srebro
ICML
2003
IEEE
16 years 8 months ago
Exploration in Metric State Spaces
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
Sham Kakade, Michael J. Kearns, John Langford
ICML
2003
IEEE
16 years 8 months ago
TD(0) Converges Provably Faster than the Residual Gradient Algorithm
In Reinforcement Learning (RL) there has been some experimental evidence that the residual gradient algorithm converges slower than the TD(0) algorithm. In this paper, we use the ...
Ralf Schoknecht, Artur Merke
ICML
2002
IEEE
16 years 8 months ago
A New Statistical Approach to Personal Name Extraction
We propose a new statistical approach to extracting personal names from a corpus. One of the key points of our approach is that it can both automatically learn the characteristics...
Zheng Chen, Liu Wenyin, Feng Zhang
COLT
2007
Springer
16 years 1 months ago
Sketching Information Divergences
When comparing discrete probability distributions, natural measures of similarity are not p distances but rather are informationdivergences such as Kullback-Leibler and Hellinger. ...
Sudipto Guha, Piotr Indyk, Andrew McGregor