mlsanityData to 14 Oct 2026

RELTA-SGLD: Relative-Growth Localized Taming for Nonconvex Stochastic-Gradient Langevin Learning

arXiv 2607.19544 ↗First posted 21 Jul 2026stat.ML cs.LG math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce RELTA-SGLD, a taming scheme that stabilizes superlinear stochastic-gradient updates while reducing unnecessary suppression of the original learning drift. A threshold determines where the taming turns on, while a relative-growth principle derived from the one-step Lyapunov stability condition determines the required taming strength. Together, they produce a lighter λ-scale denominator and preserve a nonvanishing far-tail return. As a consequence, we prove polynomial moment stability and first-order stationary accuracy in both W1 and W2 for nonconvex SGLD with superlinearly growing stochastic-gradient oracles, improving the corresponding half-order and quarter-order bounds for comparable stochastic-gradient tamed schemes. On Fashion-MNIST under active stabilization pressure, RELTA improves the mean learning metrics over both untamed SGLD and TUSLA and remains competitive with a tuned AdamW reference. In an ordinary-training regime, its lighter localized denominator reduces unnecessary perturbation of the original update and maintains nearly untamed learning dynamics.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 26 references that are in the map. First posted on arXiv 21 Jul 2026.

Builds on

14 of 26 references.

References · 14

  1. 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 243
  2. 2017Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimizationcited by 97
  3. 2017The Tamed Unadjusted Langevin Algorithmcited by 31
  4. 2020Taming neural networks with TUSLA: Non-convex learning via adaptive stochastic gradient Langevin algorithmscited by 21
  5. 2021Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networkscited by 11
  6. 2021Non-asymptotic estimates for TUSLA algorithm for non-convex learning with applications to neural networks with ReLU activation functioncited by 10
  7. 2022Non-asymptotic convergence bounds for modified tamed unadjusted Langevin algorithm in non-convex settingcited by 10
  8. 2023Taming under isoperimetrycited by 7
  9. 2024Tamed Langevin sampling under weaker conditionscited by 7
  10. 2022Langevin dynamics based algorithm e-THvarepsilonO POULA for stochastic optimization problems with discontinuous stochastic gradientcited by 5
  11. 2025kTULA: A Langevin sampling algorithm with improved KL bounds under super-linear log-gradientscited by 3
  12. 2026Error estimates for tamed Euler and Randomized Euler schemes for SDEs with locally Lipschitz drift with applications to non-logconcave sampling and optimizationcited by 2
2 more
  1. 2026Deterministic Envelopes for Tamed SGLD: Decoupling Stochastic Gradient Noise and Localizing Tamingcited by 2
  2. 2026Deterministic Denominator Design for Localized Tamed Stochastic Gradient Langevin Dynamicscited by 1

Built on by

Not cited yet.