Learning to rank using gradient descent

ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning

Volumn , Issue , 2005, Pages 89-96

  Burges, Chris ^a   Shaked, Tal ^a,c   Renshaw, Erin ^a   Lazier, Ari ^b   Deeds, Matt ^b   Hamilton, Nicole ^b   Hullender, Greg ^b  

^a MICROSOFT RESEARCH   (United States)

^b MICROSOFT   (United States)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; GRADIENT DESCENT METHODS; RANKING FUNCTIONS; RANKNET;

COSTS; GRADIENT METHODS; MATHEMATICAL MODELS; NEURAL NETWORKS; PROBABILISTIC LOGICS;

LEARNING SYSTEMS;

EID: 31844446958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102351.1102363     Document Type: Conference Paper

References (18)

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). Log-linear 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.