Related papers: On quantitative bounds in the mean martingale cent…
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently gained popularity in machine learning and statistics, as it makes feasible the use of smoothed optimal transportation distances for data…
In $1946$, Mark Kac proved a Central Limit type theorem for a sequence of random variables that were not independent. The random variables under consideration were obtained from the angle-doubling map. The idea behind Kac's proof was to…
The Wasserstein distance has been an attractive tool in many fields. But due to its high computational complexity and the phenomenon of the curse of dimensionality in empirical estimation, various extensions of the Wasserstein distance have…
In this work, we study the normal approximation and almost sure central limit theorems for some functionals of an independent sequence of Rademacher random variables. In particular, we provide a new chain rule that improves the one derived…
Comparing probability distributions is at the crux of many machine learning algorithms. Maximum Mean Discrepancies (MMD) and Wasserstein distances are two classes of distances between probability distributions that have attracted abundant…
We derive a multidimensional Stein's method for asymptotic independence in the case of a general target $\mu$ with a density, being invariant measure of a diffusion process. It allows us to give a general bound in Wasserstein distance…
In this paper, we are interested in the time derivative of the Wasserstein distance between the marginals of two Markov processes. As recalled in the introduction, the Kantorovich duality leads to a natural candidate for this derivative. Up…
We refine the classical Lindeberg-Feller central limit theorem by obtaining asymptotic bounds on the Kolmogorov distance, the Wasserstein distance, and the parametrized Prokhorov distances in terms of a Lindeberg index. We thus obtain more…
We address the problem of proving a Central Limit Theorem for the empirical optimal transport cost, $\sqrt{n}\{\mathcal{T}_c(P_n,Q)-\mathcal{W}_c(P,Q)\}$, in the semi discrete case, i.e when the distribution $P$ is finitely supported. We…
We study discretizations of Hamiltonian systems on the probability density manifold equipped with the $L^2$-Wasserstein metric. Based on discrete optimal transport theory, several Hamiltonian systems on graph (lattice) with different…
We use Stein's method to obtain explicit bounds on the rate of convergence for the Laplace approximation of two different sums of independent random variables; one being a random sum of mean zero random variables and the other being a…
We quantify, uniformly over time and with high probability, the discrepancy between the predictions of a two-layer neural network trained by stochastic gradient descent (SGD) and their mean-field limit, for quadratic loss and ridge…
We study existence of probability measure valued jump-diffusions described by martingale problems. We develop a simple device that allows us to embed Wasserstein spaces and other similar spaces of probability measures into locally compact…
By the continuous mapping theorem, if a sequence of $d$-dimensional random vectors $(\mathbf{W}_n)_{n\geq1}$ converges in distribution to a multivariate normal random variable $\Sigma^{1/2}\mathbf{Z}$, then the sequence of random variables…
We obtain bounds to quantify the distributional approximation in the delta method for vector statistics (the sample mean of $n$ independent random vectors) for normal and non-normal limits, measured using smooth test functions. For normal…
Motivated by the omnipresence of extreme value distributions in limit theorems involving extremes of random processes, we adapt Stein's method to include these laws as possible target distributions. We do so by using the generator approach…
Recent progress has been made in establishing normal approximation bounds in terms of the Wasserstein-$p$ distance for i.i.d. and locally dependent random variables. However, for $p > 1$, no such results have been demonstrated for dependent…
We provide a bound on a natural distance between finitely and infinitely supported elements of the unit sphere of $\ell^2(\mathbb{N}^*)$, the space of real valued sequences with finite $\ell^2$ norm. We use this bound to estimate the…
This paper establishes central limit theorems for Polyak-Ruppert averaged Q-learning under asynchronous updates. We prove a non-asymptotic central limit theorem, where the convergence rate in Wasserstein distance explicitly reflects the…
We provide rates of convergence in the central limit theorem in terms of projective criteria for adapted stationary sequences of centered random variables taking values in Banach spaces, with finite moment of order $p \in ]2,3]$ as soon as…