Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithm

07/31/2023
by   Nabarun Deb, et al.
0

We prove that the sequence of marginals obtained from the iterations of the Sinkhorn algorithm or the iterative proportional fitting procedure (IPFP) on joint densities, converges to an absolutely continuous curve on the 2-Wasserstein space, as the regularization parameter ε goes to zero and the number of iterations is scaled as 1/ε (and other technical assumptions). This limit, which we call the Sinkhorn flow, is an example of a Wasserstein mirror gradient flow, a concept we introduce here inspired by the well-known Euclidean mirror gradient flows. In the case of Sinkhorn, the gradient is that of the relative entropy functional with respect to one of the marginals and the mirror is half of the squared Wasserstein distance functional from the other marginal. Interestingly, the norm of the velocity field of this flow can be interpreted as the metric derivative with respect to the linearized optimal transport (LOT) distance. An equivalent description of this flow is provided by the parabolic Monge-Ampère PDE whose connection to the Sinkhorn algorithm was noticed by Berman (2020). We derive conditions for exponential convergence for this limiting flow. We also construct a Mckean-Vlasov diffusion whose marginal distributions follow the Sinkhorn flow.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/16/2018

Natural gradient via optimal transport I

We study a natural Wasserstein gradient flow on manifolds of probability...
research
01/11/2023

Wasserstein Gradient Flows of the Discrepancy with Distance Kernel on the Line

This paper provides results on Wasserstein gradient flows between measur...
research
06/12/2018

Approximate inference with Wasserstein gradient flows

We present a novel approximate inference method for diffusion processes,...
research
11/18/2021

Gradient flows on graphons: existence, convergence, continuity equations

Wasserstein gradient flows on probability measures have found a host of ...
research
08/18/2021

Quantitative Uniform Stability of the Iterative Proportional Fitting Procedure

We establish the uniform in time stability, w.r.t. the marginals, of the...
research
06/26/2020

Semi-discrete optimization through semi-discrete optimal transport: a framework for neural architecture search

In this paper we introduce a theoretical framework for semi-discrete opt...
research
11/24/2020

Spatiotemporal Imaging with Diffeomorphic Optimal Transportation

We propose a variational model with diffeomorphic optimal transportation...

Please sign up or login with your details

Forgot password? Click here to reset