Regime-Switching Langevin Monte Carlo Algorithms
Not on the map. Why?
Abstract (arXiv)
Langevin Monte Carlo (LMC) algorithms are popular Markov Chain Monte Carlo (MCMC) methods to sample a target probability distribution, which arises in many applications in machine learning. Inspired by regime-switching stochastic differential equations in the probability literature, we propose and study regime-switching Langevin dynamics (RS-LD) and regime-switching kinetic Langevin dynamics (RS-KLD). Based on their discretizations, we introduce regime-switching Langevin Monte Carlo (RS-LMC) and regime-switching kinetic Langevin Monte Carlo (RS-KLMC) algorithms, which can also be viewed as LMC and KLMC algorithms with random stepsizes. We also propose frictional-regime-switching kinetic Langevin dynamics (FRS-KLD) and its associated algorithm frictional-regime-switching kinetic Langevin Monte Carlo (FRS-KLMC), which can also be viewed as the KLMC algorithm with random frictional coefficients. We provide their 2-Wasserstein non-asymptotic convergence guarantees to the target distribution, and analyze the iteration complexities. Numerical experiments using both synthetic and real data are provided to illustrate the efficiency of our proposed algorithms.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 24 of its 52 references that are in the map. First posted on arXiv 31 Aug 2025.
Builds on
24 of 52 references.
References · 24
- 2015Cyclical Learning Rates for Training Neural Networkscited by 627
- 2017Snapshot Ensembles: Train 1, get M for freecited by 349
- 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 242
- 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 206
- 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
- 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 144
- 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
- 2017User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradientcited by 116
- 2017Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimizationcited by 96
- 2017Convergence of Langevin MCMC in KL-divergencecited by 86
- 2019The Randomized Midpoint Method for Log-Concave Samplingcited by 77
- 2018Sharp convergence rates for Langevin dynamics in the nonconvex settingcited by 67
12 more
- 2014Consistency and fluctuations for stochastic gradient Langevin dynamicscited by 65
- 2018On sampling from a log-concave density using kinetic Langevin diffusionscited by 61
- 2019Nonasymptotic estimates for Stochastic Gradient Langevin Dynamics under local conditions in nonconvex optimizationcited by 38
- 2018Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Non-Convex Stochastic Optimization: Non-Asymptotic Performance Bounds and Momentum-Based Accelerationcited by 31
- 2018On stochastic gradient Langevin dynamics with dependent data streams in the logconcave casecited by 20
- 2020Decentralized Stochastic Gradient Langevin Dynamics and Hamiltonian Monte Carlocited by 19
- 2019On stochastic gradient Langevin dynamics with dependent data streams: the fully non-convex casecited by 14
- 2018Breaking Reversibility Accelerates Langevin Dynamics for Global Non-Convex Optimizationcited by 12
- 2017Exploring loss function topology with cyclical learning ratescited by 11
- 2020Deep Reinforcement Learning using Cyclical Learning Ratescited by 6
- 2020Stochastic gradient descent with random learning ratecited by 4
- 2023Cyclic and Randomized Stepsizes Invoke Heavier Tails in SGD than Constant Stepsizecited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.