Generalization bounds for ranking algorithms via algorithmic stability

Journal of Machine Learning Research

Volumn 10, Issue , 2009, Pages 441-474

  Agarwal, Shivani ^a   Niyogi, Partha ^b  

^a USA   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

Algorithmic stability; Generalization bounds; Ranking

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; LEARNING SYSTEMS;

ALGORITHMIC STABILITY; GENERALIZATION BOUNDS; GENERALIZATION PROPERTIES; GOOD STABILITIES; MACHINE-LEARNING; RANKING; RANKING ALGORITHMS; RANKING FUNCTIONS; RANKING PROBLEMS; REPRODUCING KERNEL HILBERT SPACES; STABILITY PROPERTIES; UNIFORM CONVERGENCES;

STABILITY;

EID: 61749092782     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (38)

1. Shivani Agarwal. Ranking on graph data. In Proceedings of the 23rd International Conference on Machine Learning, 2006.
2. Shivani Agarwal and Partha Niyogi. Stability and generalization of bipartite ranking algorithms. In Proceedings of the 18th Annual Conference on Learning Theory, 2005.
3. Shivani Agarwal, Thore Graepel, Ralf Herbrich, Sariel Har-Peled, and Dan Roth. Generalization bounds for the area under the ROC curve. Journal of Machine Learning Research, 6:393-425, 2005.
4. Nir Ailon and Mehryar Mohri. An efficient reduction of ranking to classification. In Proceedings of the 21st Annual Conference on Learning Theory, 2008.
5. Kenneth J. Arrow. Social Choice and Individual Values. Yale University Press, Second edition, 1970.
6. Maria-Fiorina Balean, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, and Gregory B. Sorkin. Robust reductions from ranking to classification. In Proceedings of the 20th Annual Conference on Learning Theory, 2007.
7. Olivier Bousquet. New approaches to statistical learning theory. Annals of the Institute of Statistical Mathematics, 55(2):371-389, 2003.
8. Olivier Bousquet and André Elisseeff. Stability and generalization. Journal of Machine Learning Research, 2:499-526, 2002.
9. Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender. Learning to rank using gradient descent. In Proceedings of the 22nd International Conference on Machine Learning, 2005.
10. Alpha C. Chiang and Kevin Wainwright. Fundamental Methods of Mathematical Economics. McGraw-Hill Irwin, Fourth edition, 2005.
11. Stephan Clemencon and Nicolas Vayatis. Ranking the best instances. Journal of Machine Learning Research, 8:2671-2699, 2007.
12. Stephan Clemencon, Gabor Lugosi, and Nicolas Vayatis. Ranking and empirical minimization of U-statistics. Annals of Statistics, 36:844-874, 2008.
13. William W. Cohen, Robert E. Schapire, and Yoram Singer. Learning to order things. Journal of Artificial Intelligence Research, 10:243-270, 1999.
14. Corinna Cortes, Mehryar Mohri, and Ashish Rastogi. Magnitude-preserving ranking algorithms. In Proceedings of 24th International Conference on Machine Learning, 2007.
15. David Cossock and Tong Zhang. Subset ranking using regression. In Proceedings of the 19th Annual Conference on Learning Theory, 2006.
16. Koby Crammer and Yoram Singer. Pranking with ranking. In Advances in Neural Information Processing Systems 14, pages 641-647. MIT Press, 2002.
17. Felipe Cucker and Steve Smale. On the mathematical foundations of learning. Bulletin of the American Mathematical Society, 39:1-49, 2002.
18. Dominique de Caen. An upper bound on the sum of squares of degrees in a graph. Discrete Mathematics, 185:245-248, 1998.
19. Luc Devroye and Terry J. Wagner. Distribution-free performance bounds for potential function rules. IEEE Transactions on Information Theory, 25(5):601-604, 1979.
20. Theodoras Evgeniou, Massimiliano Pontil, and Tomaso Poggio. Regularization networks and support vector machines. Advances in Computational Mathematics, 13(1): 1-50, 2000.
21. Yoav Freund, Raj Iyer, Robert E. Schapire, and Yoram Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933-969, 2003.
22. David Haussler. Convolution kernels on discrete structures. Technical Report UCSC-CRL-99-10, University of California at Santa Cruz, 1999.
23. Ralf Herbrich, Thore Graepel, Peter Bollmann-Sdorra, and Klaus Obermayer. Learning preference relations for information retrieval. In Proceedings of the ICML-1998 Workshop on Text Categorization and Machine Learning, 1998.
24. Ralf Herbrich, Thore Graepel, and Klaus Obermayer. Large margin rank boundaries for ordinal regression. Advances in Large Margin Classifiers, pages 115-132, 2000.
25. Thorsten Joachims. Optimizing search engines using clickthrough data. In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining, 2002.
26. Michael Kearns and Dana Ron. Algorithmic stability and sanity-check bounds for leave-one-out cross-validation. Neural Computation, 11:1427-1453, 1999.
27. Vladimir Koltchinskii and Dmitry Panchenko. Empirical margin distributions and bounding the generalization error of combined classifiers. The Annals of Statistics, 30(1):1-50, 2002.
28. Samuel Kutin and Partha Niyogi. The interaction of stability and weakness in AdaBoost. Technical Report TR-2001-30, Computer Science Department, University of Chicago, 2001.
29. Samuel Kutin and Partha Niyogi. Almost-everywhere algorithmic stability and generalization error. In Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence, 2002.
30. Erich L. Lehmann. Nonparametrics: Statistical Methods Based on Ranks. Holden-Day, 1975.
31. Colin McDiarmid. On the method of bounded differences. In Surveys in Combinatorics 1989, pages 148-188. Cambridge University Press, 1989.
32. Tomaso Poggio, Ryan Rifkin, Sayan Mukherjee, and Partha Niyogi. General conditions for predictivity in learning theory. Nature, 428:419-422, 2004.
33. Filip Radlinski and Thorsten Joachims. Query chains: Learning to rank from implicit feedback. In Proceedings of the ACM Conference on Knowledge Discovery and Data Mining, 2005.
34. Alain Rakotomamonjy. Optimizing area under ROC curves with SVMs. In Proceedings of the ECAI-2004 Workshop on ROC Analysis in AI, 2004.
35. William H. Rogers and Terry J. Wagner. A finite sample distribution-free performance bound for local discrimination rules. Annals of Statistics, 6(3):506-514, 1978.
36. Cynthia Rudin. Ranking with a p-norm push. In Proceedings of the 19th Annual Conference on Learning Theory, 2006.
37. Cynthia Rudin, Corinna Cortes, Mehryar Mohri, and Robert E. Schapire. Margin-based ranking meets boosting in the middle. In Proceedings of the 18th Annual Conference on Learning Theory, 2005.
38. Vladimir N. Vapnik and Alexey Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16:264-280, 1971.