Uniform-in-time propagation of chaos for Consensus-Based Optimization

Abstract

We study the derivative-free global optimization algorithm Consensus-Based Optimization (CBO), establishing uniform-in-time propagation of chaos as well as an almost uniform-in-time stability result for the microscopic particle system. Moreover, we prove almost sure exponential convergence of the microscopic CBO system around a point close to the global minimizer. The proof of these results is based on a novel stability estimate for the weighted mean and on a quantitative concentration inequality for the microscopic particle system around the empirical mean. Our propagation of chaos result recovers the classical Monte Carlo rate, with a prefactor that depends explicitly on the parameters of the problem. Notably, in the case of CBO with anisotropic noise, this prefactor is independent of the problem dimension.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…