Sciweavers

Share
JMLR
2006

Step Size Adaptation in Reproducing Kernel Hilbert Space

9 years 2 months ago
Step Size Adaptation in Reproducing Kernel Hilbert Space
This paper presents an online support vector machine (SVM) that uses the stochastic meta-descent (SMD) algorithm to adapt its step size automatically. We formulate the online learning problem as a stochastic gradient descent in reproducing kernel Hilbert 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 handle structured output spaces and achieve efficient online multiclass classification. Experiments show that our algorithm outperforms more primitive methods for setting the gradient step size.
S. V. N. Vishwanathan, Nicol N. Schraudolph, Alex
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JMLR
Authors S. V. N. Vishwanathan, Nicol N. Schraudolph, Alex J. Smola
Comments (0)
books