Learning to Rank

In this tutorial I will introduce ‘learning to rank’, a machine learning technology on constructing a model for ranking objects using training data. I will first explain the problem formulation of learning to rank, and relations between learning to rank and the other learning tasks. I will then describe learning to rank methods developed in recent years, including pointwise, pairwise, and listwise approaches. I will then give an introduction to the theoretical work on learning to rank and the applications of learning to rank. Finally, I will show some future directions of research on learning to rank. The goal of this tutorial is to give the audience a comprehensive survey to the technology and stimulate more research on the technology and application of the technology to natural language processing. Learning to rank has been successfully applied to information retrieval and is potentially useful for natural language processing as well. In fact many NLP tasks can be formalized as ranking problems and NLP technologies may be significantly improved by using learning to rank techniques. These include question answering, summarization, and machine translation. For example, in machine translation, given a sentence in the source language, we are to translate it to a sentence in the target language. Usually there are multiple possible translations and it would be better to sort the possible translations in descending order of their likelihood and output the sorted results. Learning to rank can be employed in the task.

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

[2]  Filip Radlinski,et al.  Learning diverse rankings with multi-armed bandits , 2008, ICML '08.

[3]  Filip Radlinski,et al.  A support vector method for optimizing average precision , 2007, SIGIR.

[4]  John D. Lafferty,et al.  Cranking: Combining Rankings Using Conditional Probability Models on Permutations , 2002, ICML.

[5]  Tao Qin,et al.  Ranking with multiple hyperplanes , 2007, SIGIR.

[6]  Filip Radlinski,et al.  Query chains: learning to rank from implicit feedback , 2005, KDD '05.

[7]  John Guiver,et al.  Learning to rank with SoftRank and Gaussian processes , 2008, SIGIR '08.

[8]  Alexander J. Smola,et al.  Direct Optimization of Ranking Measures , 2007, ArXiv.

[9]  Tao Qin,et al.  Query-level stability and generalization in learning to rank , 2008, ICML '08.

[10]  Tao Qin,et al.  LETOR: Benchmark Dataset for Research on Learning to Rank for Information Retrieval , 2007 .

[11]  Hang Li,et al.  Cost-Sensitive Learning of SVM for Ranking , 2006, ECML.

[12]  Patrick Gallinari,et al.  Ranking with ordered weighted pairwise classification , 2009, ICML '09.

[13]  Hang Li,et al.  AdaRank: a boosting algorithm for information retrieval , 2007, SIGIR.

[14]  Eric Brill,et al.  Learning effective ranking functions for newsgroup search , 2004, SIGIR '04.

[15]  Harry Shum,et al.  Query Dependent Ranking Using K-nearest Neighbor * , 2022 .

[16]  Stephen E. Robertson,et al.  Optimisation methods for ranking functions with multiple parameters , 2006, CIKM '06.

[17]  Hongyuan Zha,et al.  Query-level learning to rank using isotonic regression , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[18]  Tao Qin,et al.  Query-level loss functions for information retrieval , 2008, Inf. Process. Manag..

[19]  Tao Qin,et al.  FRank: a ranking method with fidelity loss , 2007, SIGIR.

[20]  Martin Szummer,et al.  A Decision Theoretic Framework for Ranking using Implicit Feedback , 2008 .

[21]  Maksims Volkovs,et al.  BoltzRank: learning to maximize expected ranking gain , 2009, ICML '09.

[22]  Andrew Trotman,et al.  Learning to Rank , 2005, Information Retrieval.

[23]  Massih-Reza Amini,et al.  Ranking with Unlabeled Data: A First Study , 2005 .

[24]  Stephen E. Robertson,et al.  On rank-based effectiveness measures and optimization , 2007, Information Retrieval.

[25]  W. Bruce Croft,et al.  Direct Maximization of Rank-Based Metrics for Information Retrieval , 2005 .

[26]  Jianfeng Gao,et al.  Linear discriminant model for information retrieval , 2005, SIGIR '05.

