Query-level stability and generalization in learning to rank

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 512-519

  Lan, Yanyan ^a   Liu, Tie Yan ^b   Qin, Tao ^c   Ma, Zhiming ^a   Li, Hang ^b  

^a CHINESE ACADEMY OF SCIENCES   (China)

^b MICROSOFT RESEARCH ASIA   (China)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINE LEARNING; ALGORITHMS; EDUCATION; ELECTRIC NETWORK ANALYSIS; INFORMATION SERVICES; LEARNING SYSTEMS; PROGRAMMING THEORY; ROBOT LEARNING;

GENERALIZATION ABILITY; GENERALIZATION BOUND; LEARNING PROBLEM; LEARNING TO RANK; RANKING SVM;

LEARNING ALGORITHMS;

GENERALIZATION ABILITIES; GENERALIZATION BOUNDS; LEARNING PROBLEMS; LEARNING TO RANKS; NEW CONCEPTS; RANKING SVM;

EID: 56449103193     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390221     Document Type: Conference Paper

References (14)

1. Agarwal, S., & Niyogi, P. (2005). Stability and generalization of bipartite ranking algorithms. Proc. of COLT'05 (pp. 32-47).
2. Baeza-Yates, R., & Ribeiro-Neto, B. (1999). Modern information retrieval. Addison Wesley.
3. Bousquet, O., & Elissee , A. (2002). Stability and generalization. Journal of Machine Learning Research, 2, 499-526.
4. Bulges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005). Learning to rank using gradient descent. ICML '05 (pp. 89-96).
5. Cao, Y., Xu, J., Liu, T.-Y., Li, H., Huang, Y., & Hon, H.-W. (2006). Adapting ranking svm to document retrieval. SIGIR '06 (pp. 186-193).
6. Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007). Learning to rank: from pairwise approach to listwise approach. ICML '07 (pp. 129-136).
7. Devroye, L., & Wagner, T. (1979). Distribution-free performance bounds for potential function rules. IEEE Transactions on Information Theory, 25, 601-604.
8. Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (2003). An e cient boosting algorithm for combining preferences. J. Mach. Learn. Res., 4, 933-969.
9. Herbrich, R., Obermayer, K., & Graepel, T. (1999). Large margin rank boundaries for ordinal regression. Advances in Large Margin Classi ers. (pp. 115-132).
10. Järvelin, K., & Kekäläinen, J. (2002). Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst., 20, 422-446.
11. Joachims, T. (2002). Optimizing search engines using click-through data. KDD '02 (pp. 133-142).
12. Li, P., Burges, C., & Wu, Q. (2007). Mcrank: Learning to rank using multiple classi cation and gradient boosting. NIPS2007.
13. McDiarmid, C. (1989). On the method of bounded difierences. Cambridge University Press.
14. Qin, T., Zhang, X.-D., Tsai, M.-F., Wang, D.-S., Liu, T.-Y., & Li, H. (2007). Query-level loss functions for information retrieval. Information Processing & Management.