21,630 research outputs found
The Average Sensitivity of an Intersection of Half Spaces
We prove new bounds on the average sensitivity of the indicator function of
an intersection of halfspaces. In particular, we prove the optimal bound of
. This generalizes a result of Nazarov, who proved the
analogous result in the Gaussian case, and improves upon a result of Harsha,
Klivans and Meka. Furthermore, our result has implications for the runtime
required to learn intersections of halfspaces
A Polylogarithmic PRG for Degree Threshold Functions in the Gaussian Setting
We devise a new pseudorandom generator against degree 2 polynomial threshold
functions in the Gaussian setting. We manage to achieve error with
seed length polylogarithmic in and the dimension, and exponential
improvement over previous constructions
A Pseudorandom Generator for Polynomial Threshold Functions of Gaussian with Subpolynomial Seed Length
We develop a pseudorandom generator that fools degree- polynomial
threshold functions in variables with respect to the Gaussian distribution
and has seed length
A Small PRG for Polynomial Threshold Functions of Gaussians
We develop a pseudo-random generator to fool degree- polynomial threshold
functions with respect to the Gaussian distribution. For any constant, we
construct a pseudo-random generator that fools such functions to within
and has seed length
- …