Exponential Convergence Guarantees for Iterative Markovian Fitting
Marta Gentiloni Silveri, Giovanni Conforti, Alain Durmus
TL;DR
This work provides the first non-asymptotic exponential convergence guarantees for Iterative Markovian Fitting (IMF) in the Schrödinger Bridge problem. By proving a contraction property for the Markovian projection under mild assumptions on the reference diffusion and marginals, the authors derive explicit KL-divergence convergence rates in two regimes: strongly log-concave and weakly log-concave. The results establish quantitative finite-iteration guarantees for IMF and support theoretical analysis of related Diffusion Schrödinger Bridge Matching (DSBM). The analysis highlights a trade-off between the time horizon $T$ and marginal convexity in achieving fast convergence, and lays groundwork for future work on finite-time/discretized settings and drift-estimation errors.
Abstract
The Schrödinger 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ödinger 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.
