Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions
نویسندگان
چکیده
منابع مشابه
Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions
We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of degree-d polynomial threshold functions (PTFs). These bounds hold both for PTFs over the Boolean hypercube {−1, 1}n and for multilinear PTFs over R n under the standard n-dimensional Gaussian distribution N (0, In). Our bound on the Boolean average sensitivity of PTFs represents progress towards the r...
متن کاملBounding the Sensitivity of Polynomial Threshold Functions
We give the first nontrivial 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 • The average sensitivity of f is at most O(n1−1/(4d+6)). (We also give a combinatorial proof of the bound O(n1−1/2 d ).) • The noi...
متن کاملHeat and Noise on Cubes and Spheres: The Sensitivity of Randomly Rotated Polynomial Threshold Functions
We establish a precise relationship between spherical harmonics and Fourier basis functions over a hypercube randomly embedded in the sphere. In particular, we give a bound on the expected Boolean noise sensitivity of a randomly rotated function in terms of its “spherical sensitivity,” which we define according to its evolution under the spherical heat equation. As an application, we prove an a...
متن کاملNoise sensitivity of Boolean functions
The notion of noise sensitivity was introduced by Benjamini, Kalai, and Schramm in 1998 [3], in the context of percolation theory. Since then noise sensitivity has found applications in many fields, including concentration of measure, social choice theory, and theoretical computer science. Say we have n people voting for one of two candidates, D or R. One can write their choices as ω = (ω(1), ....
متن کاملNoise sensitivity of Boolean functions and percolation
The notion of noise sensitivity was introduced by Benjamini, Kalai, and Schramm in 1998 [3], in the context of percolation theory. Since then noise sensitivity has found applications in many fields, including concentration of measure, social choice theory, and theoretical computer science. Say we have n people voting for one of two candidates, D or R. One can write their choices as ω = (ω(1), ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2014
ISSN: 0097-5397,1095-7111
DOI: 10.1137/110855223