Sciweavers

1419 search results - page 68 / 284
» Approximation Methods for Supervised Learning
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Tracking value function dynamics to improve reinforcement learning with piecewise linear function approximation
Reinforcement learning algorithms can become unstable when combined with linear function approximation. Algorithms that minimize the mean-square Bellman error are guaranteed to co...
Chee Wee Phua, Robert Fitch
IJCAI
2001
13 years 11 months ago
Active Learning for Class Probability Estimation and Ranking
For many supervised learning tasks it is very costly to produce training data with class labels. Active learning acquires data incrementally, at each stage using the model learned...
Maytal Saar-Tsechansky, Foster J. Provost
ICML
2009
IEEE
14 years 10 months ago
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
14 years 1 months ago
New perspectives and methods in link prediction
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse network...
Ryan Lichtenwalter, Jake T. Lussier, Nitesh V. Cha...
ICML
2010
IEEE
13 years 11 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun