Exponential ergodicity of mirror-Langevin diffusions
Not on the map. Why?
Abstract (arXiv)
Motivated by the problem of sampling from ill-conditioned log-concave distributions, we give a clean non-asymptotic convergence analysis of mirror-Langevin diffusions as introduced in Zhang et al. (2020). As a special case of this framework, we propose a class of diffusions called Newton-Langevin diffusions and prove that they converge to stationarity exponentially fast with a rate which not only is dimension-free, but also has no dependence on the target distribution. We give an application of this result to the problem of sampling from the uniform distribution on a convex body using a strategy inspired by interior-point methods. Our general approach follows the recent trend of linking sampling and optimization and highlights the role of the chi-squared divergence. In particular, it yields new results on the convergence of the vanilla Langevin diffusion in Wasserstein distance.
Key facts. Cited by 37 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 5; 2023: 12; 2024: 3; 2025: 6; 2026: 6.
37 papers.
Sort:
By area:
- 2023Mirror Diffusion Models for Constrained and Watermarked Generationcited by 38
- 2021The Mirror Langevin Algorithm Converges with Vanishing Biascited by 37
- 2022Sampling with Riemannian Hamiltonian Monte Carlo in a Constrained Spacecited by 28
- 2022Particle algorithms for maximum likelihood training of latent variable modelscited by 26
- 2023Sampling via Gradient Flows in the Space of Probability Measurescited by 20
- 2021The query complexity of sampling from strongly log-concave distributions in one dimensioncited by 18
- 2021Sampling with Mirrored Stein Operatorscited by 17
- 2022Convergence of Stein Variational Gradient Descent under a Weaker Smoothness Conditioncited by 16
- 2023Gradient Flows for Sampling: Mean-Field Models, Gaussian Approximations and Affine Invariancecited by 16
- 2023Optimal Preconditioning and Fisher Adaptive Langevin Samplingcited by 14
- 2023Query lower bounds for log-concave samplingcited by 12
- 2023Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithmcited by 11
25 more
- 2023Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisitedcited by 10
- 2022Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Timecited by 7
- 2022Bregman Proximal Langevin Monte Carlo via Bregman--Moreau Envelopescited by 7
- 2025Non-Reversible Langevin Algorithms for Constrained Samplingcited by 7
- 2021The entropic barrier is n-self-concordantcited by 6
- 2024Efficient Sampling on Riemannian Manifolds via Langevin MCMCcited by 6
- 2021Sampling From the Wasserstein Barycentercited by 5
- 2023Variational Principles for Mirror Descent and Mirror Langevin Dynamicscited by 5
- 2025Unleashing High-Quality Image Generation in Diffusion Sampling Using Second-Order Levenberg-Marquardt-Langevincited by 5
- 2023Mean-Square Analysis of Discretized Ito Diffusions for Heavy-tailed Samplingcited by 4
- 2025Accelerating Langevin Monte Carlo Sampling: A Large Deviations Analysiscited by 4
- 2023Efficient Multimodal Sampling via Tempered Distribution Flowcited by 3
- 2023Learning Rate Free Sampling in Constrained Domainscited by 3
- 2025Mirror Mean-Field Langevin Dynamicscited by 3
- 2025New affine invariant ensemble samplers and their dimensional scalingcited by 3
- 2024Randomized Midpoint Method for Log-Concave Sampling under Constraintscited by 2
- 2025Accelerating Constrained Sampling: A Large Deviations Approachcited by 2
- 2026Decentralized Proximal Stochastic Gradient Langevin Dynamicscited by 2
- 2026Improved Guarantees for Langevin Monte Carlo with Average Smoothnesscited by 2
- 2023Transport map unadjusted Langevin algorithms: learning and discretizing perturbed samplerscited by 1
- 2026Mirror Langevin diffusions: Convergence rates and Markov chain approximationscited by 1
- 2024Subspace Langevin Monte Carlocited by 0
- 2026Functional Stochastic Localizationcited by 0
- 2026Time-Inhomogeneous Preconditioned Langevin Dynamicscited by 0
- 2026The Crowded Embedding Space: A Mean-Field Mechanism for Emergent Marginalization in Retrieval-Augmented Agentscited by 0
- 2026Mirror Langevin diffusions: Convergence rates and Markov chain approximations24 Jul 2026
- 2026The Crowded Embedding Space: A Mean-Field Mechanism for Emergent Marginalization in Retrieval-Augmented Agents1 Jun 2026
- 2026Improved Guarantees for Langevin Monte Carlo with Average Smoothness29 May 2026
- 2026Time-Inhomogeneous Preconditioned Langevin Dynamics7 May 2026
- 2026Decentralized Proximal Stochastic Gradient Langevin Dynamics1 May 2026
- 2026Functional Stochastic Localization3 Feb 2026
- 2025Accelerating Constrained Sampling: A Large Deviations Approach9 Jun 2025
- 2025Unleashing High-Quality Image Generation in Diffusion Sampling Using Second-Order Levenberg-Marquardt-Langevin30 May 2025
- 2025New affine invariant ensemble samplers and their dimensional scaling5 May 2025
- 2025Mirror Mean-Field Langevin Dynamics5 May 2025
- 2025Accelerating Langevin Monte Carlo Sampling: A Large Deviations Analysis24 Mar 2025
- 2025Non-Reversible Langevin Algorithms for Constrained Sampling20 Jan 2025
25 more
- 2024Subspace Langevin Monte Carlo18 Dec 2024
- 2024Randomized Midpoint Method for Log-Concave Sampling under Constraints24 May 2024
- 2024Efficient Sampling on Riemannian Manifolds via Langevin MCMC15 Feb 2024
- 2023Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm14 Dec 2023
- 2023Sampling via Gradient Flows in the Space of Probability Measures5 Oct 2023
- 2023Mirror Diffusion Models for Constrained and Watermarked Generation2 Oct 2023
- 2023Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited14 Jun 2023
- 2023Learning Rate Free Sampling in Constrained Domains24 May 2023
- 2023Optimal Preconditioning and Fisher Adaptive Langevin Sampling23 May 2023
- 2023Efficient Multimodal Sampling via Tempered Distribution Flow8 Apr 2023
- 2023Query lower bounds for log-concave sampling5 Apr 2023
- 2023Variational Principles for Mirror Descent and Mirror Langevin Dynamics16 Mar 2023
- 2023Mean-Square Analysis of Discretized Ito Diffusions for Heavy-tailed Sampling1 Mar 2023
- 2023Gradient Flows for Sampling: Mean-Field Models, Gaussian Approximations and Affine Invariance21 Feb 2023
- 2023Transport map unadjusted Langevin algorithms: learning and discretizing perturbed samplers14 Feb 2023
- 2022Bregman Proximal Langevin Monte Carlo via Bregman--Moreau Envelopes10 Jul 2022
- 2022Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time5 Jul 2022
- 2022Convergence of Stein Variational Gradient Descent under a Weaker Smoothness Condition1 Jun 2022
- 2022Particle algorithms for maximum likelihood training of latent variable models27 Apr 2022
- 2022Sampling with Riemannian Hamiltonian Monte Carlo in a Constrained Space3 Feb 2022
- 2021The entropic barrier is n-self-concordant21 Dec 2021
- 2021The Mirror Langevin Algorithm Converges with Vanishing Bias24 Sep 2021
- 2021Sampling with Mirrored Stein Operators23 Jun 2021
- 2021The query complexity of sampling from strongly log-concave distributions in one dimension29 May 2021
- 2021Sampling From the Wasserstein Barycenter4 May 2021
- 2021The Mirror Langevin Algorithm Converges with Vanishing Biascited by 37
- 2022Sampling with Riemannian Hamiltonian Monte Carlo in a Constrained Spacecited by 28
- 2022Particle algorithms for maximum likelihood training of latent variable modelscited by 26
- 2023Sampling via Gradient Flows in the Space of Probability Measurescited by 20
- 2021The query complexity of sampling from strongly log-concave distributions in one dimensioncited by 18
- 2021Sampling with Mirrored Stein Operatorscited by 17
- 2022Convergence of Stein Variational Gradient Descent under a Weaker Smoothness Conditioncited by 16
- 2023Gradient Flows for Sampling: Mean-Field Models, Gaussian Approximations and Affine Invariancecited by 16
- 2023Optimal Preconditioning and Fisher Adaptive Langevin Samplingcited by 14
- 2023Query lower bounds for log-concave samplingcited by 12
- 2023Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithmcited by 11
- 2023Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisitedcited by 10
12 most cited of 34 All 34 (JSON)
- 2026Mirror Langevin diffusions: Convergence rates and Markov chain approximations24 Jul 2026
- 2026Improved Guarantees for Langevin Monte Carlo with Average Smoothness29 May 2026
- 2026Time-Inhomogeneous Preconditioned Langevin Dynamics7 May 2026
- 2026Decentralized Proximal Stochastic Gradient Langevin Dynamics1 May 2026
- 2026Functional Stochastic Localization3 Feb 2026
- 2025Accelerating Constrained Sampling: A Large Deviations Approach9 Jun 2025
- 2025New affine invariant ensemble samplers and their dimensional scaling5 May 2025
- 2025Mirror Mean-Field Langevin Dynamics5 May 2025
- 2025Accelerating Langevin Monte Carlo Sampling: A Large Deviations Analysis24 Mar 2025
- 2025Non-Reversible Langevin Algorithms for Constrained Sampling20 Jan 2025
- 2024Subspace Langevin Monte Carlo18 Dec 2024
- 2024Randomized Midpoint Method for Log-Concave Sampling under Constraints24 May 2024
12 newest of 34 All 34 (JSON)