English

Convergence Analysis of Schr{\"o}dinger-F{\"o}llmer Sampler without Convexity

Computation 2021-07-13 v1 Machine Learning

Abstract

Schr\"{o}dinger-F\"{o}llmer sampler (SFS) is a novel and efficient approach for sampling from possibly unnormalized distributions without ergodicity. SFS is based on the Euler-Maruyama discretization of Schr\"{o}dinger-F\"{o}llmer diffusion process dXt=U(Xt,t)dt+dBt,t[0,1],X0=0\mathrm{d} X_{t}=-\nabla U\left(X_t, t\right) \mathrm{d} t+\mathrm{d} B_{t}, \quad t \in[0,1],\quad X_0=0 on the unit interval, which transports the degenerate distribution at time zero to the target distribution at time one. In \cite{sfs21}, the consistency of SFS is established under a restricted assumption that %the drift term b(x,t)b(x,t) the potential U(x,t)U(x,t) is uniformly (on tt) strongly %concave convex (on xx). In this paper we provide a nonasymptotic error bound of SFS in Wasserstein distance under some smooth and bounded conditions on the density ratio of the target distribution over the standard normal distribution, but without requiring the strongly convexity of the potential.

Keywords

Cite

@article{arxiv.2107.04766,
  title  = {Convergence Analysis of Schr{\"o}dinger-F{\"o}llmer Sampler without Convexity},
  author = {Yuling Jiao and Lican Kang and Yanyan Liu and Youzhou Zhou},
  journal= {arXiv preprint arXiv:2107.04766},
  year   = {2021}
}

Comments

arXiv admin note: text overlap with arXiv:2106.10880