IR evaluation methods for retrieving highly relevant documents
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Modern Information Retrieval
Support Vector Machines and the Bayes Rule in Classification
Data Mining and Knowledge Discovery
An Efficient Boosting Algorithm for Combining Preferences
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Convex Optimization
Discriminative models for information retrieval
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Statistical Analysis of Some Multi-Category Large Margin Classification Methods
The Journal of Machine Learning Research
Learning to rank using gradient descent
ICML '05 Proceedings of the 22nd international conference on Machine learning
Learning to rank: from pairwise approach to listwise approach
Proceedings of the 24th international conference on Machine learning
A support vector method for optimizing average precision
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
AdaRank: a boosting algorithm for information retrieval
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Query-level loss functions for information retrieval
Information Processing and Management: an International Journal
Subset ranking using regression
COLT'06 Proceedings of the 19th annual conference on Learning Theory
A Bayesian approach to protein model quality assessment
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Generalization analysis of listwise learning-to-rank algorithms
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Learning to Rank for Information Retrieval
Foundations and Trends in Information Retrieval
OrdRank: Learning to Rank with Ordered Multiple Hyperplanes
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Learning to rank from Bayesian decision inference
Proceedings of the 18th ACM conference on Information and knowledge management
Ranking with query-dependent loss for web search
Proceedings of the third ACM international conference on Web search and data mining
IntervalRank: isotonic regression with listwise and pairwise constraints
Proceedings of the third ACM international conference on Web search and data mining
Gradient descent optimization of smoothed information retrieval metrics
Information Retrieval
Introduction to special issue on learning to rank for information retrieval
Information Retrieval
Active learning for ranking through expected loss optimization
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
LETOR: A benchmark collection for research on learning to rank for information retrieval
Information Retrieval
RankSVR: can preference data help regression?
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Semi-supervised ranking for document retrieval
Computer Speech and Language
ListBM: a learning-to-rank method for XML keyword search
INEX'09 Proceedings of the Focused retrieval and evaluation, and 8th international conference on Initiative for the evaluation of XML retrieval
Ranking from pairs and triplets: information quality, evaluation methods and query complexity
Proceedings of the fourth ACM international conference on Web search and data mining
Cross-market model adaptation with pairwise preference data for web search ranking
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Computational Linguistics
Learning to rank with document ranks and scores
Knowledge-Based Systems
Learning to rank for why-question answering
Information Retrieval
RankDE: learning a ranking function for information retrieval using differential evolution
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Learning to rank using query-level regression
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
ListOPT: learning to optimize for XML ranking
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Learning multiple metrics for ranking
Frontiers of Computer Science in China
Multi-task learning to rank for web search
Pattern Recognition Letters
Leveraging Auxiliary Data for Learning to Rank
ACM Transactions on Intelligent Systems and Technology (TIST)
Learning to rank documents using similarity information between objects
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Cost-Sensitive listwise ranking approach
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Effective heterogeneous similarity measure with nearest neighbors for cross-media retrieval
MMM'12 Proceedings of the 18th international conference on Advances in Multimedia Modeling
Construct weak ranking functions for learning linear ranking function
AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology
Learning to rank by optimizing expected reciprocal rank
AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology
Learning to extract coherent keyphrases from online news
AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology
Learning to rank under multiple annotators
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
WSABIE: scaling up to large vocabulary image annotation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
LePrEF: Learn to precompute evidence fusion for efficient query evaluation
Journal of the American Society for Information Science and Technology
A preference learning approach to sentence ordering for multi-document summarization
Information Sciences: an International Journal
Learning to rank duplicate bug reports
Proceedings of the 21st ACM international conference on Information and knowledge management
A new probabilistic model for top-k ranking problem
Proceedings of the 21st ACM international conference on Information and knowledge management
Effect on generalization of using relational information in list-wise algorithms
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
Mining large streams of user data for personalized recommendations
ACM SIGKDD Explorations Newsletter
Collaborative factorization for recommender systems
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Direct optimization of ranking measures for learning to rank models
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient gradient descent algorithm for sparse models with application in learning-to-rank
Knowledge-Based Systems
Is top-k sufficient for ranking?
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Learning to rank recommendations with the k-order statistic loss
Proceedings of the 7th ACM conference on Recommender systems
Democracy is good for ranking: towards multi-view rank learning and adaptation in web search
Proceedings of the 7th ACM international conference on Web search and data mining
Journal of Signal Processing Systems
| Hi-index | 0.00 |
This paper aims to conduct a study on the listwise approach to learning to rank. The listwise approach learns a ranking function by taking individual lists as instances and minimizing a loss function defined on the predicted list and the ground-truth list. Existing work on the approach mainly focused on the development of new algorithms; methods such as RankCosine and ListNet have been proposed and good performances by them have been observed. Unfortunately, the underlying theory was not sufficiently studied so far. To amend the problem, this paper proposes conducting theoretical analysis of learning to rank algorithms through investigations on the properties of the loss functions, including consistency, soundness, continuity, differentiability, convexity, and efficiency. A sufficient condition on consistency for ranking is given, which seems to be the first such result obtained in related research. The paper then conducts analysis on three loss functions: likelihood loss, cosine loss, and cross entropy loss. The latter two were used in RankCosine and ListNet. The use of the likelihood loss leads to the development of a new listwise method called ListMLE, whose loss function offers better properties, and also leads to better experimental results.