Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 90 of the 90 references it cites were found in a registry or an index.

Learning to rank: from pairwise approach to listwise approach

Cao, Zhe, Qin, Tao, Liu, Tie-Yan, Tsai, Ming-Feng, Li, Hang · 2007 · Proceedings of the 24th international conference on Machine learning

Abstract

The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative filtering, and many other applications. Several methods for learning to rank have been proposed, which take object pairs as 'instances' in learning. We refer to them as the pairwise approach in this paper. Although the pairwise approach offers advantages, it ignores the fact that ranking is a prediction task on list of objects. The paper postulates that learning to rank should adopt the listwise approach in which lists of objects are used as 'instances' in learning. The paper proposes a new probabilistic method for the approach. Specifically it introduces two probability models, respectively referred to as permutation probability and top k probability, to define a listwise loss function for learning. Neural Network and Gradient Descent are then employed as model and algorithm in the learning method. Experimental results on information retrieval show that the proposed listwise approach performs better than the pairwise approach.

Overview

Integrity signals

Registry

Crossref · 10.1145/1273496.1273513

Cites

90 of 90 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 90 references

Research works printed but not linked: 5

  1. Crammer K., 2001, Proceedings of NIPS
  2. Freund Y., 1998, Proceedings of ICML 1998 (pp. 170--178)
  3. 10.5555/188490.188557 · doi:10.5555/188490.188557
  4. Lebanon G., 2002, Proceedings of ICML 2002 (pp. 363--370)
  5. Shashua A., 2002, Proceedings of NIPS

Cited by

See all 1,960

Metadata

Authors
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H.
Affiliations
  • Tsinghua University (CN)
  • Microsoft Research Asia (China) (CN)
  • National Taiwan University (TW)
Venue
Proceedings of the 24th international conference on Machine learning
Publisher
ACM
Published
2007-06-20
Pages
129-136
OpenAlex
W2108862644
Cited by
1,960
References
90
Citations by year
2026: 79 · 2025: 98 · 2024: 115 · 2023: 110 · 2022: 104 · 2021: 151 · 2020: 143 · 2019: 134 · 2018: 141 · 2017: 140 · 2016: 105 · 2015: 115 · 2014: 108 · 2013: 84 · 2012: 62
FWCI
40.69
Type
conference paper
Language
en
Open access
closed
Locations
International Conference on Machine Learning (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
Keywords
learning to rank, pairwise learning, information retrieval, gradient descent

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Learning to rank: from pairwise approach to listwise approach. https://app.cochat.ai/papers/10.1145/1273496.1273513
The paper
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007). Learning to rank: from pairwise approach to listwise approach. Proceedings of the 24th international conference on Machine learning. https://doi.org/10.1145/1273496.1273513

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.