Learning to rank using gradient descent
The DOI matches its Crossref record; 16 of the 17 references it cites were found in a registry or an index.
Abstract
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data from a commercial internet search engine. 1.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons
Bradley, R. A., & Terry, M. E. (1952) · Biometrika · doi:10.2307/2334029 · Cited by 2,412 · cited 2×
“In (Hastie & Tibshirani, 1998) and (Bradley & Terry, 1952), the authors consider models of the following form: for some fixed set of events A 1 , . . . , A k , pairwise probabilities P (A i |A i or A j ) are given, and it is assumed that there is a set of probabilitiesˆP i such that P (A i |A i or…”
BackgroundSIGNATURE VERIFICATION USING A “SIAMESE” TIME DELAY NEURAL NETWORK
BROMLEY, J., BENTZ, J. W., BOTTOU, L., GUYON, I., LECUN, Y., MOORE, C., SÄCKINGER, E., & SHAH, R. (1994) · Series in Machine Perception and Artificial Intelligence · doi:10.1142/9789812797926_0003 · Cited by 2,350
Signature Verification Using A "Siamese" Time Delay Neural Network
BROMLEY, J., BENTZ, J. W., BOTTOU, L., GUYON, I., LECUN, Y., MOORE, C., SÄCKINGER, E., & SHAH, R. (1993) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001493000339 · Cited by 2,077 · cited 1×
“One can also view this as a weight sharing update for a Siamese-like net(Bromley et al., 1993).”
BackgroundIR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130374 · Cited by 1,444
RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS: THE METHOD OF PAIRED COMPARISONS
BRADLEY, R. A., & TERRY, M. E. (1952) · Biometrika · doi:10.1093/biomet/39.3-4.324 · Cited by 1,434
Classification by pairwise coupling
Hastie, T., & Tibshirani, R. (1998) · The Annals of Statistics · doi:10.1214/aos/1028144844 · Cited by 1,299 · cited 2×
“In ( Hastie & Tibshirani, 1998 ) and (Bradley & Terry, 1952), the authors consider models of the following form: for some xed set of events A1; : : : ; Ak, pairwise probabilities P (AijAi or Aj) are given, and it is assumed that there is a set of probabilities ^”
BackgroundSome results on Tchebycheffian spline functions
Kimeldorf, G., & Wahba, G. (1971) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(71)90184-3 · Cited by 1,254 · cited 1×
“Note that the representer theorem (Kimeldorf & Wahba, 1971; Schölkopf & Smola, 2002) applies to this case also: any solution f * that minimizes (17) Learning to Rank using Gradient Descent can be written in the form f * (x) = m i=1 α i k(x, x i ) (18) since in the first term on the right of Eq.”
BackgroundLarge Margin Rank Boundaries for Ordinal Regression
Herbrich, R., Graepel, T., & Obermayer, K. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0010 · Cited by 1,074 · cited 5×
“Our approach follows (Herbrich et al., 2000) in that we train on pairs of examples to learn a ranking function Appearing in Proceedings of the 22 nd International Conference on Machine Learning, Bonn, Germany, 2005.”
BackgroundMethodInfluentialBoosting Algorithms as Gradient Descent
Mason, L., Baxter, J., Bartlett, P. L., & Frean, M. R. (1999) · Cited by 767
Crammer, K., & Singer, Y. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0087 · Cited by 538 · cited 3×
“(Crammer & Singer, 2002) cast the problem in similar form and propose a ranker based on the perceptron ('PRank'), which maps a feature vector x ∈ R d to the reals with a learned w ∈ R d such that the output of the mapping function is just w · x. PRank also learns the values of N increasing…”
BackgroundMethod
Cited by
BPR: Bayesian Personalized Ranking from Implicit Feedback
Rendle, S., Freudenthaler, C., Gantner, Z., & Schmidt-Thieme, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2618 · Cited by 4,242
“[1] optimize a neural network model for ranking using gradient descent.”
MethodDense passage retrieval for open-domain question answering
Karpukhin, V., Oguz, B., Min, S., Lewis, P., Wu, L., Edunov, S., Chen, D., & Yih, W.-T. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.550 · Cited by 3,575
The probabilistic relevance framework: BM25 and beyond
Robertson, S., & Zaragoza, H. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000019 · Cited by 3,374
Learning deep structured semantic models for web search using clickthrough data
Huang, P.-S., He, X., Gao, J., Deng, L., Acero, A., & Heck, L. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505665 · Cited by 2,009
“Categories and Subject Descriptors H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval; I.2.6 [Artificial Intelligence]: Learning General Terms Algorithms, Experimentation Keywords Deep Learning, Semantic Model, Clickthrough Data, Web Search”
BackgroundInfluentialLearning to rank: from pairwise approach to listwise approach
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273513 · Cited by 1,960
Metadata
- Authors
- Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G.
- Affiliations
- Microsoft (United States) (US)
- Venue
- Proceedings of the 22nd international conference on Machine learning - ICML '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 89-96
- OpenAlex
- W2143331230
- Cited by
- 2,836
- References
- 17
- Citations by year
- 2026: 120 · 2025: 120 · 2024: 144 · 2023: 154 · 2022: 158 · 2021: 220 · 2020: 209 · 2019: 235 · 2018: 182 · 2017: 142 · 2016: 129 · 2015: 128 · 2014: 127 · 2013: 104 · 2012: 103
- FWCI
- 47.90
- 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, gradient descent, RankNet, search engine ranking, pairwise ranking
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 using gradient descent. https://app.cochat.ai/papers/10.1145/1102351.1102363
- The paper
- Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005). Learning to rank using gradient descent. Proceedings of the 22nd international conference on Machine learning - ICML '05. https://doi.org/10.1145/1102351.1102363
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.