Name
Abstract | ||
|---|---|---|
We construct pseudorandom generators that fool functions of halfspaces (threshold functions) under a very broad class of product distributions. This class includes not only familiar cases such as the uniform distribution on the discrete cube, the uniform distribution on the solid cube, and the multivariate Gaussian distribution, but also includes any product of discrete distributions with probabilities bounded away from 0. Our first main result shows that a recent pseudorandom generator construction of Meka and Zuckerman , when suitably modified, can fool arbitrary functions of d halfspaces under product distributions where each coordinate has bounded fourth moment. To e-fool any size-s, depth-d decision tree of halfspaces, our pseudorandom generator uses seed length O((dlog(ds/∈) + log n)·log(ds/∈)). For monotone functions of d halfspaces, the seed length can be improved to O((dlog(d/∈) + logn) · log(d/∈)). We get better bounds for larger e; for example, to l/polylog(n)-fool all monotone functions of (log n)l log log n halfspaces, our generator requires a seed of length just O(logn). Our second main result generalizes the work of Diakonikolas et al. to show that bounded independence suffices to fool functions of halfspaces under product distributions. Assuming each coordinate satisfies a certain stronger moment condition, we show that any function computable by a size-s, depth-d decision tree of halfspaces is e-fooled by Õ(d4s2/∈2)-wise independence. Our technical contributions include: a new multidimensional version of the classical Berry-Esseen theorem; a derandomization thereof; a generalization of Servedio's regularity lemma for halfspaces which works under any product distribution with bounded fourth moments; an extension of this regularity lemma to functions of many halfspaces; and, new analysis of the sandwiching polynomials technique of Bazzi for arbitrary pro- - duct distributions. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/CCC.2010.29 | Electronic Colloquium on Computational Complexity (ECCC) |
Keywords | DocType | Volume |
product distributions,fooling functions,decision trees,random variables,neural networks,monotone function,product distribution,generators,uniform distribution,satisfiability,machine learning,approximation algorithms,computational complexity,polynomials,circuits,decision tree,gaussian distribution,computer science,discrete distribution,indexes,multivariate gaussian distribution,solids | Journal | abs/1001.1593 |
ISSN | ISBN | Citations |
1093-0159 E-ISBN : 978-1-4244-7215-4 | 978-1-4244-7215-4 | 20 |
PageRank | References | Authors |
1.02 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Parikshit Gopalan | 1 | 1186 | 61.52 |
| Ryan O'Donnell | 2 | 944 | 72.84 |
| Yi Wu | 3 | 122 | 6.77 |
| David Zucherman | 4 | 2588 | 266.65 |