A One-Sided McDiarmid-Type Inequality for Heavy Tails via Reverse KL Tensorization
arXiv:2610.21103v1 Announce Type: cross Abstract: We revisit McDiarmid's inequality, a central tool in statistical learning theory and algorithm analysis. We show that large deviations above the mean are exponentially unlikely for functions of independent random variables that are almost surely bounded above and satisfy a conditional moment assumption of order $p\in(1,2]$. When $p