Robust SVM Classification with ℓ 0 -Norm Feature Selection
Open Access
- 1 January 2026
- journal article
- Published by Banach Press LLC in Journal of Convex Analysis
- Vol. 33 (3&4) , 781-800
Abstract
We introduce a robust classification model designed for feature selection. Support vector machine (SVM) models continue to play a crucial role in binary classification, particularly with tabular data. Their robust variants are essential for developing classifiers that remain stable despite shifts in data distribution. Additionally, sparse classifiers are highly desirable, as they offer improved performance in classification tasks and help reduce overfitting, especially when the number of features exceeds the number of samples. In this context, penalty methods for feature selection are fundamental to the development of sparse optimization models. Despite its inherent nonlinearity and nonconvexity, the \ell_0 ℓ 0 -norm remains a popular choice for this task and has been effectively applied in diverse fields, such as pattern recognition and signal processing. Our objective is to evaluate the performance of two classification approaches that integrate robust classification in SVM-type models with embedded feature selection. We propose a diagonal algorithm for numerically solving these optimization models, which we validate through numerical tests on benchmark datasets. The results are compared to those obtained using models based on \ell_2 ℓ 2 -norm regularization.Keywords
This publication has 29 references indexed in Scilit:
- Application of the sequential parametric convex approximation method to the design of robust trussesJournal of Global Optimization, 2016
- Efficient approaches for ℓ 2-ℓ 0 regularization and applications to feature selection in SVMApplied Intelligence, 2016
- DC approximation approaches for sparse optimizationEuropean Journal of Operational Research, 2015
- Adaptive feature selection via a new version of support vector machineNeural Computing and Applications, 2012
- A prognostic DNA signature for T1T2 node‐negative breast cancer patientsGenes, Chromosomes and Cancer, 2010
- A sequential parametric convex approximation method with applications to nonconvex truss topology design problemsJournal of Global Optimization, 2009
- Concave programming for minimizing the zero-norm over polyhedral setsComputational Optimization and Applications, 2008
- Combined SVM-Based Feature Selection and ClassificationMachine Learning, 2005
- Second-order cone programmingMathematical Programming, 2003
- Support-vector networksMachine Learning, 1995