A structure theorem for poorly anticoncentrated polynomials of Gaussians and applications to the study of polynomial threshold functions

DOI10.1214/16-AOP1097zbMATH Open1377.60051OpenAlexW2614431701MaRDI QIDQ2012247FDOQ2012247

Authors: Daniel M. Kane 

Publication date: 28 July 2017

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/16-aop1097

Recommendations

• Bounding the sensitivity of polynomial threshold functions
• The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions
• Average sensitivity and noise sensitivity of polynomial threshold functions
• A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting
• Bounding the average sensitivity and noise sensitivity of polynomial threshold functions

zbMATH Keywords

invariance principleGaussian chaosanticoncentrationpolynomial decompositions

Mathematics Subject Classification ID

Gaussian processes (60G15)

Cited In (4)

• Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
• Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
• Anti-concentration of polynomials: dimension-free covariance bounds and decay of Fourier coefficients
• The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions

This page was built for publication: A structure theorem for poorly anticoncentrated polynomials of Gaussians and applications to the study of polynomial threshold functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012247)