Online learning by ellipsoid method

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 1153-1160

  Yang, Liu ^a   Jin, Rong ^b   Ye, Jieping ^c  

^a Carnegie Mellon University ^*  (United States)

^b Michigan State University   (United States)

^c Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; EFFICIENT ALGORITHM; ELLIPSOID METHOD; MISTAKE BOUNDS; ONLINE LEARNING; ONLINE LEARNING ALGORITHMS; POSITIVE-DEFINITE MATRICES; TRAINING EXAMPLE; TWO-STATE;

CONVEX OPTIMIZATION; E-LEARNING; EDUCATION; INTERNET; ROBOT LEARNING;

LEARNING ALGORITHMS;

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

References (17)

1. Amit, Y., Shalev-Shwartz, S., & Singer, Y. (2007). Online classification for complex problems using simultaneous projections. In Advances in Neural Information Processing Systems (pp. 17-24).
2. Crammer, K. (2004). Online learning of complex catego-rial problems. Doctoral dissertation, Hebrew Univeristy of Jerusalem.
3. Crammer, K., Dekel, O., Keshet, J., Shalev-Shwartz, S., & Singer, Y. (2006). Online passive-aggressive algorithms. J. Mach. Learn. Res., 7, 551-585.
4. Crammer, K., & Singer, Y (2002). On the algorithmic implementation of multiclass kernel-based vector machines. J. Mach. Learn. Res., 2, 265-292.
5. Crammer, K., & Singer, Y. (2003). Ultraconservative online algorithms for multiclass problems. J. Mach. Learn. Res., 3, 951-991.
6. Fink, M., Shalev-Shwartz, S., Singer, Y., & Ullman, S. (2006). Online multiclass learning by interclass hypothesis sharing. Proc. Int. Conf. on Mach. Learn. (pp. 313-320).
7. Gentile, C. (2002). A new approximate maximal margin classification algorithm. J. Mach. Learn. Res., 2, 213-242.
8. Gentile, C., & M. Warmuth (1998). Linear hinge loss and average margin. In Advances in Neural Information Processing Systems (pp. 225-231).
9. Grove, A. J., Littlestone, N., & Schuurmans, D. (2001). General convergence results for linear discriminant updates. Mach. Learn., 43, 173-210.
10. Herbster, M., Pontil, M., & Wainer, L. (2005). Online learning over graphs. Proc. Int. Conf. on Mach. Learn. (pp. 305-312).
11. Kivinen, J., & M.K. Warmuth (1997). Additive versus exponentiated gradient updates for linear prediction. Information and Computation, 132, 1-64.
12. Kivinen, J., Smola, A. J., & C. Williamson, R. (2002). Online learning with kernels. IEEE Transactions on Signal Processing, 52, 2165-2176.
13. Li, Y., & Long, P. M. (2002). The relaxed online maximum margin algorithm. Mach. Learn., 46, 361-387.
14. Littlestone, N. (1989). Mistake bounds and logarithmic linear-threshold learning algorithms. Doctoral dissertation, U. C. Santa Cruz.
15. Rosenblatt, F. (1958). The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65, 386-407.
16. Shalev-Shwartz, S., & Singer, Y (2006). Online learning meets optimization in the dual. Proc. of the 19th Annual Conf on Learning Theory (pp. 423-437).
17. Shor, N. (1977). Cut-off method with space extension in convex programming problems. Cybernetics, 12, 94-94.