The paper supplies computable KMT-type bounds for bounded i.i.d. sums that depend only on range and variance (or an empirical estimate), plus a moderate-deviation byproduct.
Efficient concentration with Gaussian approximation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computable Bounds for Strong Approximations with Applications
The paper supplies computable KMT-type bounds for bounded i.i.d. sums that depend only on range and variance (or an empirical estimate), plus a moderate-deviation byproduct.