mlsanityData to 13 Oct 2026

Randomized and Exchangeable Improvements of Markov's, Chebyshev's and Chernoff's Inequalities

arXiv 2304.02611 ↗First posted 5 Apr 2023math.ST cs.IT math.ITcited by 15

Not on the map. Why?

Abstract (arXiv)

We present simple randomized and exchangeable improvements of Markov's inequality, as well as Chebyshev's inequality and Chernoff bounds. Our variants are never worse and typically strictly more powerful than the original inequalities. The proofs are short and elementary, and can easily yield similarly randomized or exchangeable versions of a host of other inequalities that employ Markov's inequality as an intermediate step. We point out some simple statistical applications involving tests that combine dependent e-values. In particular, we uniformly improve the power of universal inference, and obtain tighter betting-based nonparametric confidence intervals. Simulations reveal nontrivial gains in power (and no losses) in a variety of settings.

Key facts. Cited by 15 papers in the map (data through 13 Oct 2026). First posted on arXiv 5 Apr 2023.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2023: 1; 2024: 6; 2025: 6; 2026: 2.

15 papers.

Sort:

By area: