Stochastic subgradient estimation training for support vector machines
From MaRDI portal
Publication:4922840
Abstract: Subgradient algorithms for training support vector machines have been quite successful for solving large-scale and online learning problems. However, they have been restricted to linear kernels and strongly convex formulations. This paper describes efficient subgradient approaches without such limitations. Our approaches make use of randomized low-dimensional approximations to nonlinear kernels, and minimization of a reduced primal formulation using an algorithm based on robust stochastic approximation, which do not require strong convexity. Experiments illustrate that our approaches produce solutions of comparable prediction accuracy with the solutions acquired from existing SVM solvers, but often in much shorter time. We also suggest efficient prediction schemes that depend only on the dimension of kernel approximation, not on the number of support vectors.
Recommendations
Cites work
- A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
- Cutting-plane training of structural SVMs
- Fast kernel classifiers with online and active learning
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- Pegasos: primal estimated sub-gradient solver for SVM
- Robust Stochastic Approximation Approach to Stochastic Programming
- Sparse kernel SVMs via cutting-plane training
- Training a Support Vector Machine in the Primal
- Working set selection using second order information for training support vector machines
Cited in
(10)- Stochastic gradient descent with Barzilai-Borwein update step for SVM
- Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
- 10.1162/15324430260185619
- How effectively train large-scale machine learning models?
- Evaluation of stochastic approximation algorithm and variants for learning support vector machines
- Distributed inference for linear support vector machine
- Breaking the curse of kernelization: budgeted stochastic gradient descent for large-scale SVM training
- Pegasos: primal estimated sub-gradient solver for SVM
- Scalable Gaussian kernel support vector machines with sublinear training time complexity
- Provably fast training algorithms for support vector machines
This page was built for publication: Stochastic subgradient estimation training for support vector machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922840)
