Related papers: Random Matrix-Improved Estimation of the Wasserste…

Stein's method has been widely used for probability approximations. However, in the multi-dimensional setting, most of the results are for multivariate normal approximation or for test functions with bounded second- or higher-order…

Resource-efficiently computing representations of probability distributions and the distances between them while only having access to the samples is a fundamental and useful problem across mathematical sciences. In this paper, we propose a…

This paper considers estimating a covariance matrix of $p$ variables from $n$ observations by either banding or tapering the sample covariance matrix, or estimating a banded version of the inverse of the covariance. We show that these…

We propose a methodology for intercomparing climate models and evaluating their performance against benchmarks based on the use of the Wasserstein distance (WD). This distance provides a rigorous way to measure quantitatively the difference…

We consider empirical measures of $\R^{d}$-valued stochastic process in finite discrete-time. We show that the adapted empirical measure introduced in the recent work \cite{backhoff2022estimating} by Backhoff et al. in compact spaces can be…

Bootstrap is a principled and powerful frequentist statistical tool for uncertainty quantification. Unfortunately, standard bootstrap methods are computationally intensive due to the need of drawing a large i.i.d. bootstrap sample to…

We introduce the Wasserstein Transform (WT), a general unsupervised framework for updating distance structures on given data sets with the purpose of enhancing features and denoising. Our framework represents each data point by a…

Let $n \in \mathbb N$, let $\zeta_{n,1},...,\zeta_{n,n}$ be a sequence of independent random variables with $\mathbb E \zeta_{n,i}=0$ and $\mathbb E |\zeta_{n,i}|<\infty$ for each $i$, and let $\mu$ be an $\alpha$-stable distribution having…

Data represented by probability measures arise as empirical distributions, posterior distributions, and feature-based representations of complex objects. We study heterogeneity in a population of probability measures through the expected…

Learning algorithms for implicit generative models can optimize a variety of criteria that measure how the data distribution differs from the implicit model distribution, including the Wasserstein distance, the Energy distance, and the…

The $2$-Wasserstein distance is sensitive to minor geometric differences between distributions, making it a very powerful dissimilarity metric. However, due to this sensitivity, a small outlier mass can also cause a significant increase in…

We propose a transfer principle to study the adapted 2-Wasserstein distance between stochastic processes. First, we obtain an explicit formula for the distance between real-valued mean-square continuous Gaussian processes by introducing the…

Gaussian processes (GPs) are a well-known nonparametric Bayesian inference technique, but they suffer from scalability problems for large sample sizes, and their performance can degrade for non-stationary or spatially heterogeneous data. In…

Wasserstein distance, which measures the discrepancy between distributions, shows efficacy in various types of natural language processing (NLP) and computer vision (CV) applications. One of the challenges in estimating Wasserstein distance…

We present \emph{Local Moment Matching (LMM)}, a unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance. We construct an efficiently computable estimator that achieves the minimax…

Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in…

The Wasserstein distance between probability measures on compact spaces provides a natural invariant quantitative measure of equidistribution, which is partly similar to the classical discrepancy appearing in Erd\"os-Tur\'an type…

We introduce a version of Stein's method of comparison of operators specifically tailored to the problem of bounding the Wasserstein-1 distance between continuous and discrete distributions on the real line. Our approach rests on a new…

Understanding the space of probability measures on a metric space equipped with a Wasserstein distance is one of the fundamental questions in mathematical analysis. The Wasserstein metric has received a lot of attention in the machine…

Approximate inference techniques are the cornerstone of probabilistic methods based on Gaussian process priors. Despite this, most work approximately optimizes standard divergence measures such as the Kullback-Leibler (KL) divergence, which…