SVM Optimization: Inverse Dependence on Training Set Size
Cached
Download Links
by
Nathan Srebro
| Citations: | 31 - 8 self |
BibTeX
@MISC{Srebro_svmoptimization:,
author = {Nathan Srebro},
title = {SVM Optimization: Inverse Dependence on Training Set Size},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We discuss how the runtime of SVM optimization should decrease as the size of the training data increases. We present theoretical and empirical results demonstrating how a simple subgradient descent approach indeed displays such behavior, at least for linear kernels. 1.
Citations
| 758 | Fast training of support vector machines using sequential minimal optimization - Platt - 1999 |
| 345 | Making large-scale support vector machine learning practical - Joachims - 1998 |
| 185 | Rademacher and gaussian complexities: Risk bounds and structural - Bartlett, Mendelson - 2002 |
| 176 | Training Linear SVMs in Linear Time - Joachims - 2006 |
| 131 | Pegasos: Primal Estimated sub-GrAdient SOlver for SVM - Shalev-Shwartz, Singer, et al. - 2007 |
| 65 | The tradeoffs of large scale learning - Bottou, Bousquet - 2008 |
| 24 | Bundle methods for machine learning - Smola, Vishwanathan, et al. - 2007 |
| 19 | Large scale online learning - Cun - 2004 |
| 13 | A formal analysis of stopping criteria of decomposition methods for support vector machines - Lin |
| 9 | Support vector machine solvers - Bottou, Lin - 2007 |
| 2 | Fast convergence rates for excess regularized risk with application to SVM. http://ttic.uchicago. edu/˜karthik/con.pdf - Sridharan, Shalev-Shwartz, et al. - 2008 |
