ABSTRACT
We construct pseudorandom generators for combinatorial shapes, which substantially generalize combinatorial rectangles, ε-biased spaces, 0/1 halfspaces, and 0/1 modular sums. A function f:[m]n -> {0,1} is an (m,n)-combinatorial shape if there exist sets A1,...,An ⊆ [m] and a symmetric function h:{0,1}n -> {0,1} such that f(x1,...,xn) = h(1A1(x1),...,1An(xn)). Our generator uses seed length O(log m + log n + log2(1/ε)) to get error ε. When m = 2, this gives the first generator of seed length O(log n) which fools all weight-based tests, meaning that the distribution of the weight of any subset is ε-close to the appropriate binomial distribution in statistical distance. For our proof we give a simple lemma which allows us to convert closeness in Kolmogorov (cdf) distance to closeness in statistical distance. As a corollary of our technique, we give an alternative proof of a powerful variant of the classical central limit theorem showing convergence in statistical distance, instead of the usual Kolmogorov distance.
Supplemental Material
- N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms, 3(3):289--303, 1992.Google Scholar
Cross Ref
- R. Armoni, M. Saks, A. Wigderson, and S. Zhou. Discrepancy sets and pseudorandom generators for combinatorial rectangles. In FOCS '96, pages 412--421, 1996. Google Scholar
Digital Library
- Louay M. J. Bazzi. Polylogarithmic independence can fool dnf formulas. SIAM J. Comput., 38(6):2220--2272, 2009. Google Scholar
Digital Library
- A. D. Barbour and V. Cekanavicius. Total variation asymptotics for sums of independent integer random variables. The Annals of Probability, 30(2):509--545, 2002.Google Scholar
Cross Ref
- Andrew D. Barbour and Aihua Xia. Poisson perturbations. ESAIM, 3:131--150, october 1999.Google Scholar
Cross Ref
- Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, and Emanuele Viola. Bounded independence fools halfspaces. SIAM J. Comput., 39(8):3441--3462, 2010. Google Scholar
Digital Library
- Constantinos Daskalakis and Christos H. Papadimitriou. Computing equilibria in anonymous games. In FOCS '07, pages 83--93, 2007. Google Scholar
Digital Library
- Constantinos Daskalakis and Christos H. Papadimitriou. Discretized multinomial distributions and nash equilibria in anonymous games. In FOCS '08, pages 23--34, 2008. Google Scholar
Digital Library
- 2}eglnvG. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velicković. Approximations of general independent distributions. In STOC '92, pages 10--16, 1992. Google Scholar
Digital Library
- William Feller. An Introduction to Probability Theory and Its Applications, Vol. 2 (Volume 2). Wiley, 2 edition, January 1971.Google Scholar
- Iftach Haitner, Danny Harnik, and Omer Reingold. On the power of the randomized iterate. In CRYPTO '06, pages 22--40, 2006. Google Scholar
Digital Library
- Piotr Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. In FOCS '00), pages 189--197. 2000. Google Scholar
Digital Library
- Russell Impagliazzo, Noam Nisan, and Avi Wigderson. Pseudorandomness for network algorithms. In STOC '94, pages 356--364, 1994. Google Scholar
Digital Library
- Eyal Kaplan, Moni Naor, and Omer Reingold. Derandomized constructions of k-wise (almost) independent permutations. In RANDOM '05, number 3624 in Lecture Notes in Computer Science, pages 354 -- 365, Berkeley, CA, August 2005. Springer. Google Scholar
Digital Library
- Shachar Lovett, Omer Reingold, Luca Trevisan, and Salil P. Vadhan. Pseudorandom bit generators that fool modular sums. In APPROX-RANDOM '09, pages 615--630, 2009. Google Scholar
Digital Library
- Chi-Jen Lu. Improved pseudorandom generators for combinatorial rectangles. Combinatorica, 22:417--434, 2002.Google Scholar
Cross Ref
- J. Matousek. Geometric Discrepancy. Springer, 1999.Google Scholar
- R. Meka and D. Zuckerman. Small-bias spaces over finite groups. In APPROX-RANDOM '09, 2009.Google Scholar
- Raghu Meka and David Zuckerman. Pseudorandom generators for polynomial threshold functions. In STOC '10, pages 427--436, 2010. Google Scholar
Digital Library
- Noam Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449--461, 1992.Google Scholar
Cross Ref
- J. Naor and M. Naor. Small--bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4):838--856, 1993. Google Scholar
Digital Library
- Noam Nisan and David Zuckerman. Randomness is linear in space. J. Comput. Syst. Sci., 52(1):43--52, 1996. Google Scholar
Digital Library
- Yuval Rabani and Amir Shpilka. Explicit construction of a small epsilon-net for linear threshold functions. SIAM J. Comput., 39(8):3501--3520, 2010. Google Scholar
Digital Library
- I. G. Shevtsova. Sharpening of the upper bound of the absolute constant in the berry--esseen inequality. Theory of Probability and its Applications, 51(3):549--553, 2007.Google Scholar
Cross Ref
- D. Sivakumar. Algorithmic derandomization via complexity theory. In STOC '02, pages 619--626, 2002. Google Scholar
Digital Library
- Thomas Watson. Pseudorandom generators for combinatorial checkerboards. In IEEE Conference on Computational Complexity, 2011. To Appear. Google Scholar
Digital Library
Index Terms
Pseudorandom generators for combinatorial shapes
Recommendations
Better Pseudorandom Generators from Milder Pseudorandom Restrictions
FOCS '12: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer ScienceWe present an iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and read-once CNFs and ...
Pseudorandom generators for polynomial threshold functions
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computingWe study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed-length log n/εO(d) fooling degree d PTFs with error at most ε. Previously, no nontrivial ...
Improved pseudorandom generators for depth 2 circuits
APPROX/RANDOM'10: Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniquesWe prove the existence of a poly(n,m)-time computable pseudorandom generator which "1/poly(n,m)-fools" DNFs with n variables and m terms, and has seed length O(log2nm ċ log log nm). Previously, the best pseudorandom generator for depth-2 circuits had ...






Comments