Concentration inequalities for strong laws and laws of the iterated logarithm
By: Johannes Ruf, Ian Waudby-Smith
Potential Business Impact:
Makes math rules for guessing more accurate.
We derive concentration inequalities for sums of independent and identically distributed random variables that yield non-asymptotic generalizations of several strong laws of large numbers including some of those due to Kolmogorov [1930], Marcinkiewicz and Zygmund [1937], Chung [1951], Baum and Katz [1965], Ruf, Larsson, Koolen, and Ramdas [2023], and Waudby-Smith, Larsson, and Ramdas [2024]. As applications, we derive non-asymptotic iterated logarithm inequalities in the spirit of Darling and Robbins [1967], as well as pathwise (sometimes described as "game-theoretic") analogues of strong laws and laws of the iterated logarithm.
Similar Papers
Sub-Poisson distributions: Concentration inequalities, optimal variance proxies, and closure properties
Probability
Makes math tools work better for predicting random events.
Matrix concentration inequalities for dependent binary random variables
Probability
Helps computers understand random data better.
The law of iterated logarithm for numerical approximation of time-homogeneous Markov process
Numerical Analysis
Makes computer math models more accurate over time.