Hicham Kouhkouh
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
Hicham Kouhkouh has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Martino Bardi
Dipartimento di Matematica “T. Levi-Civita”, Università di Padova, Padova, Italy
7 shared publications - Hui Huang
School of Mathematics, Hunan University, Changsha, China
3 shared publications - Carlos Esteve-Yagüe
Departamento de Matemáticas, Universidad de Alicante , San Vicente del Raspeig, 03690 Alicante
2 shared publications - Dario Pighin
Departamento de Matemáticas Universidad Autónoma de Madrid 28049 Madrid Spain
2 shared publications - Enrique Zuazua
Chair for Dynamics, Control, Machine Learning and Numerics, Alexander von Humboldt-Professorship, Department of Mathematics, Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Germany
2 shared publications Dante Kalise
Department of Mathematics, Imperial College London, South Kensington Campus, SW72AZ London, UK
1 shared publication
Latest Publications
- 8 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 36 (4) , 2121-2150
Faithful Global Convergence for the Rescaled Consensus–Based Optimization
We analyze the consensus-based optimization algorithm with a consensus point rescaled by a fixed parameter [Formula: see text]. Under minimal assumptions on the objective function and the initial data, we establish its unconditional convergence to the global minimizer. Our results hold in the asymptotic regime where the time horizon [Formula: see text] and the inverse temperature [Formula: see text] are taken successively, providing a rigorous theoretical foundation for the algorithm’s global convergence. Furthermore, our findings extend to the case of multiple and nondiscrete set of minimizers.
- 8 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 36 (4) , 2121-2150
Faithful Global Convergence for the Rescaled Consensus–Based Optimization
We analyze the consensus-based optimization algorithm with a consensus point rescaled by a fixed parameter [Formula: see text]. Under minimal assumptions on the objective function and the initial data, we establish its unconditional convergence to the global minimizer. Our results hold in the asymptotic regime where the time horizon [Formula: see text] and the inverse temperature [Formula: see text] are taken successively, providing a rigorous theoretical foundation for the algorithm’s global convergence. Furthermore, our findings extend to the case of multiple and nondiscrete set of minimizers.
- Open Access
- 19 August 2025
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 31, 69
Uniform-in-time mean-field limit estimate for the Consensus-Based Optimization
We establish a uniform-in-time estimate for the mean-field convergence of the Consensus- Based Optimization (CBO) algorithm by rescaling the consensus point in the dynamics with a small parameter κ ∈ (0, 1). This uniform-in-time estimate is essential, as CBO convergence relies on a sufficiently large time horizon and is crucial for ensuring stable, reliable long-term convergence, the latter being key to the practical effectiveness of CBO methods.
- 19 August 2025
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 31, 69
Open AccessUniform-in-time mean-field limit estimate for the Consensus-Based Optimization
We establish a uniform-in-time estimate for the mean-field convergence of the Consensus- Based Optimization (CBO) algorithm by rescaling the consensus point in the dynamics with a small parameter κ ∈ (0, 1). This uniform-in-time estimate is essential, as CBO convergence relies on a sufficiently large time horizon and is crucial for ensuring stable, reliable long-term convergence, the latter being key to the practical effectiveness of CBO methods.
- 17 June 2025
- Published by World Scientific Pub Co Pte Ltd in Mathematical Models and Methods in Applied Sciences
- Vol. 35 (10) , 2207-2243
A multiscale consensus-based algorithm for multilevel optimization
In this paper, a novel multiscale consensus-based optimization (CBO) algorithm for solving bi- and tri-level optimization problems is introduced. Existing CBO techniques are generalized by the proposed method through the employment of multiple interacting populations of particles, each of which is used to optimize one level of the problem. These particle populations are evolved through multiscale-in-time dynamics, which are formulated as a singularly perturbed system of stochastic differential equations. Theoretical convergence analysis for the multiscale CBO model to an averaged effective dynamics as the time-scale separation parameter approaches zero is provided. The resulting algorithm is presented for both bi-level and tri-level optimization problems. The effectiveness of the approach in tackling complex multilevel optimization tasks is demonstrated through numerical experiments on various benchmark functions. Additionally, it is shown that the proposed method performs well on min–max optimization problems, comparing favorably with existing CBO algorithms for saddle point problems.
- 17 June 2025
- Published by World Scientific Pub Co Pte Ltd in Mathematical Models and Methods in Applied Sciences
- Vol. 35 (10) , 2207-2243
A multiscale consensus-based algorithm for multilevel optimization
In this paper, a novel multiscale consensus-based optimization (CBO) algorithm for solving bi- and tri-level optimization problems is introduced. Existing CBO techniques are generalized by the proposed method through the employment of multiple interacting populations of particles, each of which is used to optimize one level of the problem. These particle populations are evolved through multiscale-in-time dynamics, which are formulated as a singularly perturbed system of stochastic differential equations. Theoretical convergence analysis for the multiscale CBO model to an averaged effective dynamics as the time-scale separation parameter approaches zero is provided. The resulting algorithm is presented for both bi-level and tri-level optimization problems. The effectiveness of the approach in tackling complex multilevel optimization tasks is demonstrated through numerical experiments on various benchmark functions. Additionally, it is shown that the proposed method performs well on min–max optimization problems, comparing favorably with existing CBO algorithms for saddle point problems.
- Open Access
- 6 November 2024
- Published by Elsevier in Applied Mathematics Letters
- Vol. 161
Self-interacting CBO: Existence, uniqueness, and long-time convergence
- 6 November 2024
- Published by Elsevier in Applied Mathematics Letters
- Vol. 161
Open AccessSelf-interacting CBO: Existence, uniqueness, and long-time convergence
- 24 July 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 62 (4) , 2229-2253
Deep Relaxation of Controlled Stochastic Gradient Descent via Singular Perturbations
We consider a singularly perturbed system of stochastic differential equations proposed by Chaudhari et al. (Res. Math. Sci. 2018) to approximate the entropic gradient descent in the optimization of deep neural networks via homogenization. We embed it in a much larger class of two-scale stochastic control problems and rely on convergence results for Hamilton–Jacobi–Bellman equations with unbounded data proved recently by ourselves (ESAIM Control Optim. Calc. Var. 2023). We show that the limit of the value functions is itself the value function of an effective control problem with extended controls and that the trajectories of the perturbed system converge in a suitable sense to the trajectories of the limiting effective control system. These rigorous results improve the understanding of the convergence of the algorithms used by Chaudhari et al., as well as of their possible extensions where some tuning parameters are modeled as dynamic controls.
- 24 July 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 62 (4) , 2229-2253
Deep Relaxation of Controlled Stochastic Gradient Descent via Singular Perturbations
We consider a singularly perturbed system of stochastic differential equations proposed by Chaudhari et al. (Res. Math. Sci. 2018) to approximate the entropic gradient descent in the optimization of deep neural networks via homogenization. We embed it in a much larger class of two-scale stochastic control problems and rely on convergence results for Hamilton–Jacobi–Bellman equations with unbounded data proved recently by ourselves (ESAIM Control Optim. Calc. Var. 2023). We show that the limit of the value functions is itself the value function of an effective control problem with extended controls and that the trajectories of the perturbed system converge in a suitable sense to the trajectories of the limiting effective control system. These rigorous results improve the understanding of the convergence of the algorithms used by Chaudhari et al., as well as of their possible extensions where some tuning parameters are modeled as dynamic controls.
- 15 July 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 56 (4) , 5079-5098
Long-Time Behavior of Deterministic Mean Field Games with Nonmonotone Interactions
We consider deterministic mean field games (MFGs) in all Euclidean space with a cost functional continuous with respect to the distribution of the agents and attaining its minima in a compact set. We first show that the static MFG with such a cost has an equilibrium, and we build from it a solution of the ergodic MFG system of first order PDEs with the same cost. Next we address the long-time limit of the solutions to finite horizon MFGs with cost functional satisfying various additional assumptions, but not the classical Lasry–Lions monotonicity condition. Instead we assume that the cost has the same set of minima for all measures describing the population. We prove the convergence of the distribution of the agents and of the value function to a solution of the ergodic MFG system as the horizon of the game tends to infinity, extending to this class of MFGs some results of weak KAM theory.
- 15 July 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Mathematical Analysis
- Vol. 56 (4) , 5079-5098
Long-Time Behavior of Deterministic Mean Field Games with Nonmonotone Interactions
We consider deterministic mean field games (MFGs) in all Euclidean space with a cost functional continuous with respect to the distribution of the agents and attaining its minima in a compact set. We first show that the static MFG with such a cost has an equilibrium, and we build from it a solution of the ergodic MFG system of first order PDEs with the same cost. Next we address the long-time limit of the solutions to finite horizon MFGs with cost functional satisfying various additional assumptions, but not the classical Lasry–Lions monotonicity condition. Instead we assume that the cost has the same set of minima for all measures describing the population. We prove the convergence of the distribution of the agents and of the value function to a solution of the ergodic MFG system as the horizon of the game tends to infinity, extending to this class of MFGs some results of weak KAM theory.
- Open Access
Relaxation and asymptotic expansion of controlled stiff differential equations
The control of relaxation-type systems of ordinary differential equations is investigated using the Hamilton-Jacobi-Bellman equation. First, we recast the model as a singularly perturbed dynamics which we embed in a family of controlled systems. Then we study this dynamics together with the value function of the associated optimal control problem. We provide an asymptotic expansion in the relaxation parameter of the value function. We also show that its solution converges toward the solution of a Hamilton-Jacobi-Bellman equation for a reduced control problem. Such systems are motivated by semi-discretisation of kinetic and hyperbolic partial differential equations. Several examples are presented including Jin-Xin relaxation.
Open AccessRelaxation and asymptotic expansion of controlled stiff differential equations
The control of relaxation-type systems of ordinary differential equations is investigated using the Hamilton-Jacobi-Bellman equation. First, we recast the model as a singularly perturbed dynamics which we embed in a family of controlled systems. Then we study this dynamics together with the value function of the associated optimal control problem. We provide an asymptotic expansion in the relaxation parameter of the value function. We also show that its solution converges toward the solution of a Hamilton-Jacobi-Bellman equation for a reduced control problem. Such systems are motivated by semi-discretisation of kinetic and hyperbolic partial differential equations. Several examples are presented including Jin-Xin relaxation.
- Open Access
Long-time behaviour of deterministic Mean Field Games with non-monotone interactions
We consider deterministic Mean Field Games (MFG) in all Euclidean space with a cost functional continuous with respect to the distribution of the agents and attaining its minima in a compact set. We first show that the static MFG with such a cost has an equilibrium, and we build from it a solution of the ergodic MFG system of 1st order PDEs with the same cost. Next we address the long-time limit of the solutions to finite horizon MFG with cost functional satisfying various additional assumptions, but not the classical Lasry-Lions monotonicity condition. Instead we assume that the cost has the same set of minima for all measures describing the population. We prove the convergence of the distribution of the agents and of the value function to a solution of the ergodic MFG system as the horizon of the game tends to infinity, extending to this class of MFG some results of weak KAM theory.
Open AccessLong-time behaviour of deterministic Mean Field Games with non-monotone interactions
We consider deterministic Mean Field Games (MFG) in all Euclidean space with a cost functional continuous with respect to the distribution of the agents and attaining its minima in a compact set. We first show that the static MFG with such a cost has an equilibrium, and we build from it a solution of the ergodic MFG system of 1st order PDEs with the same cost. Next we address the long-time limit of the solutions to finite horizon MFG with cost functional satisfying various additional assumptions, but not the classical Lasry-Lions monotonicity condition. Instead we assume that the cost has the same set of minima for all measures describing the population. We prove the convergence of the distribution of the agents and of the value function to a solution of the ergodic MFG system as the horizon of the game tends to infinity, extending to this class of MFG some results of weak KAM theory.
- Open Access
Deep Relaxation of Controlled Stochastic Gradient Descent via Singular Perturbations
We consider a singularly perturbed system of stochastic differential equations proposed by Chaudhari et al. (Res. Math. Sci. 2018) to approximate the Entropic Gradient Descent in the optimization of deep neural networks, via homogenisation. We embed it in a much larger class of two-scale stochastic control problems and rely on convergence results for Hamilton-Jacobi-Bellman equations with unbounded data proved recently by ourselves (ESAIM Control Optim. Calc. Var. 2023). We show that the limit of the value functions is itself the value function of an effective control problem with extended controls, and that the trajectories of the perturbed system converge in a suitable sense to the trajectories of the limiting effective control system. These rigorous results improve the understanding of the convergence of the algorithms used by Chaudhari et al., as well as of their possible extensions where some tuning parameters are modelled as dynamic controls.
Open AccessDeep Relaxation of Controlled Stochastic Gradient Descent via Singular Perturbations
We consider a singularly perturbed system of stochastic differential equations proposed by Chaudhari et al. (Res. Math. Sci. 2018) to approximate the Entropic Gradient Descent in the optimization of deep neural networks, via homogenisation. We embed it in a much larger class of two-scale stochastic control problems and rely on convergence results for Hamilton-Jacobi-Bellman equations with unbounded data proved recently by ourselves (ESAIM Control Optim. Calc. Var. 2023). We show that the limit of the value functions is itself the value function of an effective control problem with extended controls, and that the trajectories of the perturbed system converge in a suitable sense to the trajectories of the limiting effective control system. These rigorous results improve the understanding of the convergence of the algorithms used by Chaudhari et al., as well as of their possible extensions where some tuning parameters are modelled as dynamic controls.
- 1 February 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 62 (1) , 415-440
A Viscous Ergodic Problem with Unbounded and Measurable Ingredients, Part 1: HJB Equation
We address the problem of existence and uniqueness of solutions [Formula: see text] to ergodic Hamilton–Jacobi–Bellman (HJB) equations of the form [Formula: see text] in the whole space [Formula: see text] with unbounded and merely measurable data and where [Formula: see text] is a Bellman Hamiltonian. The method we use is different from classical approaches. It relies on duality theory and optimization in abstract Banach spaces together with maximal dissipativity of the diffusion operator.
- 1 February 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 62 (1) , 415-440
A Viscous Ergodic Problem with Unbounded and Measurable Ingredients, Part 1: HJB Equation
We address the problem of existence and uniqueness of solutions [Formula: see text] to ergodic Hamilton–Jacobi–Bellman (HJB) equations of the form [Formula: see text] in the whole space [Formula: see text] with unbounded and merely measurable data and where [Formula: see text] is a Bellman Hamiltonian. The method we use is different from classical approaches. It relies on duality theory and optimization in abstract Banach spaces together with maximal dissipativity of the diffusion operator.