3 papers
math.OC2025
Feature Selection in Nonlinear SVMs via Local Search and Submodular Optimization
Federico D'Onofrio, Yuri Faenza, Laura Palagi
Embedded feature selection is a classical approach to interpretable machine learning, aiming to iden- tify the most informative variables while simultaneously training the predicti…
math.OC2024
Feature selection in linear SVMs via a hard cardinality constraint: a scalable SDP decomposition approach
Immanuel Bomze, Federico D'Onofrio, Laura Palagi +1
In this paper, we study the embedded feature selection problem in linear Support Vector Machines (SVMs), in which a cardinality constraint is employed, leading to an interpretable…
cs.DS2023
The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits
Federico D'Onofrio, Yuri Faenza, Lingyi Zhang
We study incremental knapsack problems with profits given by a special class of monotone submodular functions, that we dub all-or-nothing. We show that these problems are not harde…