REVIEW 3 cited by
Nearly tight universal bounds for the binomial tail probabilities
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 derive simple but nearly tight upper and lower bounds for the binomial lower tail probability (with straightforward generalization to the upper tail probability) that apply to the whole parameter regime. These bounds are easy to compute and are tight within a constant factor of $89/44$. Moreover, they are asymptotically tight in the regimes of large deviation and moderate deviation. By virtue of a surprising connection with Ramanujan's equation, we also provide strong evidences suggesting that the lower bound is tight within a factor of $1.26434$. It may even be regarded as the natural lower bound, given its simplicity and appealing properties. Our bounds significantly outperform the familiar Chernoff bound and reverse Chernoff bounds known in the literature and may find applications in various research areas.
Forward citations
Cited by 3 Pith papers
-
Quantum Key Distribution Beyond Stationary Channels
New interval-mixture martingale bounds give robust non-IID concentration inequalities that reduce the required number of satellite-QKD signals by up to ~70% under channel-loss mismatch.
-
Informational Content of Auction Prices
The discriminatory auction price is Lehmann more informative than the uniform-price auction price whenever k/n is large enough relative to a cumulative-score threshold determined by the signal distribution.
-
Experimental Verification of Entangled States in the Adversarial Scenario
A photonic experiment shows that defensive quantum state verification can certify the fidelity of a two-qubit singlet even when the source is adversarial, while standard verification fails.
Discussion (0). Continue with ORCID to comment.