Sciweavers

1227 search results - page 23 / 246
» Learning Rates for Q-Learning
Sort
View
RECSYS
2009
ACM
15 years 4 months ago
Recommending new movies: even a few ratings are more valuable than metadata
In the Netflix Prize competition many new collaborative filtering (CF) approaches emerged, which are excellent in optimizing the RMSE of the predictions. Matrix factorization (M...
István Pilászy, Domonkos Tikk
NIPS
1998
14 years 11 months ago
Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
Michael J. Kearns, Satinder P. Singh
64
Voted
ICML
2005
IEEE
15 years 10 months ago
A comparison of tight generalization error bounds
We investigate the empirical applicability of several bounds (a number of which are new) on the true error rate of learned classifiers which hold whenever the examples are chosen ...
John Langford, Matti Kääriäinen
JMLR
2010
82views more  JMLR 2010»
14 years 4 months ago
Negative Results for Active Learning with Convex Losses
We study the problem of active learning with convex loss functions. We prove that even under bounded noise constraints, the minimax rates for proper active learning are often no b...
Steve Hanneke, Liu Yang
92
Voted
UAI
2004
14 years 11 months ago
A Bayesian Approach toward Active Learning for Collaborative Filtering
Collaborative filtering is a useful technique for exploiting the preference patterns of a group of users to predict the utility of items for the active user. In general, the perfo...
Rong Jin, Luo Si