Corpus ID: 17680734

Position-Aware ListMLE: A Sequential Learning Process for Ranking

@inproceedings{Lan2014PositionAwareLA,
  title={Position-Aware ListMLE: A Sequential Learning Process for Ranking},
  author={Yanyan Lan and Yadong Zhu and J. Guo and S. Niu and Xueqi Cheng},
  booktitle={UAI},
  year={2014}
}
ListMLE is a state-of-the-art listwise learning-to-rank algorithm, which has been shown to work very well in application. [...] Key Method It views the ranking problem as a sequential learning process, with each step learning a subset of parameters which maximize the corresponding stepwise probability distribution.Expand
14 Citations
Cost-Sensitive ListMLE Ranking Approach Based on Sparse Representation
Listwise Learning to Rank by Exploring Unique Ratings
WassRank: Listwise Document Ranking Using Optimal Transport Theory
Constructing long-short stock portfolio with a new listwise learn-to-rank algorithm
Optimize What You Evaluate With: A Simple Yet Effective Framework For Direct Optimization Of IR Metrics
A New Distributional Ranking Loss With Uncertainty: Illustrated in Relative Depth Estimation
Siralama Sorunu Olarak Nispi Derinlik Tahmini Relative Depth Estimation as a Ranking Problem
Relative Depth Estimation as a Ranking Problem
T-REC: Towards Accurate Bug Triage for Technical Groups
...
1
2
...

References

SHOWING 1-10 OF 25 REFERENCES
Generalization analysis of listwise learning-to-rank algorithms
Statistical Consistency of Top-k Ranking
Listwise approach to learning to rank: theory and algorithm
Learning to rank: from pairwise approach to listwise approach
Is top-k sufficient for ranking?
AdaRank: a boosting algorithm for information retrieval
Top-k learning to rank: labeling, ranking and evaluation
On NDCG Consistency of Listwise Ranking Methods
Statistical Consistency of Ranking Methods in A Rank-Differentiable Probability Space
An Efficient Boosting Algorithm for Combining Preferences
...
1
2
3
...