[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/1102351.1102363acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmlConference Proceedingsconference-collections
Article

Learning to rank using gradient descent

Published: 07 August 2005 Publication History

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.

References

[1]
Baum, E., & Wilczek, F. (1988). Supervised learning of probability distributions by neural networks. Neural Information Processing Systems (pp. 52--61).
[2]
Bradley, R., & Terry, M. (1952). The Rank Analysis of Incomplete Block Designs 1: The Method of Paired Comparisons. Biometrika, 39, 324--245.
[3]
Bromley, J., Bentz, J. W., Bottou, L., Guyon, I., LeCun, Y., Moore, C., Sackinger, E., & Shah, R. (1993). Signature Verification Using a "Siamese" Time Delay Neural Network. Advances in Pattern Recognition Systems using Neural Network Technologies, World Scientific (pp. 25--44)
[4]
Burges, C. (1996). Simplified support vector decision rules. Proc. International Conference on Machine Learning (ICML) 13 (pp. 71--77).
[5]
Caruana, R., Baluja, S., & Mitchell, T. (1996). Using the future to "sort out" the present: Rankprop and multitask learning for medical risk evaluation. Advances in Neural Information Processing Systems (NIPS) 8 (pp. 959--965).
[6]
Crammer, K., & Singer, Y. (2002). Pranking with ranking. NIPS 14.
[7]
Dekel, O., Manning, C., & Singer, Y. (2004). Loglinear models for label-ranking. NIPS 16.
[8]
Freund, Y., Iyer, R., Schapire, R., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933--969.
[9]
Harrington, E. (2003). Online ranking/collaborative filtering using the Perceptron algorithm. ICML 20.
[10]
Hastie, T., & Tibshirani, R. (1998). Classification by pairwise coupling. NIPS 10.
[11]
Herbrich, R., Graepel, T., & Obermayer, K. (2000). Large margin rank boundaries for ordinal regression. Advances in Large Margin Classifiers, MIT Press (pp. 115--132).
[12]
Jarvelin, K., & Kekalainen, J. (2000). IR evaluation methods for retrieving highly relevant documents. Proc. 23rd ACM SIGIR (pp. 41--48).
[13]
Kimeldorf, G. S., & Wahba, G. (1971). Some results on Tchebycheffian Spline Functions. J. Mathematical Analysis and Applications, 33, 82--95.
[14]
LeCun, Y., Bottou, L., Orr, G. B., & Müüller, K.-R. (1998). Efficient backprop. Neural Networks: Tricks of the Trade, Springer (pp. 9--50).
[15]
Mason, L., Baxter, J., Bartlett, P., & Frean, M. (2000). Boosting algorithms as gradient descent. NIPS 12 (pp. 512--518).
[16]
Mitchell, T. M. (1997). Machine learning. New York: McGraw-Hill.
[17]
Refregier, P., & Vallet, F. (1991). Probabilistic approaches for multiclass classification with neural networks. International Conference on Artificial Neural Networks (pp. 1003--1006).
[18]
Schölkopf, B., & Smola, A. (2002). Learning with kernels. MIT Press.

Cited By

View all
  • (2025)Research on Optimization of Cross-Modal Retrieval Based on Ranking LossModeling and Simulation10.12677/mos.2025.14101214:01(116-121)Online publication date: 2025
  • (2025)ROASMI: accelerating small molecule identification by repurposing retention dataJournal of Cheminformatics10.1186/s13321-025-00968-817:1Online publication date: 14-Feb-2025
  • (2025)Dynamic Interaction-Driven Intent Evolver with Semantic Probability DistributionsProceedings of the Eighteenth ACM International Conference on Web Search and Data Mining10.1145/3701551.3703508(290-299)Online publication date: 10-Mar-2025
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICML '05: Proceedings of the 22nd international conference on Machine learning
August 2005
1113 pages
ISBN:1595931805
DOI:10.1145/1102351
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 August 2005

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 140 of 548 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)382
  • Downloads (Last 6 weeks)54
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Research on Optimization of Cross-Modal Retrieval Based on Ranking LossModeling and Simulation10.12677/mos.2025.14101214:01(116-121)Online publication date: 2025
  • (2025)ROASMI: accelerating small molecule identification by repurposing retention dataJournal of Cheminformatics10.1186/s13321-025-00968-817:1Online publication date: 14-Feb-2025
  • (2025)Dynamic Interaction-Driven Intent Evolver with Semantic Probability DistributionsProceedings of the Eighteenth ACM International Conference on Web Search and Data Mining10.1145/3701551.3703508(290-299)Online publication date: 10-Mar-2025
  • (2025)A large language model framework for literature-based disease–gene association predictionBriefings in Bioinformatics10.1093/bib/bbaf07026:1Online publication date: 25-Feb-2025
  • (2025)Learning-based inference of longitudinal image changes: Applications in embryo development, wound healing, and aging brainProceedings of the National Academy of Sciences10.1073/pnas.2411492122122:8Online publication date: 20-Feb-2025
  • (2025)Prompt-guided image color aesthetics assessment: Models, datasets and benchmarksInformation Fusion10.1016/j.inffus.2024.102706114(102706)Online publication date: Feb-2025
  • (2025)Variational learning to rank for Test Case Prioritization via prioritizing metric inspired differentiable lossEngineering Applications of Artificial Intelligence10.1016/j.engappai.2024.109776141:COnline publication date: 1-Feb-2025
  • (2025)Pairwise learning to rank by neural networks revisited: reconstruction, theoretical analysis and practical performanceMachine Learning10.1007/s10994-024-06644-6114:4Online publication date: 4-Mar-2025
  • (2025)Optimal large-scale stochastic optimization of NDCG surrogates for deep learningMachine Learning10.1007/s10994-024-06631-x114:2Online publication date: 27-Jan-2025
  • (2025)Revisiting recommender systems: an investigative surveyNeural Computing and Applications10.1007/s00521-024-10828-537:4(2145-2173)Online publication date: 4-Jan-2025
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media