On the absolute constants in the Berry-Esseen type inequalities for identically distributed summands
read the original abstract
By a modification of the method that was applied in (Korolev and Shevtsova, 2010), here the inequalities $\Delta_n\leq0.3328(\beta_3+0.429)/\sqrt{n}$ and $\Delta_n\leq0.33554(\beta_3+0.415)/\sqrt{n}$ are proved for the uniform distance $\Delta_n$ between the standard normal distribution function and the distribution function of the normalized sum of an arbitrary number $n\geq1$ of independent identically distributed random variables with zero mean, unit variance and finite third absolute moment $\beta_3$. The first of these two inequalities improves one that was proved in (Korolev and Shevtsova, 2010), and as well sharpens the best known upper estimate for the absolute constant $C_0$ in the classical Berry--Esseen inequality to be $C_0<0.4756$, since $0.3328(\beta_3+0.429)\leq0.3328\cdot1.429\beta_3<0.4756\beta_3$ by virtue of the condition $\beta_3\geq1$. The second of these inequalities is also a structural improvement of the classical Berry--Esseen inequality, and as well sharpens the upper estimate for $C_0$ still more to be $C_0<0.4748$.
This paper has not been read by Pith yet.
Forward citations
Cited by 6 Pith papers
-
Trade-off Functions for DP-SGD with Subsampling based on Random Shuffling: Tight Upper and Lower Bounds
Tight closed-form bounds via Berry-Esseen show DP-SGD with random shuffling achieves near-ideal privacy (trade-off close to 1-a) for σ ≥ √(3/ln M) and large M, with δ linear in epochs restricting E to O(√M) and an asy...
-
Trade-off Functions for DP-SGD with Subsampling based on Random Shuffling: Tight Upper and Lower Bounds
Derives tight closed-form bounds on f-DP trade-off functions for DP-SGD with random shuffling subsampling in the high-noise regime σ ≥ √(3/ln M), plus an asymptotic convergence result to the random guessing diagonal w...
-
Constrained Contextual Bandits with Adversarial Contexts
A modular reduction from budget-constrained contextual bandits with adversarial contexts to unconstrained bandits via surrogate rewards, yielding improved guarantees and an efficient algorithm based on SquareCB.
-
Quantile of Means: A Bonus-Free Ensemble Method for Minimax Optimal Reinforcement Learning
A quantile-of-means ensemble method achieves minimax optimal variance-dependent regret bounds for finite-horizon MDPs without count-based uncertainty estimates.
-
Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction
A projection-based algorithm for COCO achieves O(log T) regret and O(log T) CCV for strongly convex losses and O(sqrt(T)) for convex losses by leveraging self-contracted curves.
-
Empirical coordination in the finite blocklength regime: an achievability result---Extended version
An achievability result is derived for empirical coordination under finite blocklength constraints, yielding both an exact rate bound and its asymptotic expansion.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.