Optimal Transport to a Variety

09/25/2019
by   T. Ö. Çelik, et al.
0

We study the problem of minimizing the Wasserstein distance between a probability distribution and an algebraic variety. We consider the setting of finite state spaces and describe the solution depending on the choice of the ground metric and the given distribution. The Wasserstein distance between the distribution and the variety is the minimum of a linear functional over a union of transportation polytopes. We obtain a description in terms of the solutions of a finite number of systems of polynomial equations. The case analysis is based on the ground metric. A detailed analysis is given for the two bit independence model.

READ FULL TEXT

page 10

page 11

research
03/15/2020

Wasserstein Distance to Independence Models

An independence model for discrete random variables is a Segre-Veronese ...
research
12/19/2018

On The Chain Rule Optimal Transport Distance

We define a novel class of distances between statistical multivariate di...
research
05/08/2019

Learning Embeddings into Entropic Wasserstein Spaces

Euclidean embeddings of data are fundamentally limited in their ability ...
research
02/24/2020

Computing Kantorovich distance with a MCMC of moves

In Optimal Transport (OT) on a finite metric space, one defines a distan...
research
02/24/2020

Finite space Kantorovich problem with an MCMC of table moves

In Optimal Transport (OT) on a finite metric space, one defines a distan...
research
03/17/2022

Low-rank Wasserstein polynomial chaos expansions in the framework of optimal transport

A unsupervised learning approach for the computation of an explicit func...
research
09/09/2020

The Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxation

Comparing metric measure spaces (i.e. a metric space endowed with a prob...

Please sign up or login with your details

Forgot password? Click here to reset