10 citations · 11 across the 5 of their papers we have counts for
6 papers
A continuous-time limit for particle swarm optimization
Pascal Bianchi, Radu Dragomir, Radu-Alexandru Dragomir +1
Particle swarm optimization (PSO) is a popular class of gradient-free methods for global optimization. We study a continuous-time model for momentum-free PSO with personal-best mem…
Consensus-Based Optimization Beyond Finite-Time Analysis
Pascal Bianchi, Radu-Alexandru Dragomir, Victor Priser
We analyze a zeroth-order particle algorithm for the global optimization of a non-convex function, focusing on a variant of Consensus-Based Optimization (CBO) with small but fixed…
Stochastic mirror descent for nonparametric adaptive importance sampling
Pascal Bianchi, Bernard Delyon, Victor Priser +1
This paper addresses the problem of approximating an unknown probability distribution with density -- which can only be evaluated up to an unknown scaling factor -- with the he…
Long-time asymptotics of noisy SVGD outside the population limit
Victor Priser, Pascal Bianchi, Adil Salim
Stein Variational Gradient Descent (SVGD) is a widely used sampling algorithm that has been successfully applied in several areas of Machine Learning. SVGD operates by iteratively…
Long run convergence of discrete-time interacting particle systems of the McKean-Vlasov type
Pascal Bianchi, Walid Hachem, Victor Priser
We consider a discrete-time system of n coupled random vectors, a.k.a. interacting particles. The dynamics involve a vanishing step size, some random centered perturbations, and a…
Stochastic optimization with momentum: convergence, fluctuations, and traps avoidance
A. Barakat, P. Bianchi, W. Hachem +1
In this paper, a general stochastic optimization procedure is studied, unifying several variants of the stochastic gradient descent such as, among others, the stochastic heavy ball…