A unified algorithmic approach for efficient online label ranking

Shai Shalev-Shwartz*, Yoram Singer

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


Label ranking is the task of ordering labels with respect to their relevance to an input instance. We describe a unified approach for the online label ranking task. We do so by casting the online learning problem as a game against a competitor who receives all the examples in advance and sets its label ranker to be the optimal solution of a constrained optimization problem. This optimization problem consists of two terms: the empirical label-ranking loss of the competitor and a complexity measure of the competitor's ranking function. We then describe and analyze a framework for online label ranking that incrementally ascends the dual problem corresponding to the competitor's optimization problem. The generality of our framework enables us to derive new online update schemes. In particular, we use the relative entropy as a complexity measure to derive efficient multiplicative algorithms for the label ranking task. Depending on the specific form of the instances, the multiplicative updates either have a closed form or can be calculated very efficiently by tailoring an interior point procedure to the label ranking task. We demonstrate the potential of our approach in a few experiments with email categorization tasks.

Original languageEnglish
Pages (from-to)452-459
Number of pages8
JournalProceedings of Machine Learning Research
StatePublished - 2007
Event11th International Conference on Artificial Intelligence and Statistics, AISTATS 2007 - San Juan, Puerto Rico
Duration: 21 Mar 200724 Mar 2007


Dive into the research topics of 'A unified algorithmic approach for efficient online label ranking'. Together they form a unique fingerprint.

Cite this