SVM optimization
Shai Shalev‐Shwartz, Nathan Srebro · International Conference on Machine Learning · 2008
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.
Cited by 240 works. doi:10.1145/1390156.1390273
Authors
References
- A Theory of the Learnable
- Advances in kernel methods: support vector learning
- Fast Training of Support Vector Machines Using Sequential Minimal Optimization
- Making Large-Scale Support Vector Machine Learning Practical
- Training linear SVMs in linear time
- Pegasos
- Large-Scale Kernel Machines
- The Tradeoffs of Large-Scale Learning
- Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
- Large Scale Online Learning.