相关论文: Marginal flows of non-entropic weak Schr\"odinger …
Motivated by modern machine learning applications where we only have access to empirical measures constructed from finite samples, we relax the marginal constraints of the classical Schr\"odinger bridge problem by penalizing the transport…
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…
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 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 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…
We establish the stability of solutions to the entropically regularized optimal transport problem with respect to the marginals and the cost function. The result is based on the geometric notion of cyclical invariance and inspired by the…
We take a new look at the relation between the optimal transport problem and the Schr\"{o}dinger bridge problem from the stochastic control perspective. We show that the connections are richer and deeper than described in existing…
For a fixed flow-based generative model under a small inference budget, sample quality can depend strongly on where the sampler spends its few function evaluations. Flow matching and Schr\"odinger bridges define probability paths, yet their…
We study a semimartingale optimal transport problem interpolating between the Schr\"odinger bridge and the stretched Brownian motion associated with the Bass solution of the Skorokhod embedding problem. The cost combines an entropy term on…
We consider an optimal transport problem on the unit simplex whose solutions are given by gradients of exponentially concave functions and prove two main results. First, we show that the optimal transport is the large deviation limit of a…
We study the convergence of entropically regularized optimal transport to optimal transport. The main result is concerned with the convergence of the associated optimizers and takes the form of a large deviations principle quantifying the…
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…
This paper is concerned with six variational problems and their mutual connections: The quadratic Monge-Kantorovich optimal transport, the Schr\"odinger problem, Brenier's relaxed model for incompressible fluids, the so-called Br\"odinger…
We propose a novel neural algorithm for the fundamental problem of computing the entropic optimal transport (EOT) plan between continuous probability distributions which are accessible by samples. Our algorithm is based on the saddle point…
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…
A basic idea in optimal transport is that optimizers can be characterized through a geometric property of their support sets called cyclical monotonicity. In recent years, similar "monotonicity principles" have found applications in other…
We consider the problem of minimizing the entropy of a law with respect to the law of a reference branching Brownian motion under density constraints at an initial and final time. We call this problem the branching Schr\"odinger problem by…
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…
We establish large deviations for dynamical Schr\"{o}dinger problems driven by perturbed Brownian motions when the noise parameter tends to zero. Our results show that Schr\"{o}dinger bridges charge exponentially small masses outside the…
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…