Convergence analysis of the discrete consensus-based optimization algorithm with random batch interactions and heterogeneous noises
From MaRDI portal
Publication:5104580
Abstract: We present stochastic consensus and convergence of the discrete consensus-based optimization (CBO) algorithm with random batch interactions and heterogeneous external noises. Despite the wide applications and successful performance in many practical simulations, the convergence of the discrete CBO algorithm was not rigorously investigated in such a generality. In this work, we introduce a generalized discrete CBO algorithm with a weighted representative point and random batch interactions, and show that the proposed discrete CBO algorithm exhibits stochastic consensus and convergence toward the common equilibrium state exponentially fast under suitable assumptions on system parameters. For this, we recast the given CBO algorithm with random batch interactions as a discrete consensus model with a random switching network topology, and then we use the mixing property of interactions over sufficiently long time interval to derive stochastic consensus and convergence estimates in mean square and almost sure senses. Our proposed analysis significantly improves earlier works on the convergence analysis of CBO models with full batch interactions and homogeneous external noises.
Recommendations
- Convergence and error estimates for time-discrete consensus-based optimization algorithms
- Consensus-based optimization via jump-diffusion stochastic differential equations
- Convergence of a first-order consensus-based global optimization algorithm
- Convergence toward equilibrium of the first-order consensus model with random batch interactions
- Trends in Consensus-Based Optimization
Cites work
- scientific article; zbMATH DE number 5819433 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 1480194 (Why is no real title available?)
- A consensus-based global optimization method for high dimensional machine learning problems
- A consensus-based global optimization method with adaptive momentum estimation
- A consensus-based model for global optimization and its mean-field limit
- An analytical framework for consensus-based global optimization method
- Consensus-based optimization on hypersurfaces: Well-posedness and mean-field limit
- Convergence and error estimates for time-discrete consensus-based optimization algorithms
- Convergence of a first-order consensus-based global optimization algorithm
- Emergence of stochastic flocking for the discrete Cucker-Smale model with randomly switching topologies
- On the stochastic flocking of the Cucker-Smale flock with randomly switching topologies
- Random batch methods (RBM) for interacting particle systems
- Reaching a Consensus
- Stochastic consensus dynamics for nonconvex optimization on the Stiefel manifold: mean-field limit and convergence
- Towards consensus: some convergence theorems on repeated averaging
- Vehicular traffic, crowds, and swarms: from kinetic theory and multiscale methods to applications and research perspectives
Cited in
(6)- Convergence toward equilibrium of the first-order consensus model with random batch interactions
- Stochastic flocking dynamics of the inertial spin model with state‐dependent noises
- Consensus-based optimization via jump-diffusion stochastic differential equations
- Time-discrete momentum consensus-based optimization algorithm and its application to Lyapunov function approximation
- From Herbert A. Simon’s legacy to the evolutionary artificial world with heterogeneous collective behaviors
- Convergence and error estimates for time-discrete consensus-based optimization algorithms
This page was built for publication: Convergence analysis of the discrete consensus-based optimization algorithm with random batch interactions and heterogeneous noises
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5104580)
