Bounding the Sensitivity of Polynomial Threshold Functions

Details Bounding the Sensitivity of Polynomial Threshold Functions Bounding the Sensitivity of Polynomial Threshold Functions

2009-09-28

arxiv.org/abs/0909.5175v4

Computer Science

Computational Complexity

Fixed an important flaw. Some proofs are simplified from last version

Scientific paper

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial of total degree d we prove 1) The average sensitivity of f is at most O(n^{1-1/(4d+6)}) (we also give a combinatorial proof of the bound O(n^{1-1/2^d}). 2) The noise sensitivity of f with noise rate \delta is at most O(\delta^{1/(4d+6)}). Previously, only bounds for the linear case were known. Along the way we show new structural theorems about random restrictions of polynomial threshold functions obtained via hypercontractivity. These structural results may be of independent interest as they provide a generic template for transforming problems related to polynomial threshold functions defined on the Boolean hypercube to polynomial threshold functions defined in Gaussian space.

Affiliated with

Also associated with

No associations

Rating

Bounding the Sensitivity of Polynomial Threshold Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounding the Sensitivity of Polynomial Threshold Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounding the Sensitivity of Polynomial Threshold Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-235848