Inference for Projection-Based Wasserstein Distances on Finite Spaces

02/11/2022
by   Ryo Okano, et al.
0

The Wasserstein distance is a distance between two probability distributions and has recently gained increasing popularity in statistics and machine learning, owing to its attractive properties. One important approach to extending this distance is using low-dimensional projections of distributions to avoid a high computational cost and the curse of dimensionality in empirical estimation, such as the sliced Wasserstein or max-sliced Wasserstein distances. Despite their practical success in machine learning tasks, the availability of statistical inferences for projection-based Wasserstein distances is limited owing to the lack of distributional limit results. In this paper, we consider distances defined by integrating or maximizing Wasserstein distances between low-dimensional projections of two probability distributions. Then we derive limit distributions regarding these distances when the two distributions are supported on finite points. We also propose a bootstrap procedure to estimate quantiles of limit distributions from data. This facilitates asymptotically exact interval estimation and hypothesis testing for these distances. Our theoretical results are based on the arguments of Sommerfeld and Munk (2018) for deriving distributional limits regarding the original Wasserstein distance on finite spaces and the theory of sensitivity analysis in nonlinear programming. Finally, we conduct numerical experiments to illustrate the theoretical results and demonstrate the applicability of our inferential methods to real data analysis.

READ FULL TEXT
research
06/01/2022

Distributional Convergence of the Sliced Wasserstein Process

Motivated by the statistical and computational challenges of computing W...
research
11/24/2017

Central limit theorems for Sinkhorn divergence between probability distributions on finite spaces and statistical applications

The notion of Sinkhorn divergence has recently gained popularity in mach...
research
06/15/2020

Augmented Sliced Wasserstein Distances

While theoretically appealing, the application of the Wasserstein distan...
research
10/28/2020

Intrinsic Sliced Wasserstein Distances for Comparing Collections of Probability Distributions on Manifolds and Graphs

Collections of probability distributions arise in a variety of statistic...
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...
research
12/12/2018

Massively scalable Sinkhorn distances via the Nyström method

The Sinkhorn distance, a variant of the Wasserstein distance with entrop...
research
10/28/2019

Adaptive Sampling for Estimating Multiple Probability Distributions

We consider the problem of allocating samples to a finite set of discret...

Please sign up or login with your details

Forgot password? Click here to reset