LIPIcs.CCC.2018.2.pdf
- Filesize: 0.59 MB
- 24 pages
Document
A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n
Authors
-
Part of:
Volume:
33rd Computational Complexity Conference (CCC 2018)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computational Complexity Conference (CCC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2018-06-04
Cite AsGet BibTex
Daniel Kane and Sankeerth Rao. A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n. In 33rd Computational Complexity Conference (CCC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 102, pp. 2:1-2:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.CCC.2018.2
https://doi.org/10.4230/LIPIcs.CCC.2018.2
Abstract
We construct and analyze a pseudorandom generator for degree 2 boolean polynomial threshold functions. Random constructions achieve the optimal seed length of O(log n + log 1/epsilon), however the best known explicit construction of [Ilias Diakonikolas, 2010] uses a seed length of O(log n * epsilon^{-8}). In this work we give an explicit construction that uses a seed length of O(log n + (1/epsilon)^{o(1)}). Note that this improves the seed length substantially and that the dependence on the error epsilon is additive and only grows subpolynomially as opposed to the previously known multiplicative polynomial dependence.
Our generator uses dimensionality reduction on a Nisan-Wigderson based pseudorandom generator given by Lu, Kabanets [Kabanets and Lu, 2018].
Subject Classification
ACM Subject Classification
- Theory of computation → Pseudorandomness and derandomization
Keywords
- Pseudorandomness
- Polynomial Threshold Functions
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
J. Wright A. Carbery. Distributional and l^q norm inequalities for polynomials over convex bodies in ℝⁿ. Mathematical Research Letters, 2001.
- Richard Beigel. The polynomial method in circuit complexity. In Proceedings of the Eigth Annual Structure in Complexity Theory Conference, San Diego, CA, USA, May 18-21, 1993, pages 82-95. IEEE Computer Society, 1993. URL: http://dx.doi.org/10.1109/SCT.1993.336538.
- Anindya De, Ilias Diakonikolas, and Rocco A. Servedio. Deterministic approximate counting for degree-dollar2dollar polynomial threshold functions. CoRR, abs/1311.7105, 2013. URL: http://arxiv.org/abs/1311.7105.
- Anindya De and Rocco A. Servedio. Efficient deterministic approximate counting for low-degree polynomial threshold functions. CoRR, abs/1311.7178, 2013. URL: http://arxiv.org/abs/1311.7178.
-
I. Diakonikolas, P. Gopalan, R. Jaiswal, R.A. Servedio, and E. Viola. Bounded independence fools halfspaces. SIAM Journal on Computing, 2010.
- Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan, and Andrew Wan. A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions. CoRR, abs/0909.4727, 2009. URL: http://arxiv.org/abs/0909.4727.
- Parikshit Gopalan, Daniel M. Kane, and Raghu Meka. Pseudorandomness via the discrete fourier transform. In Venkatesan Guruswami, editor, IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pages 903-922. IEEE Computer Society, 2015. URL: http://dx.doi.org/10.1109/FOCS.2015.60.
-
Jelani Nelson Ilias Diakonikolas, Daniel M. Kane. Bounded independence fools degree-2 threshold functions. Foundations of Computer Science (FOCS), 2010.
-
Daniel M. Kane. k-independent gaussians fool polynomial threshold functions. Conference on Computational Complexity (CCC), 2011.
-
Daniel M. Kane. A small prg for polynomial threshold functions of gaussians. Symposium on the Foundations Of Computer Science (FOCS), 2011.
- Daniel M. Kane. A structure theorem for poorly anticoncentrated gaussian chaoses and applications to the study of polynomial threshold functions. CORR, 2012. URL: http://arxiv.org/abs/1204.0543.
-
Daniel M. Kane. A pseudorandom generator for polynomial threshold functions of gaussians with subpolynomial seed length. Conference on Computational Complexity (CCC), 2014.
- Daniel M. Kane. A polylogarithmic PRG for degree 2 threshold functions in the gaussian setting. In David Zuckerman, editor, 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA, volume 33 of LIPIcs, pages 567-581. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. URL: http://dx.doi.org/10.4230/LIPIcs.CCC.2015.567.
- Adam R. Klivans and Rocco A. Servedio. Learning DNF in time 2^õ(n^1/3). In Jeffrey Scott Vitter, Paul G. Spirakis, and Mihalis Yannakakis, editors, Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pages 258-265. ACM, 2001. URL: http://dx.doi.org/10.1145/380752.380809.
- Raghu Meka and David Zuckerman. Pseudorandom generators for polynomial threshold functions. CoRR, abs/0910.4122, 2009. URL: http://arxiv.org/abs/0910.4122.
- E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. ArXiv Mathematics e-prints, 2005. URL: http://arxiv.org/abs/math/0503503.
- Alexander A. Sherstov. Separating ac^0 from depth-2 majority circuits. In David S. Johnson and Uriel Feige, editors, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pages 294-301. ACM, 2007. URL: http://dx.doi.org/10.1145/1250790.1250834.
- Valentine Kabanets and Zhenjian Lu. Nisan-wigderson pseudorandom generators for circuits with polynomial threshold gates. ECCC, https://eccc.weizmann.ac.il/report 012/, 2018. URL: https://eccc.weizmann.ac.il/report/2018/012/.