Abstract
We prove new bounds on the average sensitivity of polynomial threshold functions. In particular, we show that for f, a degree-d polynomial threshold function in n variables that
This bound amounts to a significant improvement over previous bounds, and in particular, for fixed d gives the same asymptotic exponent of n as the one predicted by the Gotsman–Linial Conjecture.
Similar content being viewed by others
References
Aline Bonami (1970). Étude des coefficients Fourier des fonctions de L p(G). Annales de l’Institute Fourier 20(2), 335–402.
Carbery A., Wright J. (2001) Distributional and Lq norm in equalities for polynomials over convex bodies in \({\mathbb{R}^n}\). Mathematical Research Letters 8(3): 233–248
Ilias Diakonikolas, Prahladh Harsha, Adam Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio & Li-Yang Tan (2010a). Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. Proceedings of the 42nd ACM sympo sium on Theory of computing (STOC).
Ilias Diakonikolas, Prasad Raghavendra, Rocco A. Serve dio & Li-Yang Tan (2009). Average sensitivity and noise sensitiv- ity of polynomial threshold functions. Manuscript available at http://arxiv.org/abs/0909.501.
Ilias Diakonikolas, Rocco Servedio, Li-Yang Tan & Andrew Wan (2010b). A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions. 25th Conference on Computational Complexity (CCC).
Gotsman C., Linial N. (1994) Spectral properties of threshold functions. Combinatorica 14(10): 35–50
Prahladh Harsha, Adam Klivans & Raghu Meka (2009). Bound ing the Sensitivity of Polynomial Threshold Functions. Manuscript available at http://arxiv.org/abs/0909.517.
Svante Janson (1997). Gaussian Hilbert Spaces. Cambridge Univer sity Press.
Daniel M. Kane (2010). The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions. Proceedings of the 25th annual IEEE Conference on Computational Complexity (CCC) 25, 205–210.
Daniel M. Kane (2011a). A Small PRG for Polynomial Threshold Functions of Gaussians. Symposium on the Foundations Of Computer Science (FOCS).
Daniel M. Kane (2011b). A Structure Theorem for Poorly Anticon centrated Gaussian Chaoses and Applications to the Study of Polyno mial Threshold Functions. Manuscript available at http://arxiv.org/abs/1204.054.
Mossel E. (2010) Gaussian Bounds for Noise Correlation of Functions. GAFA 19: 1713–1756
E. Mossel, R. O’Donnell & K. Oleszkiewicz (2005). Noise stability of functions with low influences: invariance and optimality. Proceedings of the 46th Symposium on Foundations of Computer Science (FOCS) 46, 21–30.
Nelson (1973). The free Markov field. J. Func. Anal. 12(2), 211–227.
PaleyR.E. A. C., Zygmund A. (1932) A note on analytic functions in the unit circle. Proc. Camb. Phil. Soc. 28: 266–272
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kane, D.M. The correct exponent for the Gotsman–Linial Conjecture. comput. complex. 23, 151–175 (2014). https://doi.org/10.1007/s00037-014-0086-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-014-0086-z