mlsanityData to 7 Oct 2026

Exponential Convergence Guarantees for Iterative Markovian Fitting

arXiv 2510.20871 ↗First posted 23 Oct 2025stat.ML cs.LG math.PRcited by 3

Not on the map. Why?

Abstract (arXiv)

The Schr"odinger Bridge (SB) problem has become a fundamental tool in computational optimal transport and generative modeling. To address this problem, ideal methods such as Iterative Proportional Fitting and Iterative Markovian Fitting (IMF) have been proposed-alongside practical approximations like Diffusion Schr"odinger Bridge and its Matching (DSBM) variant. While previous work have established asymptotic convergence guarantees for IMF, a quantitative, non-asymptotic understanding remains unknown. In this paper, we provide the first non-asymptotic exponential convergence guarantees for IMF under mild structural assumptions on the reference measure and marginal distributions, assuming a sufficiently large time horizon. Our results encompass two key regimes: one where the marginals are log-concave, and another where they are weakly log-concave. The analysis relies on new contraction results for the Markovian projection operator and paves the way to theoretical guarantees for DSBM.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 31 of its 56 references that are in the map. First posted on arXiv 23 Oct 2025.

Builds on

31 of 56 references.

References · 31

  1. 2020Language Models are Few-Shot Learnerscited by 32,199
  2. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  3. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  4. 2021Zero-Shot Text-to-Image Generationcited by 4,276
  5. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  6. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  7. 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
  8. 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 897
  9. 2021Diffusion Schr"odinger Bridge with Applications to Score-Based Generative Modelingcited by 594
  10. 2022GeoDiff: a Geometric Diffusion Model for Molecular Conformation Generationcited by 511
  11. 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptionscited by 440
  12. 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 286
19 more
  1. 2022Improved Analysis of Score-based Generative Modeling: User-Friendly Bounds under Minimal Smoothness Assumptionscited by 215
  2. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
  3. 2023Diffusion Schr"odinger Bridge Matchingcited by 151
  4. 2021Solving Schr"odinger Bridges via Maximum Likelihoodcited by 140
  5. 2017Large-Scale Optimal Transport and Mapping Estimationcited by 120
  6. 2023Error Bounds for Flow Matching Methodscited by 88
  7. 2023Diffusion Bridge Mixture Transports, Schr"odinger Bridge Problems and Generative Modelingcited by 80
  8. 2018Sampling Can Be Faster Than Optimizationcited by 68
  9. 2018Sharp convergence rates for Langevin dynamics in the nonconvex settingcited by 67
  10. 2023KL Convergence Guarantees for Score diffusion models under minimal data assumptionscited by 61
  11. 2025Beyond Log-Concavity and Score Regularity: Improved Convergence Bounds for Score-Based Generative Models in W2-distancecited by 27
  12. 2021Mixing Time Guarantees for Unadjusted Hamiltonian Monte Carlocited by 18
  13. 2023Projected Langevin dynamics and a gradient flow for entropic optimal transportcited by 17
  14. 2024Theoretical guarantees in KL for Diffusion Flow Matchingcited by 14
  15. 2023Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginalscited by 13
  16. 2024Adversarial Schr"odinger Bridge Matchingcited by 12
  17. 2024Efficient Sampling on Riemannian Manifolds via Langevin MCMCcited by 6
  18. 2024A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithmcited by 4
  19. 2023Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo in the nonconvex stochastic gradient casecited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.