Online learning meets optimization in the dual

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

Volumn 4005 LNAI, Issue , 2006, Pages 423-437

  Shalev Shwartz, Shai ^a   Singer, Yoram ^a,b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ONLINE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

CONSTRAINED OPTIMIZATION; OBJECTIVE FUNCTIONS; ONLINE LEARNING ALGORITHMS;

LEARNING ALGORITHMS;

EID: 33746087078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_32     Document Type: Conference Paper

References (16)

1. K. Azoury and M. Warmuth. Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning, 43(3):211-246, 2001.
2. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
3. N. Cesa-Bianchi, A. Conconi, and C.Gentile. On the generalization ability of on-line learning algorithms. In Advances in Neural Information Processing Systems 14, pages 359-366, 2002.
4. K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer. Online passive aggressive algorithms. Technical report, The Hebrew University, 2005.
5. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines. Cambridge University Press, 2000.
6. O. Dekel, S. Shalev-Shwartz, and Y. Singer. The Forgetron: A kernel-based perceptron on a fixed budget. In Advances in Neural Information Processing Systems 18, 2005.
7. C. Gentile. The robustness of the p-norm algorithms. Machine Learning, 53(3), 2002.
8. A. J. Grove, N. Littlestone, and D. Schuurmans. General convergence results for linear discriminant updates. Machine Learning, 43(3):173-210, 2001.
9. J. Kivinen, A. J. Smola, and R. C. Williamson. Online learning with kernels. IEEE Transactions on Signal Processing, 52(8):2165-2176, 2002.
10. J. Kivinen and M. Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132(1):1-64, January 1997.
11. J. Kivinen and M. Warmuth. Relative loss bounds for multidimensional regression problems. Journal of Machine Learning, 45(3):301-329, July 2001.
12. Y. Li and P. M. Long. The relaxed online maximum margin algorithm. Machine Learning, 46(1-3):361-387, 2002.
13. N. Littiestone. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
14. N. Littlestone. Mistake bounds and logarithmic linear-threshold learning algorithms. PhD thesis, U. C. Santa Cruz, March 1989.
15. F. Rosenblatt. The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65:386-407, 1958.
16. (Reprinted in Neurocomputing (MIT Press, 1988).).