mlsanityData to 7 Oct 2026

Muon meets Tamed Langevin: Momentum Preconditioning beyond Convex and gradient-Lipschitz Potentials

arXiv 2610.02158 ↗First posted 1 Oct 2026cs.LG math.OC math.PRcited by 0

Not on the map. Why?

Abstract (arXiv)

We consider the problem of sampling from Gibbs distributions on matrix spaces whose potential energies are neither convex nor globally gradient-Lipschitz. We introduce a family of non-quadratic kinetic energies that lead to a new underdamped Langevin system with momentum preconditioning, in which the gradient of the kinetic energy acts as a smooth spectral taming of the momentum. We prove that, under these relaxed assumptions on the potential, the resulting dynamics leaves the target Gibbs measure invariant, and we establish exponential convergence to equilibrium in a weighted total variation distance. Finally, we show that the corresponding Euler-Maruyama discretization admits moment bounds that are uniform in time, without any modification of the potential gradient, which ensures the stability of the resulting sampling algorithm.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 29 of its 53 references that are in the map. First posted on arXiv 1 Oct 2026.

Builds on

29 of 53 references.

References · 29

  1. 2025Kimi K2: Open Agentic Intelligencecited by 523
  2. 2025Muon is Scalable for LLM Trainingcited by 381
  3. 2021What Are Bayesian Neural Network Posteriors Really Like?cited by 307
  4. 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 242
  5. 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 206
  6. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
  7. 2025Training Deep Learning Models with Norm-Constrained LMOscited by 177
  8. 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
  9. 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
  10. 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 83
  11. 2025Practical Efficiency of Muon for Pretrainingcited by 74
  12. 2018Sampling Can Be Faster Than Optimizationcited by 68
17 more
  1. 2017The Tamed Unadjusted Langevin Algorithmcited by 31
  2. 2021The Langevin Monte Carlo algorithm in the non-smooth log-concave casecited by 26
  3. 2023Kinetic Langevin MCMC Sampling Without Gradient Lipschitz Continuity -- the Strongly Convex Casecited by 12
  4. 2021Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networkscited by 11
  5. 2023Subgradient Langevin Methods for Sampling from Non-smooth Potentialscited by 11
  6. 2026HTMuon: Improving Muon via Heavy-Tailed Spectral Correctioncited by 11
  7. 2022Non-asymptotic convergence bounds for modified tamed unadjusted Langevin algorithm in non-convex settingcited by 10
  8. 2026Delving into Muon and Beyond: Deep Analysis and Extensionscited by 9
  9. 2026Muon Does Not Converge on Convex Lipschitz Functionscited by 9
  10. 2023Fractal Landscapes in Policy Optimizationcited by 8
  11. 2025The Performance Of The Unadjusted Langevin Algorithm Without Smoothness Assumptionscited by 4
  12. 2026Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizercited by 3
  13. 2026Softsign: Smooth Sign in Your Optimizer For Better Parameter Heterogeneity Handlingcited by 3
  14. 2026On MUON optimization: From non-convergence to an error analysis with Polar Express and the Newton-Schulz polynomial from implementationscited by 3
  15. 2026Spectral Scaling Laws of Muoncited by 2
  16. 2026The Tamed Subgradient Unadjusted Langevin Algorithm beyond Convexitycited by 1
  17. 2026Musec: MomentUm SpEctral Clipping for Stable Muon-type Trainingcited by 1

Built on by

Not cited yet.