[27]  Thorsten Joachims,et al.  Optimizing search engines using clickthrough data , 2002, KDD.

[28]  Gerhard Widmer,et al.  Prediction of Ordinal Classes Using Regression Trees , 2001, Fundam. Informaticae.

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

[30]  Wagner Meira,et al.  Learning to rank at query-time using association rules , 2008, SIGIR '08.

[31]  Glenn Fung,et al.  Learning Rankings via Convex Hull Separation , 2005, NIPS.

[32]  Wei-Pang Yang,et al.  Learning to Rank for Information Retrieval Using Genetic Programming , 2007 .

[33]  Cynthia Rudin,et al.  Margin-Based Ranking Meets Boosting in the Middle , 2005, COLT.

[34]  Hongyuan Zha,et al.  A General Boosting Method and its Application to Learning Ranking Functions for Web Search , 2007, NIPS.

[35]  Tie-Yan Liu,et al.  Directly optimizing evaluation measures in learning to rank , 2008, SIGIR.

[36]  Hongyuan Zha,et al.  A regression framework for learning ranking functions using relative relevance judgments , 2007, SIGIR.

[37]  T. Salakoski,et al.  Learning to Rank with Pairwise Regularized Least-Squares , 2007 .

[38]  Christopher J. C. Burges,et al.  High accuracy retrieval with multiple nested ranker , 2006, SIGIR.

[39]  T. Minka.  Selection bias in the LETOR datasets , 2008 .

[40]  Tao Qin,et al.  Feature selection for ranking , 2007, SIGIR.

[41]  Tao Qin,et al.  Global Ranking Using Continuous Conditional Random Fields , 2008, NIPS.

[42]  Leonardo Rigutini.  SortNet: Learning To Rank By a Neural-Based Sorting Algorithm , 2008 .

[43]  Hongyuan Zha,et al.  Global ranking by exploiting user clicks , 2009, SIGIR.

[44]  Tao Qin,et al.  Learning to rank relational objects and its application to web search , 2008, WWW.

[45]  Norbert Fuhr,et al.  Optimum polynomial retrieval functions based on the probability ranking principle , 1989, TOIS.

[46]  John Guiver,et al.  Bayesian inference for Plackett-Luce ranking models , 2009, ICML '09.

[47]  Matthew Lease.  An improved markov random field model for supporting verbose queries , 2009, SIGIR.

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

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

[50]  Filip Radlinski,et al.  Active exploration for learning rankings from clickthrough data , 2007, KDD '07.

[51]  S. Rajaram,et al.  Generalization Bounds for k-Partite Ranking , 2005 .

[52]  Yong Yu,et al.  Learning to rank with ties , 2008, SIGIR '08.

[53]  Hang Li,et al.  Ranking refinement and its application to information retrieval , 2008, WWW.

[54]  Ramesh Nallapati,et al.  Discriminative models for information retrieval , 2004, SIGIR '04.

[55]  Qiang Wu,et al.  McRank: Learning to Rank Using Multiple Classification and Gradient Boosting , 2007, NIPS.

[56]  Thorsten Joachims,et al.  Predicting diverse subsets using structural SVMs , 2008, ICML '08.

[57]  Tie-Yan Liu,et al.  Listwise approach to learning to rank: theory and algorithm , 2008, ICML '08.

[58]  Stephen E. Robertson,et al.  SoftRank: optimizing non-smooth rank metrics , 2008, WSDM '08.

[59]  Tie-Yan Liu,et al.  Generalization analysis of listwise learning-to-rank algorithms , 2009, ICML '09.

[60]  Hwanjo Yu,et al.  SVM selective sampling for ranking with application to data retrieval , 2005, KDD '05.

[61]  Tao Qin,et al.  Supervised rank aggregation , 2007, WWW '07.

[62]  Brendan J. Frey,et al.  Structured ranking learning using cumulative distribution networks , 2008, NIPS.