Fooling Gaussian PTFs via Local Hyperconcentration

Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan, Daniel Kane

We give a pseudorandom generator that fools degree-$d$ polynomial threshold functions over $n$-dimensional Gaussian space with seed length $\mathrm{poly}(d)\cdot \log n$. All previous generators had a seed length with at least a $2^d$ dependence on $d$. The key new ingredient is a Local Hyperconcentration Theorem, which shows that every degree-$d$ Gaussian polynomial is hyperconcentrated almost everywhere at scale $d^{-O(1)}$.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment