Generalization analysis of listwise learning-to-rank algorithms

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 577-584

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

^a CHINESE ACADEMY OF SCIENCES   (China)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GENERALIZATION BOUND; INNER FUNCTIONS; LOSS FUNCTIONS; RANKING ALGORITHM; RANKING MODEL; RANKING PERFORMANCE; THEORETICAL FRAMEWORK; THEORETICAL STUDY; TRANSFORMATION FUNCTIONS;

EDUCATION; ROBOT LEARNING;

LEARNING ALGORITHMS;

EID: 71149120364     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Agarwal, S., & Niyogi, P. (2005). Stability and generalization of bipartite ranking algorithms. Proceedings of 18th Annual Conference on Learning Theory (pp. 32-47).
2. Bartlett, P. L., & Mendelson, S. (2003). Rademacher and gaussian complexities risk bounds and structural results. Journal of Machine Learning Research, 3, 463-482.
3. Bousquet, O., Boucheron, S., & Lugosi, G. (2004). Introduction to statistical learning theory. Advanced Lectures on Machine Learning, 169-207.
4. Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007). Learning to rank: from pairwise approach to listwise approach. Proceedings of 24th International Conference on Machine Learning (pp. 129-136).
5. Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4, 933-969.
6. Herbrich, R., Obermayer, K., & Graepel, T. (1999). Large margin rank boundaries for ordinal regression. Advances in Large Margin Classifiers., 115-132.
7. Lan, Y., Liu, T.-Y., Qin, T., Ma, Z., & Li, H. (2008). Query-level stability and generalization in learning to rank. Proceedings of 25th International Conference on Machine Learning (pp. 512-519).
8. Li, P., Burges, C., & Wu, Q. (2007). Mcrank: Learning to rank using multiple classification and gradient boosting. Proceedings of 21st Annual Conference on Neural Information Processing Systems (pp. 845-852).
9. Liu, T.-Y., & Lan, Y. (2008). Generalization analysis of listwise learning-to-rank algorithms using rademacher average (Technical Report MSR-TR-2008-155). Microsoft Research.
10. Mendelson, S. (2001). Rademacher averages and phase transitions in glivenko-cantelli classes. IEEE Transactions on Information Theory, 48(1), 251-263.
11. Mendelson, S. (2003). A few notes on statistical learning theory. Advanced Lectures in Machine Learning, 1-40.
12. 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, 44(2), 838-855.
13. Xia, F., Liu, T.-Y., Wang, J., Zhang, W., & Li, H. (2008). Listwise approach to learning to rank - theory and algorithm. Proceedings of 25th International Conference on Machine Learning (pp. 1192-1199).