Hostname: page-component-6766d58669-fx4k7 Total loading time: 0 Render date: 2026-05-21T11:21:18.420Z Has data issue: false hasContentIssue false

Consensus-based optimisation with truncated noise

Published online by Cambridge University Press:  05 April 2024

Massimo Fornasier*
Affiliation:
Technical University of Munich, School of Computation, Information and Technology, Department of Mathematics, Munich, Germany Munich Center for Machine Learning, Munich, Germany Munich Data Science Institute, Garching, Germany
Peter Richtárik
Affiliation:
King Abdullah University of Science and Technology, Thuwal, Saudi Arabia KAUST AI Initiative, Thuwal, Saudi Arabia SDAIA-KAUST Center of Excellence in Data Science and Artificial Intelligence, Thuwal, Saudi Arabia
Konstantin Riedl
Affiliation:
Technical University of Munich, School of Computation, Information and Technology, Department of Mathematics, Munich, Germany Munich Center for Machine Learning, Munich, Germany
Lukang Sun
Affiliation:
King Abdullah University of Science and Technology, Thuwal, Saudi Arabia KAUST AI Initiative, Thuwal, Saudi Arabia
*
Corresponding author: Massimo Fornasier; Email: massimo.fornasier@cit.tum.de
Rights & Permissions [Opens in a new window]

Abstract

Consensus-based optimisation (CBO) is a versatile multi-particle metaheuristic optimisation method suitable for performing non-convex and non-smooth global optimisations in high dimensions. It has proven effective in various applications while at the same time being amenable to a theoretical convergence analysis. In this paper, we explore a variant of CBO, which incorporates truncated noise in order to enhance the well-behavedness of the statistics of the law of the dynamics. By introducing this additional truncation in the noise term of the CBO dynamics, we achieve that, in contrast to the original version, higher moments of the law of the particle system can be effectively bounded. As a result, our proposed variant exhibits enhanced convergence performance, allowing in particular for wider flexibility in choosing the noise parameter of the method as we confirm experimentally. By analysing the time evolution of the Wasserstein-$2$ distance between the empirical measure of the interacting particle system and the global minimiser of the objective function, we rigorously prove convergence in expectation of the proposed CBO variant requiring only minimal assumptions on the objective function and on the initialisation. Numerical evidences demonstrate the benefit of truncating the noise in CBO.

Information

Type
Papers
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press
Figure 0

Figure 1. A comparison of the success probabilities of isotropic CBO with (left phase diagrams) and without (right separate columns) truncated noise for different values of the truncation parameter $M$ and the noise level $\sigma$. (Note that standard CBO as investigated in [7, 8, 10] is retrieved when choosing $M=\infty$, $R=\infty$ and $v_b=0$ in (1)). In both settings (a) and (b), the depicted success probabilities are averaged over $100$ runs and the implemented scheme is given by an Euler–Maruyama discretisation of equation (3) with time horizon $T=50$, discrete time step size $\Delta t=0.01$, $R=\infty$, $v_b=0$, $\alpha =10^5$ and $\lambda =1$. We use $N=100$ particles, which are initialised according to $\rho _0={\mathcal{N}}((1,\dots,1),2000)$. In both figures, we plot the success probability of standard CBO (right separate column) and the CBO variant with truncated noise (left phase transition diagram) for different values of the truncation parameter $M$ and the noise level $\sigma$, when optimising the Ackley ((a)) and Rastrigin ((b)) function, respectively. We observe that truncating the noise term (by decreasing $M$) consistently allows for a wider flexibility when choosing the noise level $\sigma$ and thus increasing the likelihood of successfully locating the global minimiser.

Figure 1

Table 1. Benchmark test functions

Figure 2

Table 2. For the $15$-dimensional Ackley and Salomon function, the CBO method with truncation ($M=1$) is able to locate the global minimum using only $N=300$ particles. In comparison, even with an larger number of particles (up to $N=1200$), the original CBO method ($M=+\infty$) cannot achieve a flawless success rate. In the case of the Griewank function, the original CBO method ($M=+\infty$) exhibits a quite low success rate, even when utilising $N=1200$ particles. Contrarily, in the same setting, the CBO method with truncation ($M=1$) achieves a success rate of $0.791.$

Figure 3

Table 3. For the $15$-dimensional Rastrigin and Alpine function, both algorithms have difficulties in finding the global minimiser. However, the success rates for the CBO method with truncation ($M=1$) are significantly higher compared to those of the original CBO method ($M=+\infty.$)

Figure 4

Table 4. For the $20$-dimensional Rastrigin, Ackley and Salomon function, the original anisotropic CBO method ($M=+\infty$) works better than the anisotropic CBO method with truncation ($M=1$), in particular when the particle number $N$ is small. In the case of the Salomon function, when increasing the number of particle to $N=900$, the success rates of the original anisotropic CBO method ($M=+\infty$) decreases. In the case of the Griewank function, however, we find that the anisotropic CBO method with truncation ($M=+\infty$) works considerably better than the original anisotropic CBO method ($M=1.$)

Figure 5

Table 5. For the$15$-dimensional Alpine function, the anisotropic CBO method with truncated noise ($M=1$) works better than the original anisotropic CBO method ($M=+\infty.$)