REVIEW 2 cited by
Concentration Inequalities for the Empirical Distribution
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
abstract
We study concentration inequalities for the Kullback--Leibler (KL) divergence between the empirical distribution and the true distribution. Applying a recursion technique, we improve over the method of types bound uniformly in all regimes of sample size $n$ and alphabet size $k$, and the improvement becomes more significant when $k$ is large. We discuss the applications of our results in obtaining tighter concentration inequalities for $L_1$ deviations of the empirical distribution from the true distribution, and the difference between concentration around the expectation or zero. We also obtain asymptotically tight bounds on the variance of the KL divergence between the empirical and true distribution, and demonstrate their quantitatively different behaviors between small and large sample sizes compared to the alphabet size.
Forward citations
Cited by 2 Pith papers
-
Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition
OIAFC and OIAFB identify an (epsilon, delta)-optimal scoring rule in online principal-agent information acquisition with instance-dependent sample complexity, but the proven rate differs from the advertised rate.
-
Adaptive t Design Dummy-Gate Obfuscation for Cryogenic Scale Enforcement
NADGO combines dummy-gate padding, timing randomization, and routing with a per-interval leakage monitor to enforce operational privacy budgets for quantum cloud workloads.
Discussion (0). Continue with ORCID to comment.