Non-asymptotic estimates for accelerated high order Langevin Monte Carlo algorithms
Non-asymptotic estimates for accelerated high order Langevin Monte Carlo algorithms
In this paper, we propose two new algorithms, namely, aHOLA and aHOLLA, to sample from high-dimensional target distributions with possibly super-linearly growing potentials. We establish non-asymptotic convergence bounds for aHOLA in Wasserstein-1 and Wasserstein-2 distances with rates of convergence equal to $1+q/2$ and $1/2+q/4$, respectively, under a local Hölder condition with exponent $q\in(0,1]$ and a convexity at infinity condition on the potential of the target distribution. Similar results are obtained for aHOLLA under certain global continuity conditions and a dissipativity condition. Crucially, we achieve state-of-the-art rates of convergence of the proposed algorithms in the non-convex setting which are higher than those of the existing algorithms. Examples from high-dimensional sampling and logistic regression are presented, and numerical results support our main findings.
Ariel Neufeld、Ying Zhang
计算技术、计算机技术
Ariel Neufeld,Ying Zhang.Non-asymptotic estimates for accelerated high order Langevin Monte Carlo algorithms[EB/OL].(2025-08-08)[2025-08-24].https://arxiv.org/abs/2405.05679.点此复制
评论