Consensus-based Optimization on the Sphere II: Convergence to Global Minimizers and Machine Learning

by   Massimo Fornasier, et al.

We present the implementation of a new stochastic Kuramoto-Vicsek-type model for global optimization of nonconvex functions on the sphere. This model belongs to the class of Consensus-Based Optimization. In fact, particles move on the sphere driven by a drift towards an instantaneous consensus point, which is computed as a convex combination of particle locations, weighted by the cost function according to Laplace's principle, and it represents an approximation to a global minimizer. The dynamics is further perturbed by a random vector field to favor exploration, whose variance is a function of the distance of the particles to the consensus point. In particular, as soon as the consensus is reached the stochastic component vanishes. The main results of this paper are about the proof of convergence of the numerical scheme to global minimizers provided conditions of well-preparation of the initial datum. The proof combines previous results of mean-field limit with a novel asymptotic analysis, and classical convergence results of numerical methods for SDE. We present several numerical experiments, which show that the algorithm proposed in the present paper scales well with the dimension and is extremely versatile. To quantify the performances of the new approach, we show that the algorithm is able to perform essentially as good as ad hoc state of the art methods in challenging problems in signal processing and machine learning, namely the phase retrieval problem and the robust subspace detection.


page 5

page 12

page 24


Consensus-Based Optimization on the Sphere I: Well-Posedness and Mean-Field Limit

We introduce a new stochastic Kuramoto-Vicsek-type model for global opti...

Mean-field particle swarm optimization

In this work we survey some recent results on the global minimization of...

Optimization on the Surface of the (Hyper)-Sphere

Thomson problem is a classical problem in physics to study how n number ...

Consensus-Based Optimization for Saddle Point Problems

In this paper, we propose consensus-based optimization for saddle point ...

Polarized consensus-based dynamics for optimization and sampling

In this paper we propose polarized consensus-based dynamics in order to ...

FedCBO: Reaching Group Consensus in Clustered Federated Learning through Consensus-based Optimization

Federated learning is an important framework in modern machine learning ...

Please sign up or login with your details

Forgot password? Click here to reset