Step size-adapted online support vector learning

1Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an online Support Vector Machine (SVM) that uses Stochastic Meta-Descent (SMD) to adapt its step size automatically. We formulate the online learning problem as a stochastic gradient descent in Reproducing Kernel Hubert Space (RKHS) and translate SMD to the nonparametric setting, where its gradient trace parameter is no longer a coefficient vector but an element of the RKHS. We derive efficient updates that allow us to perform the step size adaptation in linear time. We apply the online SVM framework to a variety of loss functions and in particular show how to achieve efficient online multiclass classification. Experimental evidence suggests that our algorithm outperforms existing methods. © 2005 IEEE.

Cite

CITATION STYLE

APA

Karatzoglou, A., Vishwanathan, S. V. N., Schraudolph, N. N., & Smola, A. J. (2005). Step size-adapted online support vector learning. In Proceedings - 8th International Symposium on Signal Processing and its Applications, ISSPA 2005 (Vol. 2, pp. 823–826). https://doi.org/10.1109/ISSPA.2005.1581065

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free