Global Optimization via Schr"odinger-F"ollmer Diffusion
Not on the map. Why?
Abstract (arXiv)
We study the problem of finding global minimizers of V(x):ℝdrightarrowℝ approximately via sampling from a probability distribution μσ with density pσ(x)=dfracexp(-V(x)/σ)intmathbb Rd exp(-V(y)/σ) dy with respect to the Lebesgue measure for σ ∈ (0,1] small enough. We analyze a sampler based on the Euler-Maruyama discretization of the Schr"odinger-F"ollmer diffusion processes with stochastic approximation under appropriate assumptions on the step size s and the potential V. We prove that the output of the proposed sampler is an approximate global minimizer of V(x) with high probability at cost of sampling O(d3) standard normal random variables. Numerical studies illustrate the effectiveness of the proposed method and its superiority to the Langevin method.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Oct 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 1.
4 papers.
- 2023Noise-Free Sampling Algorithms via Regularized Wasserstein Proximalscited by 7
- 2025Path Integral Optimiser: Global Optimisation via Neural Schr"odinger-F"ollmer Diffusioncited by 1
- 2024Gradient-Free Score-Based Sampling Methods with Ensemblescited by 0
- 2026Connections between the F"ollmer process and the denoising diffusion probabilistic modelcited by 0
- 2026Connections between the F"ollmer process and the denoising diffusion probabilistic model18 May 2026
- 2025Path Integral Optimiser: Global Optimisation via Neural Schr"odinger-F"ollmer Diffusion7 Jun 2025
- 2024Gradient-Free Score-Based Sampling Methods with Ensembles31 Jan 2024
- 2023Noise-Free Sampling Algorithms via Regularized Wasserstein Proximals28 Aug 2023