Simple and efficient pseudorandom generators from gaussian processes

DOI10.4230/LIPIcs.CCC.2019.4OpenAlexW2809971343MaRDI QIDQ5091754

Anindya De, Eshan Chattopadhyay, Rocco A. Servedio

Publication date: 27 July 2022

Full work available at URL: https://dblp.uni-trier.de/db/conf/coco/coco2019.html#ChattopadhyayDS19

zbMATH Keywords

Gaussian processespseudorandom generatorspolynomial threshold functionsJohnson-Lindenstrauss

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Fooling Polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of Wasserstein metrics for probability distributions
• A polynomial time approximation scheme for computing the supremum of Gaussian processes
• Comparison and anti-concentration bounds for maxima of Gaussian random vectors
• A high-dimensional CLT in \(\mathcal {W}_2\) distance with near optimal convergence rate
• Majorizing measures: The generic chaining
• Pseudorandom Generators for Polynomial Threshold Functions
• Almost Optimal Pseudorandom Generators for Spherical Caps
• Almost Optimal Explicit Johnson-Lindenstrauss Families
• Pseudorandomness via the Discrete Fourier Transform
• Bounded Independence Fools Halfspaces
• An invariance principle for polytopes
• Estimating the unseen
• A Small PRG for Polynomial Threshold Functions of Gaussians
• The Accuracy of the Gaussian Approximation to the Sum of Independent Variates