Accuracy at the top

Advances in Neural Information Processing Systems

Volumn 2, Issue , 2012, Pages 953-961

  Boyd, Stephen ^a   Cortes, Corinna ^b   Mohri, Mehryar ^c   Radovanovic, Ana ^b  

^a STANFORD UNIVERSITY   (United States)

^b GOOGLE INC   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BETTER PERFORMANCE; CLASSIFICATION ACCURACY; CONVEX OPTIMIZATION PROBLEMS; SCORING FUNCTIONS;

CONVEX OPTIMIZATION; SEARCH ENGINES;

ALGORITHMS;

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

References (22)

1. S. Agarwal. The infinite push: A new support vector ranking algorithm that directly optimizes accuracy at the absolute top of the list. In Proceedings of the SIAM International Conference on Data Mining, 2011.
2. R. R. Bahadur. A note on quantiles in large samples. Annals of Mathematical Statistics, 37, 1966.
3. P. L. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3:2002, 2002.
4. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1):1-122, 2011.
5. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
6. J. S. Breese, D. Heckerman, and C. M. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, 1998.
7. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In Proceedings of the 22nd international conference on Machine learning, ICML '05, pages 89-96, New York, NY, USA, 2005. ACM.
8. C. J. C. Burges, R. Ragno, and Q. V. Le. Learning to rank with nonsmooth cost functions. In NIPS, pages 193-200, 2006.
9. S. Clémençon and N. Vayatis. Ranking the best instances. Journal of Machine Learning Research, 8:2671-2699, 2007.
10. D. Cossock and T. Zhang. Statistical analysis of Bayes optimal subset ranking. IEEE Transactions on Information Theory, 54(11):5140-5154, 2008.
11. K. Crammer and Y. Singer. PRanking with ranking. In Neural Information Processing Systems (NIPS 2001). MIT Press, 2001.
12. Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. J. Mach. Learn. Res., 4, December 2003.
13. R. Herbrich, K. Obermayer, and T. Graepel. Advances in Large Margin Classifiers, chapter Large Margin Rank Boundaries for Ordinal Regression. MIT Press, 2000.
14. T. Joachims. Optimizing search engines using clickthrough data. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '02, pages 133-142, New York, NY, USA, 2002. ACM.
15. T. Joachims. A support vector method for multivariate performance measures. In ICML, pages 377-384, 2005.
16. J. Kiefer. On Bahadur's representation of sample quantiles. Annals of Mathematical Statistics, 38, 1967.
17. R. Koenker. Quantile Regression. Cambridge University Press, 2005.
18. V. Koltchinskii and D. Panchenko. Empirical margin distributions and bounding the generalization error of combined classifiers. Annals of Statistics, 30, 2002.
19. Q. V. Le, A. Smola, O. Chapelle, and C. H. Teo. Optimization of ranking measures. Unpublished, 2009.
20. M. Mohri, A. Rostamizadeh, and A. Talwalkar. Foundations of Machine Learning. The MIT Press, 2012.
21. C. Rudin, C. Cortes, M. Mohri, and R. E. Schapire. Margin-based ranking meets boosting in the middle. In COLT, pages 63-78, 2005.
22. I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6:1453-1484, 2005.