Mean-field limits for Consensus-Based Optimization and Sampling

For algorithms based on interacting particle systems that admit a mean-field description, convergence analysis is often more accessible at the mean-field level. In order to transfer convergence results obtained at the mean-field level to the finite ensemble size setting, it is desirable to show that the particle dynamics converge in an appropriate sense to the corresponding mean-field dynamics. In this paper, we prove quantitative mean-field limit results for two related interacting particle systems: Consensus-Based Optimization and Consensus-Based Sampling. Our approach requires a generalization of Sznitman’s classical argument: in order to circumvent issues related to the lack of global Lipschitz continuity of the coefficients, we discard an event of small probability, the contribution of which is controlled using moment estimates for the particle systems. In addition, we present new results on the well-posedness of the particle systems and their mean-field limit, and provide novel stability estimates for the weighted mean and the weighted covariance.

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2025-08-29
DOI
https://doi.org/10.1051/cocv/2025060/pdf
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Mean-field limits for Consensus-Based Optimization and Sampling

Springer Link (Chiba Institute of Technology)
Markov Chains and Monte Carlo Methods
article

Mean-field limits for Consensus-Based Optimization and Sampling

article en

Abstract

For algorithms based on interacting particle systems that admit a mean-field description, convergence analysis is often more accessible at the mean-field level. In order to transfer convergence results obtained at the mean-field level to the finite ensemble size setting, it is desirable to show that the particle dynamics converge in an appropriate sense to the corresponding mean-field dynamics. In this paper, we prove quantitative mean-field limit results for two related interacting particle systems: Consensus-Based Optimization and Consensus-Based Sampling. Our approach requires a generalization of Sznitman’s classical argument: in order to circumvent issues related to the lack of global Lipschitz continuity of the coefficients, we discard an event of small probability, the contribution of which is controlled using moment estimates for the particle systems. In addition, we present new results on the well-posedness of the particle systems and their mean-field limit, and provide novel stability estimates for the weighted mean and the weighted covariance.

Springer Link (Chiba Institute of Technology)
National Science Foundation, California Institute of Technology, Deutsche Forschungsgemeinschaft, Agence Nationale de la Recherche
Openalex Percentile: Top 62%
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Mean-field limits for Consensus-Based Optimization and Sampling · Springer Link (Chiba Institute of Technology) (2025) | TGRS Research Map | TGRS