Noise Correlation Bounds for Uniform Low Degree Functions
Per Austrin, Elchanan Mossel

TL;DR
This paper establishes correlation bounds for low-degree, uniform functions under pairwise independent distributions, with implications for complexity theory and additive combinatorics.
Contribution
It provides new bounds for correlations of low-degree, uniform functions under pairwise independence, extending hypercontractivity techniques to multilinear cases.
Findings
Correlation is close to zero under specified conditions.
Bounds extend previous results for low influence functions.
Connections to additive combinatorics and Gowers norm.
Abstract
We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by are called -{\em uniform}. The search for such bounds is motivated by their potential applicability to hardness of approximation, derandomization, and additive combinatorics. In our main result we show that is close to 0 under the following assumptions: 1. The vectors are i.i.d, and for each the vector has a pairwise independent distribution. 2. The functions are uniform. 3. The functions are of low degree. We compare our result with recent results by the second author for low influence functions and to recent results in additive combinatorics using the…
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
TopicsLimits and Structures in Graph Theory · Complexity and Algorithms in Graphs · Mathematical Approximation and Integration
