Related papers: Stein approximation for functionals of independent…
Gradient-based approximate inference methods, such as Stein variational gradient descent (SVGD), provide simple and general-purpose inference engines for differentiable continuous distributions. However, existing forms of SVGD cannot be…
Recently there have been increasing interests in learning and inference with implicit distributions (i.e., distributions without tractable densities). To this end, we develop a gradient estimator for implicit distributions based on Stein's…
We provide an overview of some recent techniques involving the Malliavin calculus of variations and the so-called ``Stein's method'' for the Gaussian approximations of probability distributions. Special attention is devoted to establishing…
Donsker Theorem is perhaps the most famous invariance principle result for Markov processes. It states that when properly normalized, a random walk behaves asymptotically like a Brownian motion. This approach can be extended to general…
We construct two different Stein characterizations of discrete distributions and use these to provide a natural connection between Stein characterizations for discrete distributions and discrete information functionals.
This paper provides an introduction to the Stein method framework in the context of steady-state diffusion approximations. The framework consists of three components: the Poisson equation and gradient bounds, generator coupling, and moment…
We give a distribution-dependent concentration inequality for functions of independent variables. The result extends Bernstein's inequality from sums to more general functions, whose variation in any argument does not depend too much on the…
We identify various classes of neural networks that are able to approximate continuous functions locally uniformly subject to fixed global linear growth constraints. For such neural networks the associated neural stochastic differential…
We derive explicit central moment inequalities for random variables that admit a Stein coupling, such as exchangeable pairs, size--bias couplings or local dependence, among others. The bounds are in terms of moments (not necessarily…
Random events in space and time often exhibit a locally dependent structure. When the events are very rare and dependent structure is not too complicated, various studies in the literature have shown that Poisson and compound Poisson…
By analogy with the program of McKinnon-Roth, we define and study approximation constants for points of a projective variety X defined over K the function field of an irreducible and non-singular in codimension 1 projective variety defined…
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…
We consider the discrete three dimensional scan statistics. Viewed as the maximum of an 1-dependent stationary r.v.'s sequence, we provide approximations and error bounds for the probability distribution of the three dimensional scan…
This paper proposes a thorough theoretical analysis of Stochastic Gradient Descent (SGD) with non-increasing step sizes. First, we show that the recursion defining SGD can be provably approximated by solutions of a time inhomogeneous…
The diffusion approximation of stochastic gradient descent (SGD) in current literature is only valid on a finite time interval. In this paper, we establish the uniform-in-time diffusion approximation of SGD, by only assuming that the…
We give a general method to obtain from the integral restrictions of functions sharp pointwise and uniform estimates of these functions. This scheme is illustrated by the examples for Fock\,--\,Bargmann spaces of entire functions of several…
We present a theory for simultaneous approximation of the score function and its derivatives, enabling the handling of data distributions with low-dimensional structure and unbounded support. Our approximation error bounds match those in…
Motivated by a theorem of Barbour, we revisit some of the classical limit theorems in probability from the viewpoint of the Stein method. We setup the framework to bound Wasserstein distances between some distributions on infinite…
We establish inequalities for assessing the distance between the distribution of errors of partially observed high-frequency statistics of multidimensional L\'evy processes and that of a mixed Gaussian random variable. Furthermore, we…
Stein's method compares probability distributions through the study of a class of linear operators called Stein operators. While mainly studied in probability and used to underpin theoretical statistics, Stein's method has led to…