Generalizations of Maximal Inequalities to Arbitrary Selection Rules
Jiantao Jiao, Yanjun Han, Tsachy Weissman

TL;DR
This paper extends classical maximal inequalities to arbitrary selection rules, providing tighter bounds and introducing new information-theoretic measures that could be useful beyond the scope of the inequalities.
Contribution
It generalizes maximal inequalities for arbitrary selection rules and introduces novel information-theoretic measures for tighter bounds.
Findings
Bounds are at least as tight as classical inequalities.
Bounds become significantly tighter when the selection index distribution is near deterministic.
New information-theoretic measures are introduced, potentially useful independently.
Abstract
We present a generalization of the maximal inequalities that upper bound the expectation of the maximum of jointly distributed random variables. We control the expectation of a randomly selected random variable from jointly distributed random variables, and present bounds that are at least as tight as the classical maximal inequalities, and much tighter when the distribution of selection index is near deterministic. A new family of information theoretic measures were introduced in the process, which may be of independent interest.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Sensor Networks and Detection Algorithms · Bayesian Modeling and Causal Inference · Statistical Methods and Inference
