Related papers: New error bounds in multivariate normal approximat…
The purpose of this paper is to synthesize the approaches taken by Chatterjee-Meckes and Reinert-R\"ollin in adapting Stein's method of exchangeable pairs for multivariate normal approximation. The more general linear regression condition…
It is shown that the method of exchangeable pairs introduced by Stein [Approximate Computation of Expectations (1986) IMS, Hayward, CA] for normal approximation can effectively be used for translated Poisson approximation. Introducing an…
This paper studies sampling error bounds for denoising diffusion probabilistic models (DDPMs) in the 2-Wasserstein distance. Our contributions are threefold. (i) Under general Lipschitz-type conditions on the score function and for a broad…
Motivated by the growing popularity of variants of the Wasserstein distance in statistics and machine learning, we study statistical inference for the Sliced Wasserstein distance--an easily computable variant of the Wasserstein distance.…
We present a way to use Stein's method in order to bound the Wasserstein distance of order $2$ between two measures $\nu$ and $\mu$ supported on $\mathbb{R}^d$ such that $\mu$ is the reversible measure of a diffusion process. In order to…
Let F ($\nu$) be the centered Gamma law with parameter $\nu$ > 0 and let us denote by P Y the probability distribution of a random vector Y. We develop a multidimensional variant of the Stein's method for Gamma approximation that allows to…
We present a framework for obtaining explicit bounds on the rate of convergence to equilibrium of a Markov chain on a general state space, with respect to both total variation and Wasserstein distances. For Wasserstein bounds, our main tool…
We derive upper bounds on the Wasserstein distance ($W_1$), with respect to $\sup$-norm, between any continuous $\mathbb{R}^d$ valued random field indexed by the $n$-sphere and the Gaussian, based on Stein's method. We develop a novel…
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…
We present the first minimax risk bounds for estimators of the spectral measure in multivariate linear factor models, where observations are linear combinations of regularly varying latent factors. Non-asymptotic convergence rates are…
Narayana numbers appear in many places in combinatorics and probability, and it is known that they are asymptotically normal. Using Stein's method of exchangeable pairs, we provide an error of approximation in total variation to a symmetric…
We provide new bounds for the rate of convergence of the multivariate Central Limit Theorem in Wasserstein distances of order $p \geq 2$. In particular, we obtain what we conjecture to be the asymptotically optimal rate whenever the density…
We prove an exact fourth moment bound for the normal approximation of random variables belonging to the Wiener chaos of a general Poisson random measure. Such a result -- that has been elusive for several years -- shows that the so-called…
We study the problem of approximately recovering a probability distribution given noisy measurements of its Chebyshev polynomial moments. This problem arises broadly across algorithms, statistics, and machine learning. By leveraging a…
In this note, we study the Gaussian fluctuations for the Wishart matrices $d^{-1}\mathcal{X}_{n, d}\mathcal{X}^{T}_{n, d}$, where $\mathcal{X}_{n, d}$ is a $n\times d$ random matrix whose entries are jointly Gaussian and correlated with row…
We develop techniques for determining the exact asymptotic speed of convergence in the multidimensional normal approximation of smooth functions of Gaussian fields. As a by-product, our findings yield exact limits and often give rise to…
The Wasserstein distance is a metric on a space of probability measures that has seen a surge of applications in statistics, machine learning, and applied mathematics. However, statistical aspects of Wasserstein distances are bottlenecked…
In this paper we develop a framework for multivariate functional approximation by a suitable Gaussian process via an exchangeable pairs coupling that satisfies a suitable approximate linear regression property, thereby building on work by…
Squared Wasserstein distance is a frequently used tool to measure discrepancy between probability distributions. This distance is typically computed between empirical measures of size $n$ from two underlying random samples. Unfortunately,…
Considering two random variables with different laws to which we only have access through finite size iid samples, we address how to reweight the first sample so that its empirical distribution converges towards the true law of the second…