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. 
DOI: 10.1145/1102351.1102363


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

1,936 Citations

Semantic Scholar estimates that this publication has 1,936 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics