Difference of Convex programming in adversarial SVM
From MaRDI portal
Recommendations
- Robust support vector machines for classification and computational issues
- Robust and distributionally robust optimization models for linear support vector machine
- Robustness verification of support vector machines
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- Robust classification and regression using support vector machines
Cites work
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- Conic separation of finite sets. I: The homogeneous case
- Data preprocessing in semi-supervised SVM classification
- DC formulations and algorithms for sparse optimization problems
- Deforming \(\|.\|_1\) into \(\|.\|_{\infty}\) via polyhedral norms: a pedestrian approach
- Dual formulation of the sparsity constrained optimization problem: application to classification
- Ellipsoidal classification via semidefinite programming
- Ellipsoidal separation for classification problems
- Feature selection in SVM via polyhedral \(k\)-norm
- Global optimality conditions for nonconvex optimization
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Lagrangian relaxation for SVM feature selection
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Multisurface method of pattern separation
- Numerical Nonsmooth Optimization
- Pattern separation by convex programming
- Polyhedral separation via difference of convex (DC) programming
- Robustness and regularization of support vector machines
- Scikit-learn: machine learning in Python
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- Support vector machine polyhedral separability in semisupervised learning
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The descent-ascent algorithm for DC programming
- The security of machine learning
This page was built for publication: Difference of Convex programming in adversarial SVM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593354)
