Exponential Convergence Guarantees for Iterative Markovian Fitting
By: Marta Gentiloni Silveri, Giovanni Conforti, Alain Durmus
Potential Business Impact:
Makes computer models learn faster and better.
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.
Similar Papers
Exponential convergence rate for Iterative Markovian Fitting
Information Theory
Makes computer learning faster and more reliable.
Exponential convergence rate for Iterative Markovian Fitting
Information Theory
Makes computer learning faster and more reliable.
Multi-Marginal Schrödinger Bridge Matching
Machine Learning (Stat)
Tracks how things change over time.