相关论文: Stein's Method and Non-Reversible Markov Chains

An important task in machine learning and statistics is the approximation of a probability measure by an empirical measure supported on a discrete point set. Stein Points are a class of algorithms for this task, which proceed by…

Using Stein's method techniques, we develop a framework which allows one to bound the error terms arising from approximation by the Laplace distribution and apply it to the study of random sums of mean zero random variables. As a corollary,…

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…

It is known that the fluctuations of suitable linear statistics of Haar distributed elements of the compact classical groups satisfy a central limit theorem. We show that if the corresponding test functions are sufficiently smooth, a rate…

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…

I show how any reversible Markov chain on a finite state space that is irreducible, and hence suitable for estimating expectations with respect to its invariant distribution, can be used to construct a non-reversible Markov chain on a…

This paper provides a general framework for Stein's density method for multivariate continuous distributions. The approach associates to any probability density function a canonical operator and Stein class, as well as an infinite…

We study the problem of nonparametric two-sample testing using the sliced Wasserstein (SW) distance. While prior theoretical and empirical work indicates that the SW distance offers a promising balance between strong statistical guarantees…

We consider the Hopfield model with $n$ neurons and an increasing number $p=p(n)$ of randomly chosen patterns and use Stein's method to obtain rates of convergence for the central limit theorem of overlap parameters, which holds for every…

We consider two finite population Markov chain models, the two-island Wright-Fisher model with mutation, and the seed-bank model with mutation. Despite the relatively simple descriptions of the two processes, the the exact form of their…

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…

We use Stein's method to obtain a bound on the distance between scaled $p$-dimensional random walks and a $p$-dimensional (correlated) Brownian Motion. We consider dependence schemes including those in which the summands in scaled sums are…

Let $M$ be a random matrix in the orthogonal group $\O_n$, distributed according to Haar measure, and let $A$ be a fixed $n\times n$ matrix over $\R$ such that $\tr(AA^t)=n$. Then the total variation distance of the random variable…

We establish an abstract, effective, exponential large deviations type estimate for Markov systems satisfying a weaker form of mixing. We employ this result to derive such estimates, as well as a central limit theorem, for the skew product…

This paper studies the rate of convergence of a family of continuous-time Markov chains (CTMC) to a mean-field model. When the mean-field model is a finite-dimensional dynamical system with a unique equilibrium point, an analysis based on…

The central limit theorem is one of the most fundamental results in probability and has been successfully extended to locally dependent data and strongly-mixing random fields. In this paper, we establish its rate of convergence for…

We investigate the mixing rate of a Markov chain where a combination of long distance edges and non-reversibility is introduced: as a first step, we focus here on the following graphs: starting from the cycle graph, we select random nodes…

This paper concerns the development of Stein's method for chi-square approximation and its application to problems in statistics. New bounds for the derivatives of the solution of the gamma Stein equation are obtained. These bounds involve…

We develop a multidimensional Stein methodology for non-degenerate self-decomposable random vectors in $\mathbb{R}^d$ having finite first moment. Building on previous univariate findings, we solve an integro-partial differential Stein…

Stein importance sampling is a widely applicable technique based on kernelized Stein discrepancy, which corrects the output of approximate sampling algorithms by reweighting the empirical distribution of the samples. A general analysis of…