An invariance principle for polytopes

DOI10.1145/2395116.2395118zbMath1281.68182arXiv0912.4884OpenAlexW2118259999WikidataQ125103583 ScholiaQ125103583MaRDI QIDQ5395697

Raghu Meka, Adam R. Klivans, Prahladh Harsha

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.4884

zbMATH Keywords

invariancepolytopesnoise sensitivityagnostic learningpseudorandomnessintersection of halfspaces

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Fooling Polytopes ⋮ Pseudorandomness via the Discrete Fourier Transform ⋮ A Short List of Equalities Induces Large Sign-Rank ⋮ Nonlocal Games with Noisy Maximally Entangled States are Decidable ⋮ Unnamed Item ⋮ Simple and efficient pseudorandom generators from gaussian processes

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