Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2507.23711 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909714072207360 |
|---|---|
| author | D'Onofrio, Federico Faenza, Yuri Palagi, Laura |
| author_facet | D'Onofrio, Federico Faenza, Yuri Palagi, Laura |
| contents | Embedded Feature Selection (FS) is a classical approach for interpretable machine learning, aiming to identify the most relevant features of a dataset while simultaneously training the model. We consider an approach based on a hard cardinality constraint for nonlinear SVMs. To the best of our knowledge, hard-constraint approaches have been proposed only for the primal formulation of linear SVMs. In contrast, we embed a hard cardinality constraint directly into the dual of a nonlinear SVM, guaranteeing strict control over the number of selected features while still leveraging kernelization. We formulate the problem as a Mixed-Integer Nonlinear Programming (MINLP) model. As a first contribution, we propose a local search metaheuristic applicable to general nonlinear kernels. Our second and main contribution is a decomposition framework that alternates optimization between two subproblems: one involving only continuous variables and the other involving only binary variables. For polynomial kernels, we show that the binary subproblem reduces to a submodular function maximization under a cardinality constraint, enabling the use of scalable submodular maximization algorithms within the alternating optimization process. Numerical experiments demonstrate that our algorithms significantly outperform standard methods for solving the proposed MINLPs, providing more effective solutions to the addressed feature selection problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_23711 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Combinatorial Approaches for Embedded Feature Selection in Nonlinear SVMs D'Onofrio, Federico Faenza, Yuri Palagi, Laura Optimization and Control Embedded Feature Selection (FS) is a classical approach for interpretable machine learning, aiming to identify the most relevant features of a dataset while simultaneously training the model. We consider an approach based on a hard cardinality constraint for nonlinear SVMs. To the best of our knowledge, hard-constraint approaches have been proposed only for the primal formulation of linear SVMs. In contrast, we embed a hard cardinality constraint directly into the dual of a nonlinear SVM, guaranteeing strict control over the number of selected features while still leveraging kernelization. We formulate the problem as a Mixed-Integer Nonlinear Programming (MINLP) model. As a first contribution, we propose a local search metaheuristic applicable to general nonlinear kernels. Our second and main contribution is a decomposition framework that alternates optimization between two subproblems: one involving only continuous variables and the other involving only binary variables. For polynomial kernels, we show that the binary subproblem reduces to a submodular function maximization under a cardinality constraint, enabling the use of scalable submodular maximization algorithms within the alternating optimization process. Numerical experiments demonstrate that our algorithms significantly outperform standard methods for solving the proposed MINLPs, providing more effective solutions to the addressed feature selection problem. |
| title | Combinatorial Approaches for Embedded Feature Selection in Nonlinear SVMs |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2507.23711 |