Controlled Swarm Gradient Dynamics

We consider the global optimization of a non-convex potential U : Rd → R and ex tend the controlled simulated annealing framework introduced in [31] to the class of swarm gradient dynamics, a family of Langevin-type mean-field diffusions whose noise intensity depends locally on the marginal density of the process. Building on the time-homogeneous model of [18], we first analyze its invariant probability density and show that, as the in verse temperature parameter tends to infinity, it converges weakly to a probability measure supported on the set of global minimizers of U. This result justifies using this family of invariant measures as an annealing curve in a controlled swarm setting. Given an arbitrary non-decreasing cooling schedule, we then prove the existence of a velocity field solving the continuity equation associated with the curve of invariant densi ties. Superimposing this field onto the swarm gradient dynamics yields a well-posed con trolled process whose marginal law follows exactly the prescribed annealing curve. As a consequence, the controlled swarm dynamics converges toward global minimizers with, in principle, arbitrarily fast convergence rates, entirely dictated by the choice of the cooling schedule. Finally, we discuss an algorithmic implementation of the controlled dynamics and compare its performance with controlled simulated annealing, highlighting some numerical limitations