Related papers: Multivariate approximations in Wasserstein distanc…
We propose a new minimum-distance estimator for linear random coefficient models. This estimator integrates the recently advanced sliced Wasserstein distance with the nearest neighbor methods, both of which enhance computational efficiency.…
The framework of Stein's method for Poisson process approximation is presented from the point of view of Palm theory, which is used to construct Stein identities and define local dependence. A general result (Theorem…
We provide a simple $C^{1,1}$ approximation of the squared Wasserstein distance on R^d when one of the two measures is fixed. This approximation converges locally uniformly. More importantly, at points where the differential of the squared…
We define an asymptotically normal wavelet-based strongly consistent estimator for the Hurst parameter of any Hermite processes. This estimator is obtained by considering a modified wavelet variation in which coefficients are wisely chosen…
We study first-order optimality conditions for constrained optimization in the Wasserstein space, whereby one seeks to minimize a real-valued function over the space of probability measures endowed with the Wasserstein distance. Our…
In this article, we develop Stein characterization for two-sided tempered stable distribution. Stein characterizations for normal, gamma, Laplace, and variance-gamma distributions already known in the literature follow easily. One can also…
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…
The Wasserstein distance is an attractive tool for data analysis but statistical inference is hindered by the lack of distributional limits. To overcome this obstacle, for probability measures supported on finitely many points, we derive…
We address the problem of efficiently computing Wasserstein distances for multiple pairs of distributions drawn from a meta-distribution. To this end, we propose a fast estimation method based on regressing Wasserstein distance on sliced…
Wasserstein distances are widely used in modern data analysis but pose significant computational and statistical challenges in high dimensions. The sliced Wasserstein distance alleviates these challenges by leveraging one-dimensional…
We obtain Stein approximation bounds for stochastic integrals with respect to a Poisson random measure over ${\Bbb R}^d$, $d\geq 2$. This approach relies on third cumulant Edgeworth-type expansions based on derivation operators defined by…
We combine the method of exchangeable pairs with Stein's method for functional approximation. As a result, we give a general linearity condition under which an abstract Gaussian approximation theorem for stochastic processes holds. We apply…
We propose a measure of the impact of any two choices of prior distributions by quantifying the Wasserstein distance between the respective resulting posterior distributions at any fixed sample size. We illustrate this measure on the…
Via a Bismut-Elworthy-Li formula from [KPP23], we derive uniform gradient estimates for transition semigroups associated with stochastic differential equations driven by a large class of cylindrical L\'{e}vy processes which includes the…
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…
Optimal transport is a foundational problem in optimization, that allows to compare probability distributions while taking into account geometric aspects. Its optimal objective value, the Wasserstein distance, provides an important loss…
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 define a modified Wasserstein distance for distribution clustering which inherits many of the properties of the Wasserstein distance but which can be estimated easily and computed quickly. The modified distance is the sum of two terms.…
We propose a new version of Stein's method of exchangeable pairs, which, given a suitable exchangeable pair $(W,W')$ of real-valued random variables, suggests the approximation of the law of $W$ by a suitable absolutely continuous…
Statistical models often include thousands of parameters. However, large models decrease the investigator's ability to interpret and communicate the estimated parameters. Reducing the dimensionality of the parameter space in the estimation…