PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Bipartite Ranking through Minimization of Univariate Loss
Wojciech Kotlowski, Krzysztof Dembczynski and Eyke Huellermeier
In: ICML 2011, 28 Jun - 02 Jul 2011, Bellevue, WA, USA.


Minimization of the rank loss or, equivalently, maximization of the AUC in bipartite ranking calls for minimizing the number of disagreements between pairs of instances. Since the complexity of this problem is inherently quadratic in the number of training examples, it is tempting to ask how much is actually lost by minimizing a simple univariate loss function, as done by standard classification methods, as a surrogate. In this paper, we first note that minimization of 0/1 loss is not an option, as it may yield an arbitrarily high rank loss. We show, however, that better results can be achieved by means of a weighted (cost-sensitive) version of 0/1 loss. Yet, the real gain is obtained through marginbased loss functions, for which we are able to derive proper bounds, not only for rank risk but, more importantly, also for rank regret. The paper is completed with an experimental study in which we address specific questions raised by our theoretical analysis.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
ID Code:9277
Deposited By:Wojciech Kotlowski
Deposited On:21 February 2012