Beating SGD: Learning SVMs in Sublinear Time
Elad Hazan ⋅ Tomer Koren ⋅ Nati Srebro
2011 Poster
Abstract
We present an optimization approach for linear SVMs based on a stochastic primal-dual approach, where the primal step is akin to an importance-weighted SGD, and the dual step is a stochastic update on the importance weights. This yields an optimization method with a sublinear dependence on the training set size, and the first method for learning linear SVMs with runtime less then the size of the training set required for learning!
Chat is not available.
Successful Page Load