New Algorithmic Directions in Optimal Transport and Applications for Product Spaces

Salman Beigi, Omid Etesami, Mohammad Mahmoody +1

We study optimal transport between two high-dimensional distributions $\mu ,\nu$ in $R^n$ from an algorithmic perspective: given $x\sim \mu$, find a close $y\sim \nu$ in $poly(n)$ time, w…