Giacomo Borghi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Giacomo Borghi has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Lorenzo Pareschi
Department of Mathematics and Computer Science, University of Ferrara, Ferrara, Italy
7 shared publications - Michael Herty
Department of Mathematics RWTH Aachen University Aachen Germany
4 shared publications - Alessandro Benfenati
Environmental and Science Policy department, University of Milan, Milan, Italy
2 shared publications Lorenzo Pareschi
Maxwell Institute for Mathematical Sciences Department of Mathematics School of Mathematical and Computer Sciences (MACS) HWU Edinburgh UK
2 shared publications- Chiara Segala
Faculty of Informatics Università della Svizzera italiana Lugano CH
1 shared publication - Elisa Iacomini
Università degli studi di Ferrara, Italy
1 shared publication
Latest Publications
- 27 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 64 (3) , 1573-1601
A Particle Consensus Approach to Solving Nonconvex-Nonconcave Min-Max Problems
We propose a zero-order optimization method for sequential min-max problems that employs two populations of interacting particles. The systems are coupled so that one population aims to s...
- 27 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 64 (3) , 1573-1601
A Particle Consensus Approach to Solving Nonconvex-Nonconcave Min-Max Problems
We propose a zero-order optimization method for sequential min-max problems that employs two populations of interacting particles. The systems are coupled so that one population aims to s...
- 10 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 64 (2) , 485-509
Wasserstein Convergence Rates for Stochastic Particle Approximation of Boltzmann Models
We establish quantitative convergence rates for stochastic particle approximation based on Nanbu-type Monte Carlo schemes applied to a broad class of collisional kinetic models. Using cou...
- 10 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 64 (2) , 485-509
Wasserstein Convergence Rates for Stochastic Particle Approximation of Boltzmann Models
We establish quantitative convergence rates for stochastic particle approximation based on Nanbu-type Monte Carlo schemes applied to a broad class of collisional kinetic models. Using cou...
- 11 March 2026
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 58 (3) , e70333
Chaos propagation in genetic algorithms: An optimal transport approach
Genetic algorithms are high‐level heuristic optimization methods that enjoy great popularity thanks to their intuitive description, flexibility, and, of course, effectiveness. The optimization procedure is based on the evolution of possible solutions through three mechanisms: selection, mutation, and crossover. In this paper, we look at the algorithm as an interacting particle system and show that it is described by a Boltzmann‐type equation in the many‐particle limit. Specifically, we prove a propagation of chaos result using a technique that leverages the optimal transport formulation of the bounded Lipschitz norm and naturally incorporates the crossover mechanism into the analysis. The convergence admits a rate with respect to the number of particles, corresponding to the optimal rate in the Wasserstein‐1 distance.
- 11 March 2026
- Published by Wiley in Bulletin of the London Mathematical Society
- Vol. 58 (3) , e70333
Chaos propagation in genetic algorithms: An optimal transport approach
Genetic algorithms are high‐level heuristic optimization methods that enjoy great popularity thanks to their intuitive description, flexibility, and, of course, effectiveness. The optimization procedure is based on the evolution of possible solutions through three mechanisms: selection, mutation, and crossover. In this paper, we look at the algorithm as an interacting particle system and show that it is described by a Boltzmann‐type equation in the many‐particle limit. Specifically, we prove a propagation of chaos result using a technique that leverages the optimal transport formulation of the bounded Lipschitz norm and naturally incorporates the crossover mechanism into the analysis. The convergence admits a rate with respect to the number of particles, corresponding to the optimal rate in the Wasserstein‐1 distance.
- Open Access
- 19 May 2025
- Published by European Mathematical Society - EMS - Publishing House GmbH in Oberwolfach Reports
- Vol. 21 (4) , 3211-3254
Mini-Workshop: High-Dimensional Control Problems and Mean-Field Equations with Applications in Machine Learning
High-dimensional control problems and mean field equations have been of increased interest in recent years and novel numerical tools tackling the curse of dimensionality have been developed. These optimization tasks are strongly related to learning problems such as data-driven optimal control and learning of deep neural networks. As a consequence, there is a huge potential to employ control theoretical techniques in Machine Learning. The Mini-Workshop was devoted to discuss possible synergies among the various tools developed in these fields.
- 19 May 2025
- Published by European Mathematical Society - EMS - Publishing House GmbH in Oberwolfach Reports
- Vol. 21 (4) , 3211-3254
Open AccessMini-Workshop: High-Dimensional Control Problems and Mean-Field Equations with Applications in Machine Learning
High-dimensional control problems and mean field equations have been of increased interest in recent years and novel numerical tools tackling the curse of dimensionality have been developed. These optimization tasks are strongly related to learning problems such as data-driven optimal control and learning of deep neural networks. As a consequence, there is a huge potential to employ control theoretical techniques in Machine Learning. The Mini-Workshop was devoted to discuss possible synergies among the various tools developed in these fields.
- Open Access
Model predictive control strategies using consensus-based optimization
Model predictive control strategies require to solve in an sequential manner, many, possibly non-convex, optimization problems. In this work, we propose an interacting stochastic agent system to solve those problems. The agents evolve in pseudo-time and in parallel to the time-discrete state evolution. The method is suitable for non-convex, non-differentiable objective functions. The convergence properties are investigated through mean-field approximation of the time-discrete system, showing convergence in the case of additive linear control. We validate the proposed strategy by applying it to the control of a stirred-tank reactor non-linear system.
Open AccessModel predictive control strategies using consensus-based optimization
Model predictive control strategies require to solve in an sequential manner, many, possibly non-convex, optimization problems. In this work, we propose an interacting stochastic agent system to solve those problems. The agents evolve in pseudo-time and in parallel to the time-discrete state evolution. The method is suitable for non-convex, non-differentiable objective functions. The convergence properties are investigated through mean-field approximation of the time-discrete system, showing convergence in the case of additive linear control. We validate the proposed strategy by applying it to the control of a stirred-tank reactor non-linear system.
- Open Access
Kinetic description and convergence analysis of genetic algorithms for global optimization
Genetic Algorithms (GA) are a class of metaheuristic global optimization methods inspired by the process of natural selection among individuals in a population. Despite their widespread use, a comprehensive theoretical analysis of these methods remains challenging due to the complexity of the heuristic mechanisms involved. In this work, relying on the tools of statistical physics, we take a first step towards a mathematical understanding of GA by showing how their behavior for a large number of individuals can be approximated through a time-discrete kinetic model. This allows us to prove the convergence of the algorithm towards a global minimum under mild assumptions on the objective function for a popular choice of selection mechanism. Furthermore, we derive a time-continuous model of GA, represented by a Boltzmann-like partial differential equation, and establish relations with other kinetic and mean-field dynamics in optimization. Numerical experiments support the validity of the proposed kinetic approximation and investigate the asymptotic configurations of the GA particle system for different selection mechanisms and benchmark problems.
Open AccessKinetic description and convergence analysis of genetic algorithms for global optimization
Genetic Algorithms (GA) are a class of metaheuristic global optimization methods inspired by the process of natural selection among individuals in a population. Despite their widespread use, a comprehensive theoretical analysis of these methods remains challenging due to the complexity of the heuristic mechanisms involved. In this work, relying on the tools of statistical physics, we take a first step towards a mathematical understanding of GA by showing how their behavior for a large number of individuals can be approximated through a time-discrete kinetic model. This allows us to prove the convergence of the algorithm towards a global minimum under mild assumptions on the objective function for a popular choice of selection mechanism. Furthermore, we derive a time-continuous model of GA, represented by a Boltzmann-like partial differential equation, and establish relations with other kinetic and mean-field dynamics in optimization. Numerical experiments support the validity of the proposed kinetic approximation and investigate the asymptotic configurations of the GA particle system for different selection mechanisms and benchmark problems.
- Open Access
- 10 August 2023
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 88 (2) , 1-43
An Adaptive Consensus Based Method for Multi-objective Optimization with Uniform Pareto Front Approximation
In this work we are interested in stochastic particle methods for multi-objective optimization. The problem is formulated via scalarization using parametrized, single-objective sub-problems which are solved simultaneously. To this end a consensus based multi-objective optimization method on the search space combined with an additional heuristic strategy to adapt parameters during the computations is proposed. The adaptive strategy aims to distribute the particles uniformly over the image space, in particular over the Pareto front, by using energy-based measures to quantify the diversity of the system. The resulting gradient-free metaheuristic algorithm is mathematically analyzed using a mean-field approximation of the algorithm iteration and convergence guarantees towards Pareto optimal points are rigorously proven. In addition, we analyze the dynamics when the Pareto front corresponds to the unit simplex, and show that the adaptive mechanism reduces to a gradient flow in this case. Several numerical experiments show the validity of the proposed stochastic particle dynamics, investigate the role of the algorithm parameters and validate the theoretical findings.
- 10 August 2023
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 88 (2) , 1-43
Open AccessAn Adaptive Consensus Based Method for Multi-objective Optimization with Uniform Pareto Front Approximation
In this work we are interested in stochastic particle methods for multi-objective optimization. The problem is formulated via scalarization using parametrized, single-objective sub-problems which are solved simultaneously. To this end a consensus based multi-objective optimization method on the search space combined with an additional heuristic strategy to adapt parameters during the computations is proposed. The adaptive strategy aims to distribute the particles uniformly over the image space, in particular over the Pareto front, by using energy-based measures to quantify the diversity of the system. The resulting gradient-free metaheuristic algorithm is mathematically analyzed using a mean-field approximation of the algorithm iteration and convergence guarantees towards Pareto optimal points are rigorously proven. In addition, we analyze the dynamics when the Pareto front corresponds to the unit simplex, and show that the adaptive mechanism reduces to a gradient flow in this case. Several numerical experiments show the validity of the proposed stochastic particle dynamics, investigate the role of the algorithm parameters and validate the theoretical findings.
- 1 August 2023
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 174
Consensus based optimization with memory effects: Random selection and applications
- 1 August 2023
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 174
Consensus based optimization with memory effects: Random selection and applications
- Open Access
Consensus based optimization with memory effects: random selection and applications
In this work we extend the class of Consensus-Based Optimization (CBO) metaheuristic methods by considering memory effects and a random selection strategy. The proposed algorithm iteratively updates a population of particles according to a consensus dynamics inspired by social interactions among individuals. The consensus point is computed taking into account the past positions of all particles. While sharing features with the popular Particle Swarm Optimization (PSO) method, the exploratory behavior is fundamentally different and allows better control over the convergence of the particle system. We discuss some implementation aspects which lead to an increased efficiency while preserving the success rate in the optimization process. In particular, we show how employing a random selection strategy to discard particles during the computation improves the overall performance. Several benchmark problems and applications to image segmentation and Neural Networks training are used to validate and test the proposed method. A theoretical analysis allows to recover convergence guarantees under mild assumptions on the objective function. This is done by first approximating the particles evolution with a continuous-in-time dynamics, and then by taking the mean-field limit of such dynamics. Convergence to a global minimizer is finally proved at the mean-field level.
Open AccessConsensus based optimization with memory effects: random selection and applications
In this work we extend the class of Consensus-Based Optimization (CBO) metaheuristic methods by considering memory effects and a random selection strategy. The proposed algorithm iteratively updates a population of particles according to a consensus dynamics inspired by social interactions among individuals. The consensus point is computed taking into account the past positions of all particles. While sharing features with the popular Particle Swarm Optimization (PSO) method, the exploratory behavior is fundamentally different and allows better control over the convergence of the particle system. We discuss some implementation aspects which lead to an increased efficiency while preserving the success rate in the optimization process. In particular, we show how employing a random selection strategy to discard particles during the computation improves the overall performance. Several benchmark problems and applications to image segmentation and Neural Networks training are used to validate and test the proposed method. A theoretical analysis allows to recover convergence guarantees under mild assumptions on the objective function. This is done by first approximating the particles evolution with a continuous-in-time dynamics, and then by taking the mean-field limit of such dynamics. Convergence to a global minimizer is finally proved at the mean-field level.