Ranking via robust binary classification

Advances in Neural Information Processing Systems

Volumn 3, Issue January, 2014, Pages 2582-2590

  Yun, Hyokun ^a   Raman, Parameswaran ^b   Vishwanathan, S V N ^b  

^a AMAZON   (United States)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL EFFICIENCY; INFORMATION SCIENCE;

BENCHMARK DATASETS; BINARY CLASSIFICATION; COMPETITIVE PERFORMANCE; EVALUATION METRICS; LARGE-SCALE PROBLEM; PAIRWISE INTERACTION; RANKING ALGORITHM; ROBUST CLASSIFICATION;

ALGORITHMS;

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

References (24)

1. S. Agarwal. The infinite push: A new support vector ranking algorithm that directly optimizes accuracy at the absolute top of the list. In SDM, pages 839-850. SIAM, 2011.
2. P. L. Bartlett, M. I. Jordan, and J. D. McAuliffe. Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101(473):138-156, 2006.
3. T. Bertin-Mahieux, D. P. Ellis, B. Whitman, and P. Lamere. The million song dataset. In Proceedings of the 12th International Conference on Music Information Retrieval (ISMIR 2011), 2011.
4. L. Bottou and O. Bousquet. The tradeoffs of large-scale learning. Optimization for Machine Learning, page 351, 2011.
5. G. Bouchard. Efficient bounds for the softmax function, applications to inference in hybrid models. 2007.
6. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, Cambridge, England, 2004.
7. D. Buffoni, P. Gallinari, N. Usunier, and C. Calauzènes. Learning scoring functions with order-preserving losses and standardized supervision. In Proceedings of the 28th International Conference on Machine Learning (ICML-11), pages 825-832, 2011.
8. O. Chapelle and Y. Chang. Yahoo! learning to rank challenge overview. Journal of Machine Learning Research-Proceedings Track, 14:1-24, 2011.
9. O. Chapelle, C. B. Do, C. H. Teo, Q. V. Le, and A. J. Smola. Tighter bounds for structured estimation. In Advances in neural information processing systems, pages 281-288, 2008.
10. N. Ding. Statistical Machine Learning in T-Exponential Family of Distributions. PhD thesis, PhD thesis, Purdue University, West Lafayette, Indiana, USA, 2013.
11. V. Feldman, V. Guruswami, P. Raghavendra, and Y. Wu. Agnostic learning of monomials by halfspaces is hard. SIAM Journal on Computing, 41(6):1558-1590, 2012.
12. R. Gemulla, E. Nijkamp, P. J. Haas, and Y. Sismanis. Large-scale matrix factorization with distributed stochastic gradient descent. In Conference on Knowledge Discovery and Data Mining, pages 69-77, 2011.
13. P. J. Huber. Robust Statistics. John Wiley and Sons, New York, 1981.
14. Q. V. Le and A. J. Smola. Direct optimization of ranking measures. Technical Report 0704.3359, arXiv, April 2007. http://arxiv.org/abs/0704.3359.
15. C.-P. Lee and C.-J. Lin. Large-scale linear ranksvm. Neural Computation, 2013. To Appear.
16. P. Long and R. Servedio. Random classification noise defeats all convex potential boosters. Machine Learning Journal, 78(3):287-304, 2010.
17. C. D. Manning, P. Raghavan, and H. Schütze. Introduction to Information Retrieval. Cambridge University Press, 2008. URL http://nlp.stanford.edu/IR-book/.
18. A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro. Robust stochastic approximation approach to stochastic programming. SIAM Journal on Optimization, 19(4):1574-1609, 2009.
19. J. Nocedal and S. J. Wright. Numerical Optimization. Springer Series in Operations Research. Springer, 2nd edition, 2006.
20. T. Qin, T.-Y. Liu, J. Xu, and H. Li. Letor: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval, 13(4):346-374, 2010.
21. H. E. Robbins and S. Monro. A stochastic approximation method. Annals of Mathematical Statistics, 22:400-407, 1951.
22. C. Rudin. The p-norm push: A simple convex ranking algorithm that concentrates at the top of the list. The Journal of Machine Learning Research, 10:2233-2271, 2009.
23. N. Usunier, D. Buffoni, and P. Gallinari. Ranking with ordered weighted pairwise classification. In Proceedings of the International Conference on Machine Learning, 2009.
24. J. Weston, C. Wang, R. Weiss, and A. Berenzweig. Latent collaborative retrieval. arXiv preprint arXiv:1206.4603, 2012.