Related papers: A diffusion approach to Stein's method on Riemanni…
Let $M$ be a connected compact Riemannian manifold possibly with a boundary, let $V\in C^2(M)$ such that $\mu(\d x):=\e^{V(x)}\d x$ is a probability measure, where $\d x$ is the volume measure, and let $L=\Delta+\nabla V$. The exact…
Stein's method (Stein, 1973; 1981) is a powerful tool for statistical applications and has significantly impacted machine learning. Stein's lemma plays an essential role in Stein's method. Previous applications of Stein's lemma either…
We introduce diffusion geometry as a new framework for geometric and topological data analysis. Diffusion geometry uses the Bakry-Emery $\Gamma$-calculus of Markov diffusion operators to define objects from Riemannian geometry on a wide…
Stein's method has been widely used for probability approximations. However, in the multi-dimensional setting, most of the results are for multivariate normal approximation or for test functions with bounded second- or higher-order…
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…
The Stein's method is a popular method used to derive upper-bounds of distances between probability distributions. It can be viewed, in certain of its formulations, as an avatar of the semi-group or of the smart-path method used commonly in…
The natural gradient method is widely used in statistical optimization, but its standard formulation assumes a Euclidean parameter space. This paper proposes an inversion-free stochastic natural gradient method for probability distributions…
The concentration inequality approach for normal approximation by Stein's method is generalized to the multivariate setting. We use this approach to prove a non-smooth function distance for multivariate normal approximation for standardized…
In this article, we discuss the basic ideas of a general procedure to adapt the Stein-Chen method to bound the distance between conditional distributions. From an integration-by-parts formula (IBPF), we derive a Stein operator whose…
This paper uses the generator comparison approach of Stein's method to analyze the gap between steady-state distributions of Markov chains and diffusion processes. The "standard" generator comparison approach starts with the Poisson…
We consider $M/Ph/n+M$ queueing systems in steady state. We prove that the Wasserstein distance between the stationary distribution of the normalized system size process and that of a piecewise Ornstein-Uhlenbeck (OU) process is bounded by…
In this paper we present a general framework for Stein's method for multivariate continuous distributions. The approach gives a collection of Stein characterisations, among which we highlight score-Stein operators and kernel Stein…
We present a straightforward formulation of Stein's method for the semicircular distribution, specifically designed for the analysis of non-commutative random variables. Our approach employs a non-commutative version of Stein's heuristic,…
The application of Stein's method for distributional approximation often involves so called Stein factors (also called 'magic factors') in the bound of the solutions to Stein equations. However, in some cases these factors contain…
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.…
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…
Let M be a compact connected oriented Riemannian manifold. The purpose of this paper is to investigate the long time behavior of a degenerate stochastic differential equation on the state space $M\times \mathbb{R}^{n}$; which is obtained…
Learning the distribution of data on Riemannian manifolds is crucial for modeling data from non-Euclidean space, which is required by many applications in diverse scientific fields. Yet, existing generative models on manifolds suffer from…
Diffusion models have demonstrated remarkable empirical success in the recent years and are considered one of the state-of-the-art generative models in modern AI. These models consist of a forward process, which gradually diffuses the data…
Diffusion models excel in content generation by implicitly learning the data manifold, yet they lack a practical method to leverage this manifold - unlike other deep generative models equipped with latent spaces. This paper introduces a…