Skip to main content
Log in

The correct exponent for the Gotsman–Linial Conjecture

  • Published:
computational complexity Aims and scope Submit manuscript

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

$$\mathbb{AS}(f) \leq \sqrt{n}(\log(n))^{O(d log(d))}2^{O(d^2 log(d))}.$$

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aline Bonami (1970). Étude des coefficients Fourier des fonctions de L p(G). Annales de l’Institute Fourier 20(2), 335–402.

  2. 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

    Article  MATH  MathSciNet  Google Scholar 

  3. 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).

  4. 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.

  5. 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).

  6. Gotsman C., Linial N. (1994) Spectral properties of threshold functions. Combinatorica 14(10): 35–50

    Article  MATH  MathSciNet  Google Scholar 

  7. Prahladh Harsha, Adam Klivans & Raghu Meka (2009). Bound ing the Sensitivity of Polynomial Threshold Functions. Manuscript available at http://arxiv.org/abs/0909.517.

  8. Svante Janson (1997). Gaussian Hilbert Spaces. Cambridge Univer sity Press.

  9. 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.

  10. Daniel M. Kane (2011a). A Small PRG for Polynomial Threshold Functions of Gaussians. Symposium on the Foundations Of Computer Science (FOCS).

  11. 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.

  12. Mossel E. (2010) Gaussian Bounds for Noise Correlation of Functions. GAFA 19: 1713–1756

    MATH  MathSciNet  Google Scholar 

  13. 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.

  14. Nelson (1973). The free Markov field. J. Func. Anal. 12(2), 211–227.

  15. PaleyR.E. A. C., Zygmund A. (1932) A note on analytic functions in the unit circle. Proc. Camb. Phil. Soc. 28: 266–272

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daniel M. Kane.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-014-0086-z

Keywords

Subject Classification

Navigation