Well-posedness and mean-field limit estimate of a consensus-based algorithm for min-max problems
Hui Huang, Jethro Warnett
TL;DR
This work rigorously extends a derivative-free consensus-based optimization method to min-max problems by proving well-posedness for both finite-particle and mean-field dynamics and by providing a quantitative mean-field limit with explicit rate as the number of particles grows. The authors address challenges from agent-dependent consensus and coupled measures, employing a combination of stochastic Lyapunov techniques, Leray–Schauder fixed-point theory, and coupling arguments to obtain rates depending on moment and growth parameters. The results yield explicit convergence guarantees and a Monte-Carlo rate under suitable moment assumptions, strengthening the theoretical foundation of consensus-based methods for global min-max solutions. This advances the theoretical understanding and paves the way for robust large-scale implementations in settings with multiple interacting distributions.
Abstract
The recent work arXiv:2407.17373 proposes a derivative-free consensus-based particle method that computes global solutions to nonconvex-nonconcave min-max problems and establishes global exponential convergence in the sense of the mean-field law. This paper aims to address the theoretical gaps in arXiv:2407.17373, specifically by providing a quantitative estimate of the mean-field limit with respect to the number of particles, as well as establishing the well-posedness of both the finite particle model and the corresponding mean-field dynamics.
