The LambdaLoss Framework for Ranking Metric Optimization
Authors:
Open Access
- 17 October 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1313-1322
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A cross-benchmark comparison of 87 learning to rank methodsInformation Processing & Management, 2015
- Semi-supervised learning to rank with preference regularization2011
- A general approximation framework for direct optimization of information retrieval measuresInformation Retrieval Journal, 2009
- Gradient descent optimization of smoothed information retrieval metricsInformation Retrieval Journal, 2009
- Learning to rank2007
- Linear feature-based models for information retrievalInformation Retrieval Journal, 2007
- Cumulated gain-based evaluation of IR techniquesACM Transactions on Information Systems, 2002
- Greedy function approximation: A gradient boosting machine.The Annals of Statistics, 2001
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- Optimum polynomial retrieval functions based on the probability ranking principleACM Transactions on Information Systems, 1989