701 search results - page 118 / 141 » Self Bounding Learning Algorithms |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
JMLR
2010
13 years 2 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
COLT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but r...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
A general model is proposed for studying ranking problems. We investigate learning methods based on empirical minimization of the natural estimates of the ranking risk. The empiric...
EWRL
2008
13 years 9 months ago
2008
We consider planning in a Markovian decision problem, i.e., the problem of finding a good policy given access to a generative model of the environment. We propose to use fitted Q-i...