PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Ranking and scoring using empirical risk minimization
Stephan Clemencon, Gábor Lugosi and Nicolas Vayatis
In: COLT 2005, June 2005, Bertinoro, Italy.


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 empirical estimates are of the form of a $U$-statistic. Inequalities from the theory of $U$-statistics and $U$-processes are used to obtain performance bounds for the empirical risk minimizers. Convex risk minimization methods are also studied to give a theoretical framework for ranking algorithms based on boosting and support vector machines. Just like in binary classification, fast rates of convergence are achieved under certain noise assumption. General sufficient conditions are proposed in several special cases that guarantee fast rates of convergence.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
Theory & Algorithms
ID Code:1361
Deposited By:Gábor Lugosi
Deposited On:28 November 2005