Loss bounds for online category ranking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3559 LNAI, Issue , 2005, Pages 48-62

  Crammer, Koby ^a   Singer, Yoram ^b,c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; LEARNING ALGORITHMS; LEARNING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

BREGMAN DIVERGENCE; CONSTRAINTS; ONLINE CATEGORY RANKING; OPTIMIZATION PROBLEM;

ONLINE SYSTEMS;

EID: 26944437032     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11503415_4     Document Type: Conference Paper

References (12)

1. K.S. Azoury and M.W. Warmuth. Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning, 43(3):211-246, 2001.
2. L. M. Bregman. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics, 7:200-217, 1967.
3. Y. Censor and S.A. Zenios. Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, New York, NY, USA, 1997.
4. M. Collins, R.E. Schapire, and Y Singer. Logistic regression, AdaBoost and Bregman distances. Machine Learning, 47(2/3):253-285, 2002.
5. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
6. K. Crammer. Online Learning for Complex Categorial Problems. PhD thesis, Hebrew University of Jerusalem, 2005. to appear.
7. K. Crammer, O. Dekel, S. Shalev-Shwartz, and Y. Singer. Online passive aggressive algorithms. In Advances in Neural Information Processing Systems 16, 2003.
8. K. Crammer and Y. Singer. A new family of online algorithms for category ranking. Jornal of Machine Learning Research, 3:1025-1058, 2003.
9. K. Crammer and Y. Singer. Ultraconservative online algorithms for multiclass problems. Jornal of Machine Learning Research, 3:951-991, 2003.
10. A. Elisseeff and J. Weston. A kernel method for multi-labeled classification. In Advances in Neural Information Processing Systems 14, 2001.
11. C. Gentile and M. Warmuth. Linear hinge loss and average margin. In Advances in Neural Information Processing Systems 10, 1998.
12. R. E. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3):1-40, 1999.