Online Ranking by Projecting

We discuss the problem of ranking instances. In our framework, each instance is associated with a rank or a rating, which is an integer in 1 to k. Our goal is to find a rank-prediction rule that assigns each instance a rank that is as close as possible to the instance's true rank. We discuss a group of closely related online algorithms, analyze their performance in the mistake-bound model, and prove their correctness. We describe two sets of experiments, with synthetic data and with the Each Movie data set for collaborative filtering. In the experiments we performed, our algorithms outperform online algorithms for regression and classification applied to ranking.

[1]  Bernard Widrow,et al.  Adaptive switching circuits , 1988 .

[2]  John G. Kemeny,et al.  Mathematical models in the social sciences , 1964 .

[3]  John G. Kemeny,et al.  Mathematical models in the social sciences , 1964 .

[4]  Yoram Singer,et al.  An Efficient Boosting Algorithm for Combining Preferences by , 2013 .

[5]  Amnon Shashua,et al.  Ranking with Large Margin Principle: Two Approaches , 2002, NIPS.

[6]  Nello Cristianini,et al.  An Introduction to Support Vector Machines and Other Kernel-based Learning Methods , 2000 .

[7]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[8]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[9]  Yoram Singer,et al.  Learning to Order Things , 1997, NIPS.

[10]  Neil D. Lawrence,et al.  Advances in Neural Information Processing Systems 14 , 2002 .

[11]  Y. Singer,et al.  Ultraconservative online algorithms for multiclass problems , 2003 .

[12]  Koby Crammer,et al.  Pranking with Ranking , 2001, NIPS.

[13]  Manfred K. Warmuth,et al.  Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..

[14]  Thore Graepel,et al.  Large Margin Rank Boundaries for Ordinal Regression , 2000 .

[15]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[16]  N. Littlestone.  Mistake bounds and logarithmic linear-threshold learning algorithms , 1990 .

[17]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[18]  Nello Cristianini,et al.  An introduction to Support Vector Machines , 2000 .

[19]  F ROSENBLATT,et al.  The perceptron: a probabilistic model for information storage and organization in the brain. , 1958, Psychological review.

[20]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[21]  Yoav Freund,et al.  Large Margin Classification Using the Perceptron Algorithm , 1998, COLT.

[22]  Edward F. Harrington,et al.  Online Ranking/Collaborative Filtering Using the Perceptron Algorithm , 2003, ICML.