mlsanityData to 14 Oct 2026

Variance Reduction for Stochastic Gradient Generalized Non-reversible Langevin Monte Carlo Algorithms

arXiv 2606.28808 ↗First posted 27 Jun 2026stat.ML cs.LG math.PRcited by 2

Not on the map. Why?

Abstract (arXiv)

We study the leading-order fluctuation of stochastic gradient Euler-Maruyama estimators for generalized non-reversible Langevin dynamics. Under structural assumptions tailored to the small-stepsize central limit theorem and under an unbiased stochastic gradient oracle, we prove that the empirical average over a horizon of order the inverse squared stepsize satisfies a central limit theorem in the vanishing-stepsize regime. The limiting variance is characterized through the Poisson equation of the limiting full-gradient diffusion. We then rewrite this constant in an operator form that links it to the continuous-time asymptotic variance and, under standard operator-theoretic assumptions, derive a sufficient condition under which an anti-symmetric perturbation strictly reduces the leading-order fluctuation constant relative to the reversible baseline. We also identify bounded smooth predictive observables that re directly covered by the main theorem. As a separate Gaussian calculation beyond the bounded-test-function regime, we obtain closed-form formulas for quadratic Hamiltonians and linear observables. The framework covers non-reversible Langevin dynamics and augmented-state examples including Hessian-free high-resolution dynamics and a positive-definite subclass of gradient-adjusted underdamped Langevin dynamics that allow stochastic gradients. Numerical experiments on basic examples and Bayesian linear regression using synthetic data, and Bayesian logistic regression using real data support the predicted Gaussian fluctuations and show that the non-reversible schemes consistently reduce the root mean squared error (RMSE) relative to their reversible baselines.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 26 of its 56 references that are in the map. First posted on arXiv 27 Jun 2026.

Builds on

26 of 56 references.

References · 26

  1. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  2. 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 243
  3. 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 208
  4. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 197
  5. 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
  6. 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 146
  7. 2017User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradientcited by 116
  8. 2017Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimizationcited by 97
  9. 2017Convergence of Langevin MCMC in KL-divergencecited by 88
  10. 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 84
  11. 2014Consistency and fluctuations for stochastic gradient Langevin dynamicscited by 65
  12. 2020Convergence of Langevin Monte Carlo in Chi-Squared and Renyi Divergencecited by 42
14 more
  1. 2018Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Non-Convex Stochastic Optimization: Non-Asymptotic Performance Bounds and Momentum-Based Accelerationcited by 31
  2. 2020Decentralized Stochastic Gradient Langevin Dynamics and Hamiltonian Monte Carlocited by 19
  3. 2018Breaking Reversibility Accelerates Langevin Dynamics for Global Non-Convex Optimizationcited by 12
  4. 2022Excess Risk of Two-Layer ReLU Neural Networks in Teacher-Student Settings and its Superiority to Kernel Methodscited by 10
  5. 2024Generalized EXTRA stochastic gradient Langevin dynamicscited by 9
  6. 2016Improving the convergence of reversible samplerscited by 8
  7. 2020Hessian-Free High-Resolution Nesterov Acceleration for Samplingcited by 7
  8. 2025Non-Reversible Langevin Algorithms for Constrained Samplingcited by 7
  9. 2020Non-Convex Optimization via Non-Reversible Stochastic Gradient Langevin Dynamicscited by 6
  10. 2024Gradient-adjusted underdamped Langevin dynamics for samplingcited by 5
  11. 2025DIGing--SGLD: Decentralized and Scalable Langevin Sampling over Time--Varying Networkscited by 4
  12. 2025Regime-Switching Langevin Monte Carlo Algorithmscited by 3
  13. 2026Sampling non-log-concave densities via Hessian-free high-resolution dynamicscited by 3
  14. 2025Accelerating Constrained Sampling: A Large Deviations Approachcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.