On the working set selection in gradient projection-based decomposition techniques for support vector machines
From MaRDI portal
(Redirected from Publication:5717544)
Recommendations
- An improved gradient projection-based decomposition technique for support vector machines
- A simple decomposition method for support vector machines
- Working set selection using second order information for training support vector machines
- On the complexity of working set selection
- Algorithmic Learning Theory
Cites work
- A modified projection algorithm for large strictly-convex quadratic programs
- A simple decomposition method for support vector machines
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An introduction to support vector machines and other kernel-based learning methods.
- Convergence of a generalized SMO algorithm for SVM classifier design
- Efficient SVM regression training with SMO
- Gradient projection methods for quadratic programs and applications in training support vector machines
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 2110305 (Why is no real title available?)
- Improvements to Platt's SMO Algorithm for SVM Classifier Design
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- On the convergence of a modified version of SVMlightalgorithm
- SVMTorch: Support vector machines for large-scale regression problems.
Cited in
(14)- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- On the convergence of inexact block coordinate descent methods for constrained optimization
- An improved gradient projection-based decomposition technique for support vector machines
- Efficient optimization of support vector machine learning parameters for unbalanced datasets
- Binary separation and training support vector machines
- Working set selection using second order information for training support vector machines
- Maximum-gain working set selection for SVMs
- A Note on the Decomposition Methods for Support Vector Regression
- On the convergence rate of scaled gradient projection method
- A two-level decomposition framework exploiting first and second order information for SVM training problems
- A reduced-space algorithm for minimizing _1-regularized convex functions
- Nonlinear optimization and support vector machines
- Nonlinear optimization and support vector machines
- A simple decomposition method for support vector machines
This page was built for publication: On the working set selection in gradient projection-based decomposition techniques for support vector machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717544)
