Related papers: Bilateral Gamma Approximation in Weiner Space
The Bayesian smoothing equations are generally intractable for systems described by nonlinear stochastic differential equations and discrete-time measurements. Gaussian approximations are a computationally efficient way to approximate the…
Stein's method is used to obtain two theorems on multivariate normal approximation. Our main theorem, Theorem 1.2, provides a bound on the distance to normality for any nonnegative random vector. Theorem 1.2 requires multivariate size bias…
We study when a given Gaussian random variable on a given probability space $(\Omega, {\cal{F}}, P) $ is equal almost surely to $\beta_{1}$ where $\beta $ is a Brownian motion defined on the same (or possibly extended) probability space. As…
Distributed inference/estimation in Bayesian framework in the context of sensor networks has recently received much attention due to its broad applicability. The variational Bayesian (VB) algorithm is a technique for approximating…
Stochastic iterative algorithms, including stochastic gradient descent (SGD) and stochastic gradient Langevin dynamics (SGLD), are widely utilized for optimization and sampling in large-scale and high-dimensional problems in machine…
We develop a general approach to Stein's method for approximating a random process in the path space $D([0,T]\to R^d)$ by a real continuous Gaussian process. We then use the approach in the context of processes that have a representation as…
We introduce a version of Stein's method of comparison of operators specifically tailored to the problem of bounding the Wasserstein-1 distance between continuous and discrete distributions on the real line. Our approach rests on a new…
We investigate the problem of finding necessary and sufficient conditions for convergence in distribution towards a general finite linear combination of independent chi-squared random variables, within the framework of random objects living…
The Gromov-Wasserstein (GW) distance quantifies discrepancy between metric measure spaces and provides a natural framework for aligning heterogeneous datasets. Alas, as exact computation of GW alignment is NP hard, entropic regularization…
We study in this paper a weak approximation to stochastic variance reduced gradient Langevin dynamics by stochastic delay differential equations in Wasserstein-1 distance, and obtain a uniform error bound. Our approach is via a refined…
In this paper, we propose an infinite-dimensional version of the Stein variational gradient descent (iSVGD) method for solving Bayesian inverse problems. The method can generate approximate samples from posteriors efficiently. Based on the…
Bayesian methods estimate a measure of uncertainty by using the posterior distribution. One source of difficulty in these methods is the computation of the normalizing constant. Calculating exact posterior is generally intractable and we…
We explore two aspects of geometric approximation via a coupling approach to Stein's method. Firstly, we refine precision and increase scope for applications by convoluting the approximating geometric distribution with a simple translation…
Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic optimal transport…
We build on the formalism developed in [arXiv:1906.08372v1] to propose new representations of solutions to Stein equations. We provide new uniform and non uniform bounds on these solutions (a.k.a.\ Stein factors). We use these…
In this article, we consider Poisson and Poisson convoluted geometric approximation to the sums of $n$ independent random variables under moment conditions. We use Stein's method to derive the approximation results in total variation…
The purpose of this paper is to estimate the limiting variance of asymptotically stationary Gaussian processes observed at high frequency, using the second moment estimator (SME). We study rates of convergence of the central limit theorem…
In Bayesian inference, the posterior distributions are difficult to obtain analytically for complex models such as neural networks. Variational inference usually uses a parametric distribution for approximation, from which we can easily…
The paper gives the bounds on the solutions to a Stein equation for the negative binomial distribution that are needed for approximation in terms of the Wasserstein metric. The proofs are probabilistic, and follow the approach introduced in…
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…