2017/04/17 by Rocco A. Servedio, Servedio, Rocco A., Li-Yang Tan +1
Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptography and Data Security #FOS: Computer and information sciences #Machine Learning and Algorithms
paper · pdf · doi:10.48550/arxiv.1704.04855
openalex publication_date 2017/04/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A weight-t halfspace is a Boolean function f(x)=sign(w1 x1 + ⋯ + wn xn - θ) where each wi is an integer in \-t,…,t\. We give an explicit pseudorandom generator that δ-fools any intersection of k weight-t halfspaces with seed length poly(log n, log k,t,1/δ). In particular, our result gives an explicit PRG that fools any intersection of any quasipoly(n) number of halfspaces of any polylog(n) weight to any 1/polylog(n) accuracy using seed length polylog(n). Prior to this work no explicit PRG with non-trivial seed length was known even for fooling intersections of n weight-1 halfspaces to constant accuracy. The analysis of our PRG fuses techniques from two different lines of work on unconditional pseudorandomness for different kinds of Boolean functions. We extend the approach of Harsha, Klivans and Meka \citeHKM12 for fooling intersections of regular halfspaces, and combine this approach with results of Bazzi \citeBazzi:07 and Razborov \citeRazborov:09 on bounded independence fooling CNF formulas. Our analysis introduces new coupling-based ingredients into the standard Lindeberg method for establishing quantitative central limit theorems and associated pseudorandomness results.