mlsanityData to 14 Oct 2026

Projected Langevin dynamics and a gradient flow for entropic optimal transport

arXiv 2309.08598 ↗First posted 15 Sep 2023math.PR math.AP stat.MLcited by 17

Not on the map. Why?

Abstract (arXiv)

The classical (overdamped) Langevin dynamics provide a natural algorithm for sampling from its invariant measure, which uniquely minimizes an energy functional over the space of probability measures, and which concentrates around the minimizer(s) of the associated potential when the noise parameter is small. We introduce analogous diffusion dynamics that sample from an entropy-regularized optimal transport, which uniquely minimizes the same energy functional but constrained to the set Pi(μ,nu) of couplings of two given marginal probability measures μ and nu on ℝd, and which concentrates around the optimal transport coupling(s) for small regularization parameter. More specifically, our process satisfies two key properties: First, the law of the solution at each time stays in Pi(μ,nu) if it is initialized there. Second, the long-time limit is the unique solution of an entropic optimal transport problem. In addition, we show by means of a new log-Sobolev-type inequality that the convergence holds exponentially fast, for sufficiently large regularization parameter and for a class of marginals which strictly includes all strongly log-concave measures. By studying the induced Wasserstein geometry of the submanifold Pi(μ,nu), we argue that the SDE can be viewed as a Wasserstein gradient flow on this space of couplings, at least when d=1, and we identify a conjectural gradient flow for d ≥ 2. The main technical difficulties stems from the appearance of conditional expectation terms which serve to constrain the dynamics to Pi(μ,nu).

Key facts. Cited by 17 papers in the map (data through 14 Oct 2026). Builds on 7 of its 61 references that are in the map. First posted on arXiv 15 Sep 2023.

Builds on

7 of 61 references.

References · 7

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 292
  3. 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
  4. 2022Variational inference via Wasserstein gradient flowscited by 85
  5. 2014Multi-marginal optimal transport: theory and applicationscited by 41
  6. 2023Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginalscited by 13
  7. 2019A proof of the Caffarelli contraction theorem via entropic regularizationcited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 9; 2026: 3.

17 papers.

Sort:

By area:

  1. 2025Beyond Log-Concavity and Score Regularity: Improved Convergence Bounds for Score-Based Generative Models in W2-distancecited by 29
  2. 2025Wasserstein Convergence of Score-based Generative Models under Semiconvexity and Discontinuous Gradientscited by 15
  3. 2023Independent projections of diffusions: Gradient flows for variational inference and optimal mean field approximationscited by 12
  4. 2024Wasserstein Bounds for generative diffusion models with Gaussian tail targetscited by 10
  5. 2025Non-asymptotic error bounds for probability flow ODEs under weak log-concavitycited by 7
  6. 2025Sublinear iterations can suffice even for DDPMscited by 7
  7. 2024A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithmcited by 4
  8. 2025Pathway to O(√d) Complexity bound under Wasserstein metric of flow-based modelscited by 4
  9. 2025Exponential Convergence Guarantees for Iterative Markovian Fittingcited by 3
  10. 2024Optimal Transportation by Orthogonal Coupling Dynamicscited by 2
  11. 2026Wasserstein bounds for denoising diffusion probabilistic models via the F"ollmer processcited by 2
  12. 2025Stability of the Kim--Milman flow mapcited by 1
5 more
  1. 2024Collision-based Dynamics for Multi-Marginal Optimal Transportcited by 0
  2. 2025Designing Algorithms for Entropic Optimal Transport from an Optimisation Perspectivecited by 0
  3. 2025Thermodynamic structure of the Sinkhorn flowcited by 0
  4. 2026Diffusion Flow Matching: Dimension-Improved KL Bounds and Wasserstein Guaranteescited by 0
  5. 2026Near-Lipschitz stability of the Kim--Milman flow mapcited by 0