mlsanityData to 7 Oct 2026

Wasserstein Control of Mirror Langevin Monte Carlo

arXiv 2002.04363 ↗First posted 11 Feb 2020math.ST cs.LG math.PRcited by 55

Not on the map. Why?

Abstract (arXiv)

Discretized Langevin diffusions are efficient Monte Carlo methods for sampling from high dimensional target densities that are log-Lipschitz-smooth and (strongly) log-concave. In particular, the Euclidean Langevin Monte Carlo sampling algorithm has received much attention lately, leading to a detailed understanding of its non-asymptotic convergence properties and of the role that smoothness and log-concavity play in the convergence rate. Distributions that do not possess these regularity properties can be addressed by considering a Riemannian Langevin diffusion with a metric capturing the local geometry of the log-density. However, the Monte Carlo algorithms derived from discretizations of such Riemannian Langevin diffusions are notoriously difficult to analyze. In this paper, we consider Langevin diffusions on a Hessian-type manifold and study a discretization that is closely related to the mirror-descent scheme. We establish for the first time a non-asymptotic upper-bound on the sampling error of the resulting Hessian Riemannian Langevin Monte Carlo algorithm. This bound is measured according to a Wasserstein distance induced by a Riemannian metric ground cost capturing the Hessian structure and closely related to a self-concordance-like condition. The upper-bound implies, for instance, that the iterates contract toward a Wasserstein ball around the target density whose radius is made explicit. Our theory recovers existing Euclidean results and can cope with a wide variety of Hessian metrics related to highly non-flat geometries.

Key facts. Cited by 55 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 12; 2023: 14; 2024: 10; 2025: 9; 2026: 5.

55 papers.

Sort:

By area:

  1. 2022Improved analysis for a proximal algorithm for samplingcited by 72
  2. 2021Low-Rank Sinkhorn Factorizationcited by 66
  3. 2021Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costscited by 61
  4. 2023Mirror Diffusion Models for Constrained and Watermarked Generationcited by 38
  5. 2021The Mirror Langevin Algorithm Converges with Vanishing Biascited by 37
  6. 2022Particle algorithms for maximum likelihood training of latent variable modelscited by 26
  7. 2022Convergence of the Riemannian Langevin Algorithmcited by 23
  8. 2022Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Samplingcited by 21
  9. 2023Sampling via Gradient Flows in the Space of Probability Measurescited by 20
  10. 2024In-and-Out: Algorithmic Diffusion for Sampling Convex Bodiescited by 18
  11. 2021Sampling with Mirrored Stein Operatorscited by 17
  12. 2022Sampling with Mollified Interaction Energy Descentcited by 17
38 more
  1. 2023Gradient Flows for Sampling: Mean-Field Models, Gaussian Approximations and Affine Invariancecited by 16
  2. 2022Private Convex Optimization in General Normscited by 13
  3. 2023Query lower bounds for log-concave samplingcited by 12
  4. 2023Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithmcited by 11
  5. 2022Condition-number-independent convergence rate of Riemannian Hamiltonian Monte Carlo with numerical integratorscited by 10
  6. 2024Constrained Sampling with Primal-Dual Langevin Monte Carlocited by 10
  7. 2023Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Samplercited by 9
  8. 2024Quantum State Generation with Structure-Preserving Diffusion Modelcited by 8
  9. 2022Bregman Proximal Langevin Monte Carlo via Bregman--Moreau Envelopescited by 7
  10. 2025Non-Reversible Langevin Algorithms for Constrained Samplingcited by 7
  11. 2022Constrained Langevin Algorithms with L-mixing External Random Variablescited by 6
  12. 2024Efficient Sampling on Riemannian Manifolds via Langevin MCMCcited by 6
  13. 2021Sensing Cox Processes via Posterior Sampling and Positive Basescited by 4
  14. 2022A Note on the Convergence of Mirrored Stein Variational Gradient Descent under (L0,L1)-Smoothness Conditioncited by 4
  15. 2023Mean-Square Analysis of Discretized Ito Diffusions for Heavy-tailed Samplingcited by 4
  16. 2023Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithmscited by 4
  17. 2022Convergence Error Analysis of Reflected Gradient Langevin Dynamics for Globally Optimizing Non-Convex Constrained Problemscited by 3
  18. 2023Learning Rate Free Sampling in Constrained Domainscited by 3
  19. 2024Generative Modelling with Tensor Train approximations of Hamilton--Jacobi--Bellman equationscited by 3
  20. 2024R'enyi-infinity constrained sampling with d3 membership queriescited by 3
  21. 2025Mirror Mean-Field Langevin Dynamicscited by 3
  22. 2025Oracle-based Uniform Sampling from Convex Bodiescited by 3
  23. 2022A Dynamical System View of Langevin-Based Non-Convex Samplingcited by 2
  24. 2023Drift Control of High-Dimensional RBM: A Computational Method Based on Neural Networkscited by 2
  25. 2023Approximating Langevin Monte Carlo with ResNet-like Neural Network architecturescited by 2
  26. 2024Randomized Midpoint Method for Log-Concave Sampling under Constraintscited by 2
  27. 2025Efficient Bayesian Computation Using Plug-and-Play Priors for Poisson Inverse Problemscited by 2
  28. 2025Accelerating Constrained Sampling: A Large Deviations Approachcited by 2
  29. 2026Decentralized Proximal Stochastic Gradient Langevin Dynamicscited by 2
  30. 2023Improved Langevin Monte Carlo for stochastic optimization via landscape modificationcited by 1
  31. 2023Transport map unadjusted Langevin algorithms: learning and discretizing perturbed samplerscited by 1
  32. 2026Mirror Langevin diffusions: Convergence rates and Markov chain approximationscited by 1
  33. 2023Accelerating Convergence in Global Non-Convex Optimization with Reversible Diffusioncited by 0
  34. 2024Families of costs with zero and nonnegative MTW tensor in optimal transport and the c-divergencescited by 0
  35. 2024Functional Gradient Flows for Constrained Samplingcited by 0
  36. 2024Subspace Langevin Monte Carlocited by 0
  37. 2025Langevin Multiplicative Weights Update with Applications in Polynomial Portfolio Managementcited by 0
  38. 2025Fast Gaussian Processes under Monotonicity Constraintscited by 0

50 most cited of 55 All 55 (JSON)