Related papers: One-dimensional Stein's method with bespoke deriva…
We introduce a new version of Stein's method that reduces a large class of normal approximation problems to variance bounding exercises, thus making a connection between central limit theorems and concentration of measure. Unlike Skorokhod…
The squared Wasserstein distance is a natural quantity to compare probability distributions in a non-parametric setting. This quantity is usually estimated with the plug-in estimator, defined via a discrete optimal transport problem which…
We present a framework that allows for the non-asymptotic study of the $2$-Wasserstein distance between the invariant distribution of an ergodic stochastic differential equation and the distribution of its numerical approximation in the…
Variance-Gamma distributions are widely used in financial modelling and contain as special cases the normal, Gamma and Laplace distributions. In this paper we extend Stein's method to this class of distributions. In particular, we obtain a…
New lower bounds on the total variation distance between the distribution of a sum of independent Bernoulli random variables and the Poisson random variable (with the same mean) are derived via the Chen-Stein method. The new bounds rely on…
We present a simple approach to study the one-dimensional pressureless Euler system via adhesion dynamics in the Wasserstein space of probability measures with finite quadratic moments. Starting from a discrete system of a finite number of…
The Wasserstein distance has emerged as a key metric to quantify distances between probability distributions, with applications in various fields, including machine learning, control theory, decision theory, and biological systems.…
Wasserstein Discriminant Analysis (WDA) is a new supervised method that can improve classification of high-dimensional data by computing a suitable linear map onto a lower dimensional subspace. Following the blueprint of classical Linear…
We develop Stein's method for the half-normal distribution and apply it to derive rates of convergence in distributional limit theorems for three statistics of the simple symmetric random walk: the maximum value, the number of returns to…
Many spatial models exhibit locality structures that effectively reduce their intrinsic dimensionality, enabling efficient approximation and sampling of high-dimensional distributions. However, existing approximation techniques primarily…
We study the discrepancy between the distribution of a vector-valued functional of i.i.d. random elements and that of a Gaussian vector. Our main contribution is an explicit bound on the convex distance between the two distributions,…
This paper introduces a comprehensive framework to adjust a discrete test statistic for improving its hypothesis testing procedure. The adjustment minimizes the Wasserstein distance to a null-approximating continuous distribution, tackling…
We generalize the well-known zero bias distribution and the $\lambda$-Stein pair to an approximate zero bias distribution and an approximate $\lambda,R$-Stein pair, respectively. Berry Esseen type bounds to the normal, based on approximate…
In [Schuhmacher, Electron. J. Probab. 10 (2005), 165--201] estimates of the Barbour-Brown distance d_2 between the distribution of a thinned point process and the distribution of a Poisson process were derived by combining discretization…
We introduce a distributionally robust maximum likelihood estimation model with a Wasserstein ambiguity set to infer the inverse covariance matrix of a $p$-dimensional Gaussian random vector from $n$ independent samples. The proposed model…
One of the key ingredients to successfully apply Stein's method for distributional approximation are solutions to the Stein equations and their derivatives. Using Barbour's generator approach, one can solve for the solutions to the Stein…
A stochastic ordering approach is applied with Stein's method for approximation by the equilibrium distribution of a birth-death process. The usual stochastic order and the more general s-convex orders are discussed. Attention is focused on…
Generative Adversarial Nets (GANs) are very successful at modeling distributions from given samples, even in the high-dimensional case. However, their formulation is also known to be hard to optimize and often not stable. While this is…
We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…
We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a…