Two-sample Test using Projected Wasserstein Distance: Breaking the Curse of Dimensionality

10/22/2020
by   Jie Wang, et al.
0

We develop a projected Wasserstein distance for the two-sample test, a fundamental problem in statistics and machine learning: given two sets of samples, to determine whether they are from the same distribution. In particular, we aim to circumvent the curse of dimensionality in Wasserstein distance: when the dimension is high, it has diminishing testing power, which is inherently due to the slow concentration property of Wasserstein metrics in the high dimension space. A key contribution is to couple optimal projection to find the low dimensional linear mapping to maximize the Wasserstein distance between projected probability distributions. We characterize the theoretical property of the finite-sample convergence rate on IPMs and present practical algorithms for computing this metric. Numerical examples validate our theoretical results.

READ FULL TEXT
research
02/12/2021

Two-sample Test with Kernel Projected Wasserstein Distance

We develop a kernel projected Wasserstein distance for the two-sample te...
research
09/09/2020

Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionality

Wasserstein distributionally robust optimization (DRO) aims to find robu...
research
01/31/2022

On a linearization of quadratic Wasserstein distance

This paper studies the problem of computing a linear approximation of qu...
research
01/22/2021

Projected Statistical Methods for Distributional Data on the Real Line with the Wasserstein Metric

We present a novel class of projected methods, to perform statistical an...
research
10/24/2019

Arbitrary Rates of Convergence for Projected and Extrinsic Means

We study central limit theorems for the projected sample mean of indepen...
research
05/30/2022

Hilbert Curve Projection Distance for Distribution Comparison

Distribution comparison plays a central role in many machine learning ta...
research
06/14/2022

Overparametrized linear dimensionality reductions: From projection pursuit to two-layer neural networks

Given a cloud of n data points in ℝ^d, consider all projections onto m-d...

Please sign up or login with your details

Forgot password? Click here to reset