Saved in:
Bibliographic Details
Main Authors: Ramachandra, Arjun, Natarajan, Karthik
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2209.08563
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910844345909248
author Ramachandra, Arjun
Natarajan, Karthik
author_facet Ramachandra, Arjun
Natarajan, Karthik
contents In this paper, we introduce the notion of a ``pairwise independent correlation gap'' for set functions with random elements. The pairwise independent correlation gap is defined as the ratio of the maximum expected value of a set function with arbitrary dependence among the elements with fixed marginal probabilities to the maximum expected value with pairwise independent elements with the same marginal probabilities. We show that for any nonnegative monotone submodular set function defined on $n$ elements, this ratio is upper bounded by $4/3$ in the following two cases: (a) $n = 3$ for all marginal probabilities and (b) all $n$ for small marginal probabilities (and similarly large marginal probabilities). This differs from the bound on the ``correlation gap'' which holds with mutual independence and showcases the fundamental difference between pairwise independence and mutual independence. We discuss the implication of the results with two examples and end the paper with a conjecture.
format Preprint
id arxiv_https___arxiv_org_abs_2209_08563
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Pairwise independent correlation gap
Ramachandra, Arjun
Natarajan, Karthik
Optimization and Control
Artificial Intelligence
Machine Learning
Probability
90C27
In this paper, we introduce the notion of a ``pairwise independent correlation gap'' for set functions with random elements. The pairwise independent correlation gap is defined as the ratio of the maximum expected value of a set function with arbitrary dependence among the elements with fixed marginal probabilities to the maximum expected value with pairwise independent elements with the same marginal probabilities. We show that for any nonnegative monotone submodular set function defined on $n$ elements, this ratio is upper bounded by $4/3$ in the following two cases: (a) $n = 3$ for all marginal probabilities and (b) all $n$ for small marginal probabilities (and similarly large marginal probabilities). This differs from the bound on the ``correlation gap'' which holds with mutual independence and showcases the fundamental difference between pairwise independence and mutual independence. We discuss the implication of the results with two examples and end the paper with a conjecture.
title Pairwise independent correlation gap
topic Optimization and Control
Artificial Intelligence
Machine Learning
Probability
90C27
url https://arxiv.org/abs/2209.08563