Wasserstein Distance to Independence Models

03/15/2020
by   Turku Ozlum Celik, et al.
1

An independence model for discrete random variables is a Segre-Veronese variety in a probability simplex. Any metric on the set of joint states of the random variables induces a Wasserstein metric on the probability simplex. The unit ball of this polyhedral norm is dual to the Lipschitz polytope. Given any data distribution, we seek to minimize its Wasserstein distance to a fixed independence model. The solution to this optimization problem is a piecewise algebraic function of the data. We compute this function explicitly in small instances, we examine its combinatorial structure and algebraic degrees in the general case, and we present some experimental case studies.

READ FULL TEXT
research
07/29/2021

Wasserstein Conditional Independence Testing

We introduce a test for the conditional independence of random variables...
research
09/25/2019

Optimal Transport to a Variety

We study the problem of minimizing the Wasserstein distance between a pr...
research
03/02/2021

On Information (pseudo) Metric

This short note revisit information metric, underlining that it is a pse...
research
04/21/2018

A geometric view on Pearson's correlation coefficient and a generalization of it to non-linear dependencies

Measuring strength or degree of statistical dependence between two rando...
research
03/20/2017

Independence clustering (without a matrix)

The independence clustering problem is considered in the following formu...
research
03/06/2020

Sensitivity of Uncertainty Propagation for the Elliptic Diffusion Equation

For elliptic diffusion equations with random coefficient and source term...
research
05/29/2020

The energy distance for ensemble and scenario reduction

Scenario reduction techniques are widely applied for solving sophisticat...

Please sign up or login with your details

Forgot password? Click here to reset