Foundations of Schr\"odinger Bridges for Generative Modeling
Abstract
At the core of modern generative modeling frameworks, including diffusion models, score-based models, and flow matching, is the task of transforming a simple prior distribution into a complex target distribution through stochastic paths in probability space. Schr\"odinger bridges provide a unifying principle underlying these approaches, framing the problem as determining an optimal stochastic bridge between marginal distribution constraints with minimal-entropy deviations from a pre-defined reference process. This guide develops the mathematical foundations of the Schr\"odinger bridge problem, drawing on optimal transport, stochastic control, and path-space optimization, and focuses on its dynamic formulation with direct connections to modern generative modeling. We build a comprehensive toolkit for constructing Schr\"odinger bridges from first principles, and show how these constructions give rise to generalized and task-specific computational methods.
Cite
@article{arxiv.2603.18992,
title = {Foundations of Schr\"odinger Bridges for Generative Modeling},
author = {Sophia Tang},
journal= {arXiv preprint arXiv:2603.18992},
year = {2026}
}
Comments
220 pages, 24 figures