An invariance principle for polytopes

DOI10.1145/1806689.1806764zbMath1293.68224OpenAlexW1991042776MaRDI QIDQ2875181

Raghu Meka, Prahladh Harsha, Adam R. Klivans

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806764

zbMATH Keywords

polytopesinvariance principlesnoise sensitivitylimit theoremspseudorandom generatorsagnostic learningcontingency tablesaverage sensitivity

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Computational aspects related to convexity (52B55) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Random number generation in numerical analysis (65C10) Contingency tables (62H17)

Related Items (3)

The average sensitivity of an intersection of half spaces ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries

This page was built for publication: An invariance principle for polytopes