Halving the Bounds for the Markov, Chebyshev, and Chernoff Inequalities Using Smoothing

DOI10.1080/00029890.2019.1656484OpenAlexW2990761673WikidataQ126770897 ScholiaQ126770897MaRDI QIDQ4972079

Mark L. Huber

Publication date: 22 November 2019

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.06361

Mathematics Subject Classification ID

Tables in numerical analysis (65A05)

Related Items (4)

Testing with \(\mathrm{p}^*\)-values: between p-values, mid p-values, and e-values ⋮ Multi Split Conformal Prediction ⋮ Generalizations of some concentration inequalities ⋮ Averaging \(p\)-values under exchangeability

Cites Work

• Unnamed Item
• Unnamed Item
• Random generation of combinatorial structures from a uniform distribution
• Challenging the empirical mean and empirical variance: a deviation study
• On the Complexity of Computing the Volume of a Polyhedron
• A random polynomial-time algorithm for approximating the volume of convex bodies
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Halving the Bounds for the Markov, Chebyshev, and Chernoff Inequalities Using Smoothing