Hessian-Free High-Resolution Nesterov Acceleration for Sampling
Not on the map. Why?
Abstract (arXiv)
Nesterov's Accelerated Gradient (NAG) for optimization has better performance than its continuous time limit (noiseless kinetic Langevin) when a finite step-size is employed citepshi2021understanding. This work explores the sampling counterpart of this phenonemon and proposes a diffusion process, whose discretizations can yield accelerated gradient-based MCMC methods. More precisely, we reformulate the optimizer of NAG for strongly convex functions (NAG-SC) as a Hessian-Free High-Resolution ODE, change its high-resolution coefficient to a hyperparameter, inject appropriate noise, and discretize the resulting diffusion process. The acceleration effect of the new hyperparameter is quantified and it is not an artificial one created by time-rescaling. Instead, acceleration beyond underdamped Langevin in W2 distance is quantitatively established for log-strongly-concave-and-smooth targets, at both the continuous dynamics level and the discrete algorithm level. Empirical experiments in both log-strongly-concave and multi-modal cases also numerically demonstrate this acceleration.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 2; 2026: 3.
7 papers.
- 2021Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Samplingcited by 44
- 2021Sqrt(d) Dimension Dependence of Langevin Monte Carlocited by 25
- 2025LanPaint: Training-Free Diffusion Inpainting with Asymptotically Exact and Fast Conditional Samplingcited by 11
- 2025Accelerated Markov Chain Monte Carlo Algorithms on Discrete Statescited by 2
- 2026Variance Reduction for Stochastic Gradient Generalized Non-reversible Langevin Monte Carlo Algorithmscited by 2
- 2026Improved Analysis for Hessian-free High-resolution Monte Carlo Samplingcited by 1
- 2026Accelerated Regularized Wasserstein Proximal Sampling Algorithmscited by 0
- 2026Improved Analysis for Hessian-free High-resolution Monte Carlo Sampling25 Aug 2026
- 2026Variance Reduction for Stochastic Gradient Generalized Non-reversible Langevin Monte Carlo Algorithms27 Jun 2026
- 2026Accelerated Regularized Wasserstein Proximal Sampling Algorithms14 Jan 2026
- 2025Accelerated Markov Chain Monte Carlo Algorithms on Discrete States19 May 2025
- 2025LanPaint: Training-Free Diffusion Inpainting with Asymptotically Exact and Fast Conditional Sampling5 Feb 2025
- 2021Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling27 Sep 2021
- 2021Sqrt(d) Dimension Dependence of Langevin Monte Carlo8 Sep 2021