Fractional Pseudorandom Generators from Any Fourier Level

08/04/2020
βˆ™
by   Eshan Chattopadhyay, et al.
βˆ™
0
βˆ™

We prove new results on the polarizing random walk framework introduced in recent works of Chattopadhyay et al. [CHHL19,CHLT19] that exploit L_1 Fourier tail bounds for classes of Boolean functions to construct pseudorandom generators (PRGs). We show that given a bound on the k-th level of the Fourier spectrum, one can construct a PRG with a seed length whose quality scales with k. This interpolates previous works, which either require Fourier bounds on all levels [CHHL19], or have polynomial dependence on the error parameter in the seed length [CHLT10], and thus answers an open question in [CHLT19]. As an example, we show that for polynomial error, Fourier bounds on the first O(log n) levels is sufficient to recover the seed length in [CHHL19], which requires bounds on the entire tail. We obtain our results by an alternate analysis of fractional PRGs using Taylor's theorem and bounding the degree-k Lagrange remainder term using multilinearity and random restrictions. Interestingly, our analysis relies only on the level-k unsigned Fourier sum, which is potentially a much smaller quantity than the L_1 notion in previous works. By generalizing a connection established in [CHH+20], we give a new reduction from constructing PRGs to proving correlation bounds. Finally, using these improvements we show how to obtain a PRG for 𝔽_2 polynomials with seed length close to the state-of-the-art construction due to Viola [Vio09], which was not known to be possible using this framework.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

βˆ™ 02/06/2019

Fourier bounds and pseudorandom generators for product tests

We study the Fourier spectrum of functions f{0,1}^mk→{-1,0,1} which can ...
βˆ™ 08/19/2018

Pseudorandom Generators for Read-Once Branching Programs, in any Order

A central question in derandomization is whether randomized logspace (RL...
βˆ™ 07/22/2021

Fourier growth of structured 𝔽_2-polynomials and applications

We analyze the Fourier growth, i.e. the L_1 Fourier weight at level k (d...
βˆ™ 03/13/2021

Fooling Gaussian PTFs via Local Hyperconcentration

We give a pseudorandom generator that fools degree-d polynomial threshol...
βˆ™ 06/11/2018

Pseudorandom Generators for Width-3 Branching Programs

We construct pseudorandom generators of seed length Γ•((n)Β·(1/Ο΅)) that Ο΅-...
βˆ™ 01/20/2021

Positive spectrahedra: Invariance principles and Pseudorandom generators

In a recent work, O'Donnell, Servedio and Tan (STOC 2019) gave explicit ...
βˆ™ 08/13/2018

Fooling Polytopes

We give a pseudorandom generator that fools m-facet polytopes over {0,1}...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.