English
Related papers

Related papers: Wasserstein Rate Driven CLTs for Markov Chains wit…

200 papers

We present a new approach, inspired by Stein's method, to prove a central limit theorem (CLT) for linear statistics of $\beta$-ensembles in the one-cut regime. Compared with the previous proofs, our result requires less regularity on the…

Probability · Mathematics 2019-02-20 Gaultier Lambert , Michel Ledoux , Christian Webb

Learning conditional densities and identifying factors that influence the entire distribution are vital tasks in data-driven applications. Conventional approaches work mostly with summary statistics, and are hence inadequate for a…

Methodology · Statistics 2022-09-13 Chengliang Tang , Nathan Lenssen , Ying Wei , Tian Zheng

We develop a central limit theorem (CLT) for a non-parametric estimator of the transition matrices in controlled Markov chains (CMCs) with finite state-action spaces. Our results establish precise conditions on the logging policy under…

Statistics Theory · Mathematics 2026-03-26 Ziwei Su , Imon Banerjee , Diego Klabjan

Markov chain Monte Carlo (MCMC) provides asymptotically consistent estimates of intractable posterior expectations as the number of iterations tends to infinity. However, in large data applications, MCMC can be computationally expensive per…

Computation · Statistics 2023-11-03 Niloy Biswas , Lester Mackey

The efficiency of a Markov sampler based on the underdamped Langevin diffusion is studied for high dimensional targets with convex and smooth potentials. We consider a classical second-order integrator which requires only one gradient…

Probability · Mathematics 2021-06-21 Pierre Monmarché

We consider linear two-time-scale stochastic approximation algorithms driven by martingale noise. Recent applications in machine learning motivate the need to understand finite-time error rates, but conventional stochastic approximation…

Machine Learning · Computer Science 2025-12-12 Seo Taek Kong , Sihan Zeng , Thinh T. Doan , R. Srikant

We provide an abstract multivariate central limit theorem with the Lindeberg-type error bounded in terms of Lipschitz functions (Wasserstein 1-distance) or functions with bounded second or third derivatives. The result is proved by means of…

Probability · Mathematics 2019-01-03 Martin Raič

We prove Berry-Esseen type rates of convergence for central limit theorems (CLTs) of regenerative processes which generalize previous results of Bolthausen under weaker moment assumptions. We then show how this general result can be applied…

Probability · Mathematics 2017-10-03 Xiaoqin Guo , Jonathon Peterson

The purpose of this paper is to analyze the distribution distance between random vectors derived from the magnitude of the analytic wavelet transform of the squared envelopes of Gaussian processes and their large-scale limits. When the…

Probability · Mathematics 2024-09-05 Gi-Ren Liu

We provide new bounds for the rate of convergence of the multivariate Central Limit Theorem in Wasserstein distances of order $p \geq 2$. In particular, we obtain what we conjecture to be the asymptotically optimal rate whenever the density…

Probability · Mathematics 2024-04-30 Thomas Bonis

Wasserstein distances define a metric between probability measures on arbitrary metric spaces, including meta-measures (measures over measures). The resulting Wasserstein over Wasserstein (WoW) distance is a powerful, but computationally…

Machine Learning · Computer Science 2026-02-20 Moritz Piening , Robert Beinert

A generalization of the Wasserstein metric, the integrated transportation distance, establishes a novel distance between probability kernels of Markov systems. This metric serves as the foundation for an efficient approximation technique,…

Machine Learning · Computer Science 2023-12-07 Zhengqi Lin , Andrzej Ruszczynski

Hamiltonian Monte Carlo (HMC) algorithms are among the most widely used sampling methods in high dimensional settings, yet their convergence properties are poorly understood in divergences that quantify relative density mismatch, such as…

Machine Learning · Statistics 2026-01-15 Nawaf Bou-Rabee , Siddharth Mitra , Andre Wibisono

We use Stein's method to bound the Wasserstein distance of order $2$ between a measure $\nu$ and the Gaussian measure using a stochastic process $(X_t)_{t \geq 0}$ such that $X_t$ is drawn from $\nu$ for any $t > 0$. If the stochastic…

Probability · Mathematics 2020-05-12 Thomas Bonis

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…

Probability · Mathematics 2023-09-18 Tianle Liu , Morgane Austern

Perturbation theory for Markov chains addresses the question how small differences in the transitions of Markov chains are reflected in differences between their distributions. We prove powerful and flexible bounds on the distance of the…

Computation · Statistics 2017-02-27 Daniel Rudolf , Nikolaus Schweizer

We introduce the Wasserstein Transform (WT), a general unsupervised framework for updating distance structures on given data sets with the purpose of enhancing features and denoising. Our framework represents each data point by a…

Machine Learning · Computer Science 2026-04-14 Kun Jin , Facundo Mémoli , Zane Smith , Zhengchao Wan

Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…

Probability · Mathematics 2025-03-11 Soumik Pal , Bodhisattva Sen , Ting-Kam Leonard Wong

In this article, we fill a gap in the literature on Hawkes processes. In particular, we derive a CLT for a non linear compound marked Hawkes process. We also provide an upper bound on the convergence rate using the functional 1-Wasserstein…

Probability · Mathematics 2026-01-27 Benjamin Massat

Wasserstein GANs (WGANs), built upon the Kantorovich-Rubinstein (KR) duality of Wasserstein distance, is one of the most theoretically sound GAN models. However, in practice it does not always outperform other variants of GANs. This is…

Machine Learning · Computer Science 2021-01-13 Minkai Xu , Zhiming Zhou , Guansong Lu , Jian Tang , Weinan Zhang , Yong Yu