Related papers: Central Limit Theorems for Asynchronous Averaged Q…
While modern representation learning relies heavily on global error signals, decentralized algorithms driven by local interactions offer a fundamental distributed alternative. However, the macroscopic convergence properties of these…
A pathwise large deviation principle in the Wasserstein topology and a pathwise central limit theorem are proved for the empirical measure of a mean-field system of interacting diffusions. The coefficients are path-dependent. The framework…
We establish central limit theorems for a large class of supercritical branching Markov processes in infinite dimension with spatially dependent and non-necessarily local branching mechanisms. This result relies on a fourth moment…
We establish here a Quantitative Central Limit Theorem (in Wasserstein distance) for the Euler-Poincar\'{e} Characteristic of excursion sets of random spherical eigenfunctions in dimension 2. Our proof is based upon a decomposition of the…
Central limit theorems and asymptotic properties of the minimum-contrast estimators of the drift parameter in linear stochastic evolution equations driven by fractional Brownian motion are studied. Both singular ($H < \frac{1}{2})$ and…
Statistical inference for non-stationary data is hindered by the failure of classical central limit theorems (CLTs), not least because there is no fixed Gaussian limit to converge to. To resolve this, we introduce relative weak convergence,…
For martingales with a wide range of integrability, we will quantify the rate of convergence of the central limit theorem via Wasserstein distances of order $r$, $1\le r\le 3$. Our bounds are in terms of Lyapunov's coefficients and the…
In this paper, we derive a central limit theorem for collections of weakly correlated random variables indexed by discrete metric spaces, where the correlation decays in the distance of the indices. The correlation structure we study…
This paper provides refined versions of some known functional central limit theorems for conditional Poisson sampling which are more suitable for applications. The theorems presented in this paper are generalizations of some results that…
Physical networks, such as biological neural networks, can learn desired functions without a central processor, using local learning rules in space and time to learn in a fully distributed manner. Learning approaches such as equilibrium…
This article is dedicated to the estimation of Wasserstein distances and Wasserstein costs between two distinct continuous distributions $F$ and $G$ on $\mathbb R$. The estimator is based on the order statistics of (possibly dependent)…
When the underlying random variables are Gaussian, the classical Central Limit Theorem (CLT) is trivial, but the functional CLT is not. The objective of the paper is to investigate the functional CLT for stationary Gaussian processes in the…
We obtain limit theorems for a class of nonlinear discrete-time processes $X(n)$ called the $k$-th order Volterra processes of order $k$. These are moving average $k$-th order polynomial forms: \[…
This paper presents the asymptotic theory for nondegenerate $U$-statistics of high frequency observations of continuous It\^{o} semimartingales. We prove uniform convergence in probability and show a functional stable central limit theorem…
The main result of the article is the rate of convergence to the Rosenblatt-type distributions in non-central limit theorems. Specifications of the main theorem are discussed for several scenarios. In particular, special attention is paid…
The main objective of this article is to establish a central limit theorem for additive three-variable functionals of bifurcating Markov chains. We thus extend the central limit theorem under point-wise ergodic conditions studied in…
We prove the Lindeberg--Feller central limit theorem without using characteristic functions or Taylor expansions, but instead by measuring how far a distribution is from the standard normal distribution according to the $2$-Wasserstein…
In this paper, we consider a generalization of the elephant random walk model. Compared to the usual elephant random walk, an interesting feature of this model is that the step sizes form a sequence of positive independent and identically…
We prove a central limit theorem for non-commutative random variables in a von Neumann algebra with a tracial state: Any non-commutative polynomial of averages of i.i.d. samples converges to a classical limit. The proof is based on a…
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently gained popularity in machine learning and statistics, as it makes feasible the use of smoothed optimal transportation distances for data…