SearcharxivSearch

arXiv · 2605.20697

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

Abstract

We study second-order Consensus-Based Optimization (CBO), a derivative-free global optimization algorithm in which the consensus force and the multiplicative exploratory noise act on particle velocities. We prove quantitative uniform-in-time propagation of chaos for the unmodified second-order CBO dynamics, together with an almost uniform-in-time stability estimate for the microscopic particle system. The proof is not a direct adaptation of the first-order CBO argument. Although both first- and second-order CBO have multiplicative noise that degenerates near consensus and a shift-invariant weighted interaction, the kinetic model has an additional structural obstruction: the consensus mechanism and the stochastic forcing act only on the velocity variable, while the position variable evolves by transport. Thus spatial concentration has to be recovered indirectly through velocity dissipation. Moreover, the shift-invariant interaction leaves a translation mode that is not directly damped by the consensus force, so a standard synchronous coupling in the Euclidean phase-space distance does not close uniformly in time. The main idea of the paper is to introduce shifted internal variables that separate the contracting fluctuation modes from the undamped translation mode. In these variables we build a Lyapunov functional with a position-velocity cross term and prove exponential decay of centered moments. This decay is the mechanism that makes the time-dependent coupling coefficient integrable. Combining it with uniform-in-time raw moment bounds, concentration inequalities, stability estimates for the weighted mean, and a Monte Carlo estimate, we obtain the classical Monte Carlo rate for propagation of chaos uniformly in time. The system-to-system stability estimate avoids the sampling error and yields the faster rate \(O(J^{-q})\).

Explore related subjects

Keep this discovery

BibTeXRIS

Seung-Yeal Ha, Franca Hoffmann, Dohyeon Kim. 2026-05-20. Uniform-in-time propagation of chaos for Second-Order Consensus-Based Optimization. https://arxiv.org/abs/2605.20697

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR