Tight Probability Bounds with Pairwise Independence
Arjun Ramachandra, Karthik Natarajan

TL;DR
This paper derives tight probability bounds for sums of pairwise independent Bernoulli variables, providing closed-form solutions and analyzing their applications in correlation and optimization problems.
Contribution
It introduces the first tight upper bound for the union probability with pairwise independence and extends the analysis to lower bounds and bounds for sums with larger thresholds.
Findings
Closed-form tight upper bound for union probability when k=1.
Ratio of Boole bound to tight bound is at most 4/3, and this is tight.
New bounds improve upon existing bounds in specific probability configurations.
Abstract
While useful probability bounds for pairwise independent Bernoulli random variables adding up to at least an integer have been proposed in the literature, none of these bounds are tight in general. In this paper, we provide several results in this direction. Firstly, when , the tightest upper bound on the probability of the union of pairwise independent events is provided in closed-form for any input marginal probability vector . To prove the result, we show the existence of a positively correlated Bernoulli random vector with transformed bivariate probabilities, which is of independent interest. Building on this, we show that the ratio of the Boole union bound and the tight pairwise independent bound is upper bounded by and that the ratio is attained. Applications of the result in correlation gap analysis and distributionally robust…
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
TopicsRisk and Portfolio Optimization · Probabilistic and Robust Engineering Design · Statistical Methods and Inference
