Learning to Rank Using Gradient Descent
published: Dec. 5, 2015, recorded: October 2015, views: 3950
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
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.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !