Related papers: Schr\"odinger bridge with transport relaxation
This paper exploit the equivalence between the Schr\"odinger Bridge problem and the entropy penalized optimal transport in order to find a different approach to the duality, in the spirit of optimal transport. This approach results in a…
This paper introduces a dynamic formulation of divergence-regularized optimal transport with weak targets on the path space. In our formulation, the classical relative entropy penalty is replaced by a general convex divergence, and terminal…
We study the Schr\"odinger bridge problem when the endpoint distributions are available only through samples. Classical computational approaches estimate Schr\"odinger potentials via Sinkhorn iterations on empirical measures and then…
The purpose of the present work is to expand substantially the type of control and estimation problems that can be addressed following the paradigm of Schr\"odinger bridges, by incorporating termination (killing) of stochastic flows.…
Generative AI can be framed as the problem of learning a model that maps simple reference measures into complex data distributions, and it has recently found a strong connection to the classical theory of the Schr\"odinger bridge problems…
We study the Schr\"odinger-Bass problem, a one-parameter family of semimartingale optimal transport problems indexed by $\beta>0$, whose limiting regimes interpolate between the classical Schr\"odinger bridge, the Brenier-Strassen problem,…
The optimal transport problem has recently developed into a powerful framework for various applications in estimation and control. Many of the recent advances in the theory and application of optimal transport are based on regularizing the…
In this work, we study a discrete Schr\"odinger bridge problem with partial marginal observations. A main difficulty compared to the classical Schr\"odinger bridge formulation is that our problem is not strictly convex and standard…
The Schr\"odinger bridge problem seeks the optimal stochastic process that connects two given probability distributions with minimal energy modification. While the Sinkhorn algorithm is widely used to solve the static optimal transport…
The Sinkhorn algorithm is the most popular method for solving the entropy minimization problem called the Schr\"odinger problem: in the non-degenerate cases, the latter admits a unique solution towards which the algorithm converges…
We study the least-energy way to reshape a probability distribution when motion is constrained to a horizontal bundle, that is, optimal transport and distribution steering in sub-Riemannian geometry, motivated by density control over…
Schr\"{o}dinger bridge is a stochastic optimal control problem to steer a given initial state density to another, subject to controlled diffusion and deadline constraints. A popular method to numerically solve the Schr\"{o}dinger bridge…
We investigate the quadratic Schr\"odinger bridge problem, a.k.a. Entropic Optimal Transport problem, and obtain weak semiconvexity and semiconcavity bounds on Schr\"odinger potentials under mild assumptions on the marginals that are…
The \emph{Schr\"odinger problem} is obtained by replacing the mean square distance with the relative entropy in the Monge-Kantorovich problem. It was first addressed by Schr\"odinger as the problem of describing the most likely evolution of…
We investigate the martingale Schr\"odinger bridge, recently introduced by Nutz and Wiesel as a distinguished martingale transport plan between two probability measures in convex order. We show that this construction extends naturally to…
Motivated by recent developments in the calibration of stochastic volatility models (SVMs for short), we study continuous-time formulations of martingale optimal transport and martingale Schr\"odinger bridge problems. We establish duality…
We show convergence of the gradients of the Schr\"odinger potentials to the Brenier map in the small-time limit under general assumptions on the marginals, which allow for unbounded densities and supports. Furthermore, we provide novel…
In this work, we develop a collection of novel methods for the entropic-regularised optimal transport problem, which are inspired by existing mirror descent interpretations of the Sinkhorn algorithm used for solving this problem. These are…
We propose a procedure for estimating the Schr\"odinger bridge between two probability distributions. Unlike existing approaches, our method does not require iteratively simulating forward and backward diffusions or training neural networks…
The Schr\"odinger bridge problem (SBP) is gaining increasing attention in generative modeling and showing promising potential even in comparison with the score-based generative models (SGMs). SBP can be interpreted as an entropy-regularized…