Efficient bandit algorithms for online multiclass prediction

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 440-447

  Kakade, Sham M ^a   Shalev Shwartz, Shai ^a   Tewari, Ambuj ^a  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINE LEARNING; LABELS; LEARNING SYSTEMS; NEURAL NETWORKS; ROBOT LEARNING;

FULL INFORMATIONS; LINEARLY SEPARABLE; MISTAKE BOUNDS; MULTI ARMED BANDIT; MULTI-CLASS CLASSIFICATION; MULTICLASS PREDICTION; PARTIAL FEEDBACK; WEB APPLICATION;

SUPERVISED LEARNING; LEARNING ALGORITHMS;

INFORMATION SETTINGS; LINEARLY SEPARABLE; MISTAKE BOUNDS; MULTI CLASS; MULTI-ARMED BANDITS; MULTI-CLASS CLASSIFICATIONS; MULTICLASS PREDICTIONS; PARTIAL FEEDBACKS; PERCEPTRON; WEB APPLICATIONS;

EID: 56449104477     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390212     Document Type: Conference Paper

References (18)

1. R.I. Arriaga and S. Vempala. An algorithmic theory of learning: Robust concepts and random projection. Mach. Learn., 63(2), 2006.
2. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. Gambling in a rigged casino: the adversarial multi-armed bandit problem. In Proceedings of the 36th Annual FOCS, 1998.
3. K. Crammer and Y. Singer. Ultraconservative online algorithms for multiclass problems. Journal of Machine Learning Research, 3:951-991, 2003.
4. K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer. Online passive aggressive algorithms. Journal of Machine Learning Research, 7:551-585, Mar 2006.
5. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. Wiley, 1973.
6. A. Elisseeff and J. Weston. A kernel method for multi-labeled classification. In Advances in Neural Information Processing Systems 14, 2001.
7. M. Fink, S. Shalev-Shwartz, Y. Singer, and S. Ullman. Online multiclass learning by interclass hypothesis sharing. In Proceedings of the 23rd International Conference on Machine Learning, 2006.
8. A. Flaxman, A. Kalai, and H. B. McMahan. Online convex optimization in the bandit setting: gradient descent without a gradient. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 385-394, 2005.
9. Y. Freund and R. E. Schapire. Large margin classification using the perceptron algorithm. Machine Learning, 37(3):277-296, 1999.
10. J. Kivinen and M. Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132(1):1-64, January 1997.
11. R.D. Kleinberg. Nearly tight bounds for the continuum-armed bandit problem. NIPS, 2004.
12. J. Langford and T. Zhang. The epoch-greedy algorithm for contextual multi-armed bandits. NIPS, 2007.
13. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
14. F. Rosenblatt. The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65:386-407, 1958.
15. (Reprinted in Neurocomputing (MIT Press, 1988).).
16. S. Shalev-Shwartz and Y. Singer. A primal-dual perspective of online learning algorithms. Machine Learning Journal, 2007.
17. V. N. Vapnik. Statistical Learning Theory. Wiley, 1998.
18. J. Weston and C. Watkins. Support vector machines for multi-class pattern recognition. In Proceedings of the Seventh European Symposium on Artificial Neural Networks, April 1999.