Chris Burges
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.
- Baum, E., & Wilczek, F. (1988). Supervised learning of probability distributions by neural networks. Neural Information Processing Systems (pp. 52--61).Google Scholar
- Bradley, R., & Terry, M. (1952). The Rank Analysis of Incomplete Block Designs 1: The Method of Paired Comparisons. Biometrika, 39, 324--245.Google ScholarCross Ref
- 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)Google Scholar
- Burges, C. (1996). Simplified support vector decision rules. Proc. International Conference on Machine Learning (ICML) 13 (pp. 71--77).Google Scholar
- 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).Google Scholar
- Crammer, K., & Singer, Y. (2002). Pranking with ranking. NIPS 14.Google Scholar
- Dekel, O., Manning, C., & Singer, Y. (2004). Loglinear models for label-ranking. NIPS 16.Google Scholar
- Freund, Y., Iyer, R., Schapire, R., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933--969. Google ScholarDigital Library
- Harrington, E. (2003). Online ranking/collaborative filtering using the Perceptron algorithm. ICML 20.Google Scholar
- Hastie, T., & Tibshirani, R. (1998). Classification by pairwise coupling. NIPS 10.Google Scholar
- Herbrich, R., Graepel, T., & Obermayer, K. (2000). Large margin rank boundaries for ordinal regression. Advances in Large Margin Classifiers, MIT Press (pp. 115--132).Google Scholar
- Jarvelin, K., & Kekalainen, J. (2000). IR evaluation methods for retrieving highly relevant documents. Proc. 23rd ACM SIGIR (pp. 41--48). Google ScholarDigital Library
- Kimeldorf, G. S., & Wahba, G. (1971). Some results on Tchebycheffian Spline Functions. J. Mathematical Analysis and Applications, 33, 82--95.Google ScholarCross Ref
- LeCun, Y., Bottou, L., Orr, G. B., & Müüller, K.-R. (1998). Efficient backprop. Neural Networks: Tricks of the Trade, Springer (pp. 9--50). Google ScholarDigital Library
- Mason, L., Baxter, J., Bartlett, P., & Frean, M. (2000). Boosting algorithms as gradient descent. NIPS 12 (pp. 512--518).Google Scholar
- Mitchell, T. M. (1997). Machine learning. New York: McGraw-Hill. Google ScholarDigital Library
- Refregier, P., & Vallet, F. (1991). Probabilistic approaches for multiclass classification with neural networks. International Conference on Artificial Neural Networks (pp. 1003--1006).Google Scholar
- Schölkopf, B., & Smola, A. (2002). Learning with kernels. MIT Press.Google Scholar
Recommendations
Multileave Gradient Descent for Fast Online Learning to Rank
WSDM '16: Proceedings of the Ninth ACM International Conference on Web Search and Data MiningModern search systems are based on dozens or even hundreds of ranking features. The dueling bandit gradient descent (DBGD) algorithm has been shown to effectively learn combinations of these features solely from user interactions. DBGD explores the ...
Learning to re-rank: query-dependent image re-ranking using click data
WWW '11: Proceedings of the 20th international conference on World wide webOur objective is to improve the performance of keyword based image search engines by re-ranking their original results. To this end, we address three limitations of existing search engines in this paper. First, there is no straight-forward, fully ...
Learning to rank: new approach with the layered multi-population genetic programming on click-through features
Users' click-through data is a valuable source of information about the performance of Web search engines, but it is included in few datasets for learning to rank. In this paper, inspired by the click-through data model, a novel approach is proposed for ...
Comments