Transport Dependency: Optimal Transport Based Dependency Measures

by   Thomas Giacomo Nies, et al.

Finding meaningful ways to determine the dependency between two random variables ξ and ζ is a timeless statistical endeavor with vast practical relevance. In recent years, several concepts that aim to extend classical means (such as the Pearson correlation or rank-based coefficients like Spearman's ρ) to more general spaces have been introduced and popularized, a well-known example being the distance correlation. In this article, we propose and study an alternative framework for measuring statistical dependency, the transport dependency τ≥ 0, which relies on the notion of optimal transport and is applicable in general Polish spaces. It can be estimated consistently via the corresponding empirical measure, is versatile and adaptable to various scenarios by proper choices of the cost function. Notably, statistical independence is characterized by τ = 0, while large values of τ indicate highly regular relations between ξ and ζ. Indeed, for suitable base costs, τ is maximized if and only if ζ can be expressed as 1-Lipschitz function of ξ or vice versa. Based on sharp upper bounds, we exploit this characterization and define three distinct dependency coefficients (a-c) with values in [0, 1], each of which emphasizes different functional relations. These transport correlations attain the value 1 if and only if ζ = φ(ξ), where φ is a) a Lipschitz function, b) a measurable function, c) a multiple of an isometry. The properties of coefficient c) make it comparable to the distance correlation, while coefficient b) is a limit case of a) that was recently studied independently by Wiesel (2021). Numerical results suggest that the transport dependency is a robust quantity that efficiently discerns structure from noise in simple settings, often out-performing other commonly applied coefficients of dependency.



There are no comments yet.


page 1

page 2

page 3

page 4


A new coefficient of correlation

Is it possible to define a coefficient of correlation which is (a) as si...

Limit Distributions and Sensitivity Analysis for Entropic Optimal Transport on Countable Spaces

For probability measures supported on countable spaces we derive limit d...

Measuring Association on Topological Spaces Using Kernels and Geometric Graphs

In this paper we propose and study a class of simple, nonparametric, yet...

Learning Probability Measures with respect to Optimal Transport Metrics

We study the problem of estimating, in the sense of optimal transport me...

The Directional Optimal Transport

We introduce a constrained optimal transport problem where origins x can...

On the Wasserstein Distance between Classical Sequences and the Lebesgue Measure

We discuss the classical problem of measuring the regularity of distribu...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.