Pith. sign in

REVIEW 1 cited by

Global Optimization via Schr{\"o}dinger-F{\"o}llmer Diffusion

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.00402 v6 pith:ET2A5DQE submitted 2021-10-31 math.OC

classification math.OC
keywords sigmaglobalmathbbdiffusiondinger-fllmermethodprobability
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study the problem of finding global minimizers of $V(x):\mathbb{R}^d\rightarrow\mathbb{R}$ approximately via sampling from a probability distribution $\mu_{\sigma}$ with density $p_{\sigma}(x)=\dfrac{\exp(-V(x)/\sigma)}{\int_{\mathbb R^d} \exp(-V(y)/\sigma) dy }$ with respect to the Lebesgue measure for $\sigma \in (0,1]$ small enough. We analyze a sampler based on the Euler-Maruyama discretization of the Schr{\"o}dinger-F{\"o}llmer 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 $\mathcal{O}(d^{3})$ standard normal random variables. Numerical studies illustrate the effectiveness of the proposed method and its superiority to the Langevin method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Path Integral Optimiser: Global Optimisation via Neural Schr\"odinger-F\"ollmer Diffusion

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A neural Schrödinger-Föllmer diffusion, trained like the Path Integral Sampler, is repurposed as a global optimizer, with new conditional convergence bounds and competitive results on small tasks only.

Pith tools