Stochastic Runge-Kutta Accelerates Langevin Monte Carlo and Beyond
원문 초록
Sampling with Markov chain Monte Carlo methods often amounts to discretizing some continuous-time dynamics with numerical integration. In this paper, we establish the convergence rate of sampling algorithms obtained by discretizing smooth It\^o diffusions exhibiting fast Wasserstein-$2$ contraction, based on local deviation properties of the integration scheme. In particular, we study a sampling algorithm constructed by discretizing the overdamped Langevin diffusion with the method of stochastic Runge-Kutta. For strongly convex potentials that are smooth up to a certain order, its iterates converge to the target distribution in $2$-Wasserstein distance in $\tilde{\mathcal{O}}(d\epsilon^{-2/3})$ iterations. This improves upon the best-known rate for strongly log-concave sampling based on the overdamped Langevin equation using only the gradient oracle without adjustment. In addition, we extend our analysis of stochastic Runge-Kutta methods to uniformly dissipative diffusions with possibly non-convex potentials and show they achieve better rates compared to the Euler-Maruyama scheme in terms of the dependence on tolerance $\epsilon$. Numerical studies show that these algorithms lead to better stability and lower asymptotic errors.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
How Far Are We from Optimal Reasoning Efficiency?
A Dictionary of Closed-Form Kernel Mean Embeddings
Force-Free Molecular Dynamics Through Autoregressive Equivariant Networks
Underdamped Diffusion Bridges with Applications to Sampling
Provable Quantum Algorithm Advantage for Gaussian Process Quadrature
FNIN: A Fourier Neural Operator-based Numerical Integration Network for Surface-form-gradients
토론
이 논문과 연결된 포럼 글이 아직 없습니다.