Stein Boltzmann Sampling: A Variational Approach for Global Optimization
Not on the map. Why?
Abstract (arXiv)
In this paper, we present a flow-based method for global optimization of continuous Sobolev functions, called Stein Boltzmann Sampling (SBS). SBS initializes uniformly a number of particles representing candidate solutions, then uses the Stein Variational Gradient Descent (SVGD) algorithm to sequentially and deterministically move those particles in order to approximate a target distribution whose mass is concentrated around promising areas of the domain of the optimized function. The target is chosen to be a properly parametrized Boltzmann distribution. For the purpose of global optimization, we adapt the generic SVGD theoretical framework allowing to address more general target distributions over a compact subset of ℝd, and we prove SBS's asymptotic convergence. In addition to the main SBS algorithm, we present two variants: the SBS-PF that includes a particle filtering strategy, and the SBS-HYBRID one that uses SBS or SBS-PF as a continuation after other particle- or distribution-based optimization methods. A detailed comparison with state-of-the-art methods on benchmark functions demonstrates that SBS and its variants are highly competitive, while the combination of the two variants provides the best trade-off between accuracy and computational cost.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 18 of its 41 references that are in the map. First posted on arXiv 7 Feb 2024.
Builds on
18 of 41 references.
References · 18
- 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
- 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 242
- 2016A Kernelized Stein Discrepancy for Goodness-of-fit Tests and Model Evaluationcited by 236
- 2017Stein Variational Gradient Descent as Gradient Flowcited by 149
- 2019The Lean mathematical librarycited by 127
- 2015Measuring Sample Quality with Stein's Methodcited by 94
- 2019On the geometry of Stein variational gradient descentcited by 82
- 2020A Non-Asymptotic Analysis for Stein Variational Gradient Descentcited by 61
- 2021Kernel Stein Discrepancy Descentcited by 57
- 2018Global Non-convex Optimization with Discretized Diffusionscited by 44
- 2017Global optimization of Lipschitz functionscited by 39
- 2021A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensionscited by 37
6 more
- 2018Scaling limit of the Stein variational gradient descent: the mean field regimecited by 35
- 2020Finding Global Minima via Kernel Approximationscited by 23
- 2014BayesOpt: A Bayesian Optimization Library for Nonlinear Optimization, Experimental Design and Banditscited by 18
- 2022Convergence of Stein Variational Gradient Descent under a Weaker Smoothness Conditioncited by 16
- 2021On quantitative Laplace-type convergence results for some exponential probability measures, with two applicationscited by 5
- 2018Minima distribution for global optimizationcited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.