Simple and efficient pseudorandom generators from Gaussian processes

Eshan Chattopadhyay, Anindya De, Rocco A. Servedio

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show that a very simple pseudorandom generator fools intersections of k linear threshold functions (LTFs) and arbitrary functions of k LTFs over n-dimensional Gaussian space. The two analyses of our PRG (for intersections versus arbitrary functions of LTFs) are quite different from each other and from previous analyses of PRGs for functions of halfspaces. Our analysis for arbitrary functions of LTFs establishes bounds on the Wasserstein distance between Gaussian random vectors with similar covariance matrices, and combines these bounds with a conversion from Wasserstein distance to “union-of-orthants” distance from [5]. Our analysis for intersections of LTFs uses extensions of the classical Sudakov-Fernique type inequalities, which give bounds on the difference between the expectations of the maxima of two Gaussian random vectors with similar covariance matrices. For all values of k, our generator has seed length O(log n) + poly(k) for arbitrary functions of k LTFs and O(log n) + poly(log k) for intersections of k LTFs. The best previous result, due to [14], only gave such PRGs for arbitrary functions of k LTFs when k = O(log log n) and for intersections of k LTFs when k = O(logloglognn). Thus our PRG achieves an O(log n) seed length for values of k that are exponentially larger than previous work could achieve. By combining our PRG over Gaussian space with an invariance principle for arbitrary functions of LTFs and with a regularity lemma, we obtain a deterministic algorithm that approximately counts satisfying assignments of arbitrary functions of k general LTFs over {0, 1}n in time poly(n)·2poly(k,1/ε) for all values of k. This algorithm has a poly(n) runtime for k = (log n)c for some absolute constant c > 0, while the previous best poly(n)-time algorithms could only handle k = O(log log n). For intersections of LTFs, by combining these tools with a recent PRG due to [28], we obtain a deterministic algorithm that can approximately count satisfying assignments of intersections of k general LTFs over {0, 1}n in time poly(n) · 2poly(log k,1/ε). This algorithm has a poly(n) runtime for k = 2(log n)c for some absolute constant c > 0, while the previous best poly(n)-time algorithms for intersections of k LTFs, due to [14], could only handle k = O(logloglognn).

Original languageEnglish (US)
Title of host publication34th Computational Complexity Conference, CCC 2019
EditorsAmir Shpilka
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771160
DOIs
StatePublished - Jul 1 2019
Event34th Computational Complexity Conference, CCC 2019 - New Brunswick, United States
Duration: Jul 18 2019Jul 20 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume137
ISSN (Print)1868-8969

Conference

Conference34th Computational Complexity Conference, CCC 2019
CountryUnited States
CityNew Brunswick
Period7/18/197/20/19

Keywords

  • Gaussian processes
  • Johnson-lindenstrauss
  • Polynomial threshold functions
  • Pseudorandom generators

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Simple and efficient pseudorandom generators from Gaussian processes'. Together they form a unique fingerprint.

Cite this