mlsanityData to 7 Oct 2026

Improved Guarantees for Langevin Monte Carlo with Average Smoothness

arXiv 2605.31413 ↗First posted 29 May 2026math.ST cs.LG stat.THcited by 2

Not on the map. Why?

Abstract (arXiv)

We establish improved nonasymptotic bounds for Langevin Monte Carlo in the strongly log-concave setting, when the error is measured by the Wasserstein distance. The main result shows that the discretization error is governed by an average coordinate-wise smoothness constant, rather than by the usual global smoothness constant. The proof is short and probabilistic, and relies on a refined use of the synchronous coupling. We further show that the same ideas lead to improved bounds for variable step sizes, for potentials whose Laplacian is Lipschitz-continuous, and for finite-sum problems sampled by stochastic-gradient Langevin dynamics with fixed point control variates. In the Laplacian-smooth case, the usual Hessian-Lipschitz contribution is replaced by a weaker trace-type third-order smoothness quantity. In the finite-sum setting, the resulting SGLD bound improves the dependence on the root mean square smoothness of the component functions. Applications to generalized linear models with Gaussian design show that these refinements can yield substantial, dimension-dependent improvements over previously known bounds, especially for correlated covariates.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 30 of its 49 references that are in the map. First posted on arXiv 29 May 2026.

Builds on

30 of 49 references.

References · 30

  1. 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
  2. 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 242
  3. 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 224
  4. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
  5. 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
  6. 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 144
  7. 2015On the Equivalence between Kernel Quadrature Rules and Random Feature Expansionscited by 136
  8. 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
  9. 2018Analysis of Langevin Monte Carlo via convex optimizationcited by 126
  10. 2020Generalisation error in learning with random features and the hidden manifold modelcited by 126
  11. 2018Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problemcited by 123
  12. 2017User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradientcited by 116
18 more
  1. 2017Convergence of Langevin MCMC in KL-divergencecited by 86
  2. 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 83
  3. 2019The Randomized Midpoint Method for Log-Concave Samplingcited by 77
  4. 2022Improved analysis for a proximal algorithm for samplingcited by 72
  5. 2014Consistency and fluctuations for stochastic gradient Langevin dynamicscited by 65
  6. 2018On sampling from a log-concave density using kinetic Langevin diffusionscited by 61
  7. 2018The promises and pitfalls of Stochastic Gradient Langevin Dynamicscited by 56
  8. 2020Efficient constrained sampling via the mirror-Langevin algorithmcited by 55
  9. 2015Sampling from a log-concave distribution with Projected Langevin Monte Carlocited by 52
  10. 2017Sampling from a log-concave distribution with compact support with proximal Langevin Monte Carlocited by 43
  11. 2020Exponential ergodicity of mirror-Langevin diffusionscited by 37
  12. 2019High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithmcited by 36
  13. 2021The Langevin Monte Carlo algorithm in the non-smooth log-concave casecited by 26
  14. 2023Improved Discretization Analysis for Underdamped Langevin Monte Carlocited by 26
  15. 2017Control Variates for Stochastic Gradient MCMCcited by 25
  16. 2018On the Theory of Variance Reduction for Stochastic Gradient Monte Carlocited by 19
  17. 2017The True Cost of Stochastic Gradient Langevin Dynamicscited by 11
  18. 2024Parallelized Midpoint Randomization for Langevin Monte Carlocited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.