License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CCC.2016.13
URN: urn:nbn:de:0030-drops-58488
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/5848/
Gopalan, Parikshit ;
Servedio, Rocco A. ;
Wigderson, Avi
Degree and Sensitivity: Tails of Two Distributions
Abstract
The sensitivity of a Boolean function f is the maximum, over all inputs x, of the number of sensitive coordinates of x (namely the number of Hamming neighbors of x with different f-value). The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean function can be computed by a polynomial over the reals of degree s^{O(1)}. The best known upper bounds on degree, however, are exponential rather than polynomial in s.
Our main result is an approximate version of the conjecture: every Boolean function with sensitivity s can be eps-approximated (in l_2) by a polynomial whose degree is s * polylog(1/eps). This is the first improvement on the folklore bound of s/eps. We prove this via a new "switching lemma for low-sensitivity functions" which establishes that a random restriction of a low-sensitivity function is very likely to have low decision tree depth. This is analogous to the well-known switching lemma for AC^0 circuits.
Our proof analyzes the combinatorial structure of the graph G_f of sensitive edges of a Boolean function f. Understanding the structure of this graph is of independent interest as a means of understanding Boolean functions. We propose several new complexity measures for Boolean functions based on this graph, including tree sensitivity and component dimension, which may be viewed as relaxations of worst-case sensitivity, and we introduce some new techniques, such as proper walks and shifting, to analyze these measures. We use these notions to show that the graph of a function of full degree must be sufficiently complex, and that random restrictions of low-sensitivity functions are unlikely to lead to such complex graphs.
We postulate a robust analogue of the sensitivity conjecture: if most inputs to a Boolean function f have low sensitivity, then most of the Fourier mass of f is concentrated on small subsets. We prove a lower bound on tree sensitivity in terms of decision tree depth, and show that a polynomial strengthening of this lower bound implies the robust conjecture. We feel that studying the graph G_f is interesting in its own right, and we hope that some of the notions and techniques we introduce in this work will be of use in its further study.
BibTeX - Entry
@InProceedings{gopalan_et_al:LIPIcs:2016:5848,
author = {Parikshit Gopalan and Rocco A. Servedio and Avi Wigderson},
title = {{Degree and Sensitivity: Tails of Two Distributions}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {13:1--13:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Ran Raz},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5848},
URN = {urn:nbn:de:0030-drops-58488},
doi = {10.4230/LIPIcs.CCC.2016.13},
annote = {Keywords: Boolean functions, random restrictions, Fourier analysis }
}
|
Keywords: |
|
Boolean functions, random restrictions, Fourier analysis |
|
Collection: |
|
31st Conference on Computational Complexity (CCC 2016) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
19.05.2016 |
