Learning to rank using gradient descent

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.

• Type: Conference
• Year: 2005
• Where: ICML
• Authors: Christopher J. C. Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, Gregory N. Hullender
• Keywords: Gradient Descent Methods, ICML 2005, Machine Learning, Probabilistic Cost Function, Ranking Function