We study the stability of entropically regularized optimal transport with respect to the marginals. Lipschitz continuity of the value and H\"older continuity of the optimal coupling in $p$-Wasserstein distance are obtained under general conditions including quadratic costs and unbounded marginals. The results for the value extend to regularization by an arbitrary divergence. As an application, we show convergence of Sinkhorn's algorithm in Wasserstein sense, including for quadratic cost. Two techniques are presented: The first compares an optimal coupling with its so-called shadow, a coupling induced on other marginals by an explicit construction. The second transforms one set of marginals by a change of coordinates and thus reduces the com...
The diffeomorphic registration framework enables to define an optimal matching function between two ...
The Gromov-Wasserstein (GW) distance quantifies discrepancy between metric measure spaces, but suffe...
We study Sinkhorn's algorithm for solving the entropically regularized optimal transport problem. It...
We show non-asymptotic exponential convergence of Sinkhorn iterates to the Schrödinger potentials, s...
47 pages, improved presentation of main results, added explicit expression for the exponential conve...
Applications of optimal transport have recently gained remarkable attention thanks to the computati...
We show non-asymptotic exponential convergence of Sinkhorn iterates to the Schrödinger potentials, s...
We show non-asymptotic exponential convergence of Sinkhorn iterates to the Schrödinger potentials, s...
We show continuity of the martingale optimal transport optimisation problem as a functional of its m...
This paper exploit the equivalence between the Schrödinger Bridge problem (Léonard in J Funct Anal 2...
26 pages, 4 figuresInternational audienceApplications of optimal transport have recently gained rema...
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently...
We derive nearly tight and non-asymptotic convergence bounds for solutions of entropic semi-discrete...
We show convergence of the gradients of the Schr\"odinger potentials to the Brenier map in the small...
The diffeomorphic registration framework enables to define an optimal matching function between two ...
The diffeomorphic registration framework enables to define an optimal matching function between two ...
The Gromov-Wasserstein (GW) distance quantifies discrepancy between metric measure spaces, but suffe...
We study Sinkhorn's algorithm for solving the entropically regularized optimal transport problem. It...
We show non-asymptotic exponential convergence of Sinkhorn iterates to the Schrödinger potentials, s...
47 pages, improved presentation of main results, added explicit expression for the exponential conve...
Applications of optimal transport have recently gained remarkable attention thanks to the computati...
We show non-asymptotic exponential convergence of Sinkhorn iterates to the Schrödinger potentials, s...
We show non-asymptotic exponential convergence of Sinkhorn iterates to the Schrödinger potentials, s...
We show continuity of the martingale optimal transport optimisation problem as a functional of its m...
This paper exploit the equivalence between the Schrödinger Bridge problem (Léonard in J Funct Anal 2...
26 pages, 4 figuresInternational audienceApplications of optimal transport have recently gained rema...
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently...
We derive nearly tight and non-asymptotic convergence bounds for solutions of entropic semi-discrete...
We show convergence of the gradients of the Schr\"odinger potentials to the Brenier map in the small...
The diffeomorphic registration framework enables to define an optimal matching function between two ...
The diffeomorphic registration framework enables to define an optimal matching function between two ...
The Gromov-Wasserstein (GW) distance quantifies discrepancy between metric measure spaces, but suffe...
We study Sinkhorn's algorithm for solving the entropically regularized optimal transport problem. It...