REVIEW 6 cited by
A multivariate central limit theorem for Lipschitz and smooth test functions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A multivariate central limit theorem for Lipschitz and smooth test functions
read the original abstract
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 Stein's method. For sums of i.i.d. random vectors with finite third absolute moment, the optimal rate of convergence is established (that is, we eliminate the logarithmic factor in the case of Lipschitz test functions). We indicate how the result could be applied to certain other dependence structures, but do not derive bounds explicitly.
Forward citations
Cited by 6 Pith papers
-
Wasserstein-p Central Limit Theorem Rates: From Local Dependence to Markov Chains
The paper proves the first optimal O(n^{-1/2}) Wasserstein-1 CLT rates for locally dependent sequences and geometrically ergodic Markov chains, plus new W_p rates for p greater than or equal to 2 under mild moments, w...
-
Normal approximation of the numbers of isolated edges and isolated 2-stars in uniform simple graphs with given vertex degrees
The paper establishes the first finite-sample normal approximation bounds for the numbers of isolated edges and isolated 2-stars in uniform simple graphs with prescribed degrees, via new joint normal-Poisson Stein's m...
-
Quantizing With Randomized Hadamard Transforms: Efficient Heuristic Now Proven
Two randomized Hadamard transforms suffice to make coordinate marginals O(d^{-1/2})-close to Gaussian for most quantization methods, with three needed for vector quantization to match uniform random rotations asymptotically.
-
High Dimensional Gaussian and Bootstrap Approximations in Generalized Linear Models
Gaussian approximations hold for high-dimensional GLMs up to d = o(n^{2/5}) for convex sets while bootstrap approximations stay valid further, including in sparse exponential high-d cases via Lasso under specific spar...
-
Normal approximation of the numbers of isolated edges and isolated 2-stars in uniform simple graphs with given vertex degrees
Quantitative bounds are established for normal approximations to isolated edges and 2-stars in uniform simple graphs with fixed degrees, using new Stein's method and coupling in the configuration model.
-
Normal approximation of the numbers of isolated edges and isolated 2-stars in uniform simple graphs with given vertex degrees
Establishes the first finite-sample normal approximation bounds for isolated edges and isolated 2-stars in uniform simple graphs with given degrees via new Stein's method and coupling.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.