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))}.$$ AS ( f ) ≤ n ( log ( n ) ) O ( d l o g ( d ) ) 2 O ( d 2 l o g ( 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call