activity
20152025
most citedUnboxing Tree Ensembles for interpretability: a hierarchical visualization tool and a multivariate optimal re-built tree

18 citations · 70 across the 18 of their papers we have counts for

collaborators

18 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…

cs.LG2024

Beyond adaptive gradient: Fast-Controlled Minibatch Algorithm for large-scale optimization

Corrado Coppola, Lorenzo Papa, Irene Amerini +1

Adaptive gradient methods have been increasingly adopted by deep learning community due to their fast convergence and reduced sensitivity to hyper-parameters. However, these method…

math.OC2024

Computational issues in Optimization for Deep networks

Corrado Coppola, Lorenzo Papa, Marco Boresta +2

The paper aims to investigate relevant computational issues of deep neural network architectures with an eye to the interaction between the optimization algorithm and the classific…

econ.GN2024★ 1 cited

The forgotten pillar of sustainability: development of the S-assessment tool to evaluate Organizational Social Sustainability

Alessandro Annarelli, Tiziana Catarci, Laura Palagi

Pursuing sustainable development has become a global imperative, underscored adopting of the 2030 Agenda for Sustainable Development and its 17 Sustainable Development Goals (SDG).…

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…

math.OC2024★ 1 cited

Benders decomposition for congested partial set covering location with uncertain demand

Alice Calamita, Ivana Ljubić, Laura Palagi

In this paper, we introduce a mixed integer quadratic formulation for the congested variant of the partial set covering location problem, which involves determining a subset of fac…

q-bio.QM2023★ 17 cited

A graph neural network-based model with Out-of-Distribution Robustness for enhancing Antiretroviral Therapy Outcome Prediction for HIV-1

Giulia Di Teodoro, Federico Siciliano, Valerio Guarrasi +6

Predicting the outcome of antiretroviral therapies (ART) for HIV-1 is a pressing clinical challenge, especially when the ART includes drugs with limited effectiveness data. This sc…

cs.LG2023★ 6 cited

Incorporating temporal dynamics of mutations to enhance the prediction capability of antiretroviral therapy's outcome for HIV-1

Giulia Di Teodoro, Martin Pirkl, Francesca Incardona +6

Motivation: In predicting HIV therapy outcomes, a critical clinical question is whether using historical information can enhance predictive capabilities compared with current or la…

math.OC2023

CMA Light: a novel Minibatch Algorithm for large-scale non convex finite sum optimization

Corrado Coppola, Giampaolo Liuzzi, Laura Palagi

The supervised training of a deep neural network on a given dataset consists in the unconstrained minimization of the finite sum of continuously differentiable functions, commonly…

math.OC2023★ 1 cited

A computational study of off-the-shelf MINLP solvers on a benchmark set of congested capacitated facility location problems

Pasquale Avella, Alice Calamita, Laura Palagi

This paper analyzes the performance of five well-known off-the-shelf optimization solvers on a set of congested capacitated facility location problems formulated as mixed-integer c…

math.OC2023★ 18 cited

Unboxing Tree Ensembles for interpretability: a hierarchical visualization tool and a multivariate optimal re-built tree

Giulia Di Teodoro, Marta Monaci, Laura Palagi

The interpretability of models has become a crucial issue in Machine Learning because of algorithmic decisions' growing impact on real-world applications. Tree ensemble methods, su…

math.OC2022

Convergence of ease-controlled Random Reshuffling gradient Algorithms under Lipschitz smoothness

Ruggiero Seccia, Corrado Coppola, Giampaolo Liuzzi +1

In this work, we consider minimizing the average of a very large number of smooth and possibly non-convex functions, and we focus on two widely used minibatch frameworks to tackle…

math.OC2022★ 12 cited

Margin Optimal Classification Trees

Federico D'Onofrio, Giorgio Grani, Marta Monaci +1

In recent years, there has been growing attention to interpretable machine learning models which can give explanatory insights on their behaviour. Thanks to their interpretability,…

cs.DM2022

Speeding up the solution of the Site and Power Assignment Problem in Wireless Networks

Pasquale Avella, Alice Calamita, Laura Palagi

This paper addresses the optimal design of wireless networks through the site and power assignment problem. Given a set of candidate transmitters, this problem involves choosing op…

math.OC2022★ 3 cited

Solving the vehicle routing problem with deep reinforcement learning

Simone Foa, Corrado Coppola, Giorgio Grani +1

Recently, the applications of the methodologies of Reinforcement Learning (RL) to NP-Hard Combinatorial optimization problems have become a popular topic. This is essentially due t…

cs.LG2022★ 4 cited

AI-based Data Preparation and Data Analytics in Healthcare: The Case of Diabetes

Marianna Maranghi, Aris Anagnostopoulos, Irene Cannistraci +13

The Associazione Medici Diabetologi (AMD) collects and manages one of the largest worldwide-available collections of diabetic patient records, also known as the AMD database. This…

math.OC2020★ 3 cited

Block Layer Decomposition schemes for training Deep Neural Networks

Laura Palagi, Ruggiero Seccia

Deep Feedforward Neural Networks' (DFNNs) weights estimation relies on the solution of a very large nonconvex optimization problem that may have many local (no global) minimizers,…

math.OC2015★ 4 cited

A Class of Parallel Decomposition Algorithms for SVMs Training

Andrea Manno, Laura Palagi, Simone Sagratella

The training of Support Vector Machines may be a very difficult task when dealing with very large datasets. The memory requirement and the time consumption of the SVMs algorithms g…