@proceedings {671765,
	title = {Pseudodistributions that beat all pseudorandom generators},
	journal = {36th Annual Computational Complexity Conference (CCC {\textquoteright}21) },
	volume = {200},
	year = {2021},
	pages = {33:1-33:15},
	publisher = {Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum f{\"u}r Informatik },
	abstract = {
	Version History:\&nbsp;Full Version posted as ECC TR21-019. Invited to\&nbsp;Theory of Computing\&nbsp;Special Issue on CCC {\textquoteright}21.



	Abstract:



	A recent paper of Braverman, Cohen, and Garg (STOC 2018) introduced the concept of a pseudorandom pseudodistribution generator (PRPG), which amounts to a pseudorandom generator (PRG) whose outputs are accompanied with real coefficients that scale the acceptance probabilities of any potential distinguisher. They gave an explicit construction of PRPGs for ordered branching programs whose seed length has a better dependence on the error parameter\&nbsp;\&nbsp;than the classic PRG construction of Nisan (STOC 1990 and Combinatorica 1992).In this work, we give an explicit construction of PRPGs that achieve parameters that are impossible to achieve by a PRG. In particular, we construct a PRPG for ordered permutation branching programs of unbounded width with a single accept state that has seed length\&nbsp;\(\tilde{O}(\log^{3/2}n)\)\&nbsp; for error parameter\&nbsp;\(\&nbsp;\epsilon = 1/ \mathrm{poly}(n)\), where\&nbsp;\(n\)\&nbsp;is the input length. In contrast, recent work of Hoza et al. (ITCS 2021) shows that any PRG for this model requires seed length\&nbsp;\(\&nbsp;\Omega(\log^2n)\)\&nbsp;to achieve error \(\&nbsp;\epsilon = 1/ \mathrm{poly}(n)\).As a corollary, we obtain explicit PRPGs with seed length\&nbsp;\(\tilde{O}(\log^{3/2}n)\)\&nbsp;\&nbsp;and error\&nbsp;\(\&nbsp;\epsilon = 1/ \mathrm{poly}(n)\)\&nbsp;for ordered permutation branching programs of width\&nbsp;\(w = \mathrm{poly}(n)\&nbsp;\)with an arbitrary number of accept states. Previously, seed length\&nbsp;\(o(\log^2n)\) was only known when both the width and the reciprocal of the error are subpolynomial, i.e.\&nbsp;\(w= n^{o(1)}\&nbsp;\)\&nbsp;and \(\epsilon = 1/n^{o(1)}\)(Braverman, Rao, Raz, Yehudayoff, FOCS 2010 and SICOMP 2014).The starting point for our results are the recent space-efficient algorithms for estimating random-walk probabilities in directed graphs by Ahmadenijad, Kelner, Murtagh, Peebles, Sidford, and Vadhan (FOCS 2020), which are based on spectral graph theory and space-efficient Laplacian solvers. We interpret these algorithms as giving PRPGs with large seed length, which we then derandomize to obtain our results. We also note that this approach gives a simpler proof of the original result of Braverman, Cohen, and Garg, as independently discovered by Cohen, Doron, Renard, Sberlo, and Ta-Shma (personal communication, January 2021).

},
	url = {https://drops.dagstuhl.de/opus/volltexte/2021/14307/pdf/LIPIcs-CCC-2021-33.pdf},
	author = {Edward Pyne and Salil Vadhan}
}
