Fooling Gaussian PTFs via local hyperconcentration
Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan
2020Year
6Citations
4Top-tier citations
Abstract
We give a pseudorandom generator that fools degree-d polynomial threshold functions over n-dimensional Gaussian space with seed length d O(logd) · logn. All previous generators had a seed length with at least a 2 d dependence on d.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f40e5972-c8c4-4444-b8db-1afdde245ccbCited by top-tier papers4
- Positive spectrahedra: invariance principles and pseudorandom generatorsSrinivasan Arunachalam, Penghui YaoSTOC 2022 · 4 citations
- Detecting Low-Degree TruncationAnindya De, Huan Li, Shivam Nadimpalli, Rocco A. ServedioSTOC 2024 · 2 citations
- PTF Testing Lower Bounds for Non-Gaussian Component AnalysisIlias Diakonikolas, Daniel M. Kane, Sihan Liu, Thanasis PittasFOCS 2025 · 1 citation
- Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFsIlias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Sihan Liu et al.STOC 2024
Related papers
- Fooling polynomials using invariant theory*Harm Derksen, Emanuele ViolaFOCS 2022 · 2 citations
- Fooling Constant-Depth Threshold Circuits (Extended Abstract)Pooya Hatami, William M. Hoza, Avishay Tal, Roei TellFOCS 2021 · 4 citations
- Testably Learning Polynomial Threshold FunctionsLucas Slot, Stefan Tiegel, Manuel WiedmerNeurIPS 2024 · 13 citations
- Algorithmic Thresholds for Refuting Random Polynomial SystemsJun-Ting Hsieh, Pravesh K. KothariSODA 2022 · 2 citations
- Learning Polynomial Transformations via Generalized Tensor DecompositionsSitan Chen, Jerry Li, Yuanzhi Li, Anru R. ZhangSTOC 2023 · 2 citations
