arXiv Statistics ML
Muon meets Tamed Langevin: Momentum Preconditioning beyond Convex and gradient-Lipschitz Potentials
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Jun 17
Randomized Midpoint Method for Log-Concave Sampling under Constraints
arXiv:2405. 15379v3 Announce Type: replace-cross Abstract: In this paper, we study the problem of sampling from log-concave distributions supported on convex and compact sets, with a particular focus on the randomized midpoint discretization of both overdamped and kinetic Langevin diffusions in constrained domains.
Hugging Face Trending Papers
Aug 6
The Tamed Subgradient Unadjusted Langevin Algorithm beyond Convexity
We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex. We introduce the Subgradient Tamed Unadjusted Langevin Algorithm (SG-TULA), a discretisation of the Langevin diffusion that operates directly on subgradients, without relying on computationally demanding smoothing procedures.
arXiv Machine Learning
Aug 7
The Tamed Subgradient Unadjusted Langevin Algorithm beyond Convexity
arXiv:2608. 06283v1 Announce Type: new Abstract: We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex.
arXiv Machine Learning
Sep 17
R\'enyi Tracking Bounds for Langevin Dynamics with Moving Targets
arXiv:2609. 17577v1 Announce Type: cross Abstract: We study Langevin diffusion and Langevin Monte Carlo (LMC) when the target distribution changes over time.
arXiv Machine Learning
Aug 27
Improved Analysis for Hessian-free High-resolution Monte Carlo Sampling
The paper introduces Hessian-free high-resolution (HFHR) dynamics, an extension of underdamped Langevin dynamics that incorporates reversible position diffusion for sampling in machine learning. It provides an explicit quantitative contraction rate under a position Poincaré inequality, weighted Hessian and Laplacian bounds, and a compact Sobolev embedding, even when the potential is non‑convex. For the HFHR Monte Carlo algorithm, a path‑space Girsanov argument yields a non‑asymptotic convergence bound and an explicit iteration complexity in total variation distance, improving on previous HFHR results and demonstrating benefits of a positive diffusion parameter through numerical experiments.
arXiv Machine Learning
Jul 9
Gradient-free Riemannian Langevin Sampler
arXiv:2607. 07519v1 Announce Type: new Abstract: We address the problem of efficiently sampling multimodal probability distributions, where standard Markov Chain Monte Carlo methods often suffer from poor mixing and mode trapping.