research-article

An invariance principle for polytopes

Authors:

Prahladh Harsha,

Raghu MekaAuthors Info & Claims

Journal of the ACM (JACM), Volume 59, Issue 6

Article No.: 29, Pages 1 - 25

https://doi.org/10.1145/2395116.2395118

Published: 09 January 2013 Publication History

Abstract

Let X be randomly chosen from {-1,1}ⁿ, and let Y be randomly chosen from the standard spherical Gaussian on ℝⁿ. For any (possibly unbounded) polytope P formed by the intersection of k halfspaces, we prove that |Pr[X ∈ P] - Pr[Y ∈ P]| ≤ log^8/5k ⋅ Δ, where Δ is a parameter that is small for polytopes formed by the intersection of “regular” halfspaces (i.e., halfspaces with low influence). The novelty of our invariance principle is the polylogarithmic dependence on k. Previously, only bounds that were at least linear in k were known. The proof of the invariance principle is based on a generalization of the Lindeberg method for proving central limit theorems and could be of use elsewhere.

We give two important applications of our invariance principle, one from learning theory and the other from pseudorandomness.

(1) A bound of log^O(1)k ⋅ ϵ^1/6 on the Boolean noise sensitivity of intersections of k “regular” halfspaces (previous work gave bounds linear in k). This gives a corresponding agnostic learning algorithm for intersections of regular halfspaces.

(2) A pseudorandom generator (PRG) for estimating the Gaussian volume of polytopes with k faces within error δ and seed-length O(log n poly(log k,1/δ)).

We also obtain PRGs with similar parameters that fool polytopes formed by intersection of regular halfspaces over the hypercube. Using our PRG constructions, we obtain the first deterministic quasi-polynomial time algorithms for approximately counting the number of solutions to a broad class of integer programs, including dense covering problems and contingency tables.

References

[1]

Ailon, N. and Chazelle, B. 2006. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. In Proceedings of the 38th ACM Symposium on Theory of Computing (STOC). 557--563.

Digital Library

[2]

Austrin, P. 2007. Balanced max 2-sat might not be the hardest. In Proceedings of the 39th ACM Symposium on Theory of Computing (STOC), D. S. Johnson and U. Feige, Eds. ACM, 189--197. http://doi.acm.org.10.1145 1250790.1250818.

Digital Library

[3]

Austrin, P. 2010. Towards sharp inapproximability for any 2-CSP. SIAM J. Comput 39, 6, 2430--2463. http://dx.doi.org/10.1137/07011670.

Digital Library

[4]

Bansal, N. and Khot, S. 2010. Inapproximability of hypergraph vertex cover and applications to scheduling problems. In Proceedings of the International Colloquim on Automata, Languages, and Programming (ICALP), S. Abramsky, C. Gavoille, C. Kirchner, F. M. auf der Heide, and P. G. Spirakis, Eds. Lecture Notes in Computer Science Series, vol. 6198. Springer, 250--261. http://dx.doi.org/10.1007/978-3-642-14165-2.

Digital Library

[5]

Barvinok, A. and Veomett, E. 2008. The computational complexity of convex bodies. In Surveys on Discrete and Computational Geometry: Twenty Years Later, J. E. Goodman, J. Pach, and R. Pollack, Eds., Contemporary Mathematics Series, vol. 453. AMS, 117--137. http://www.ams.org/bookstore-getitem/item=COMM-453, arXiv:math/0610325.

[6]

Beck, M. and Robins, S. 2007. Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra 1st Ed. Undergraduate Texts in Mathematics, Springer. http://math.sfsu.edu/beck/ccd.html.

[7]

Benjamini, I., Kalai, G., and Schramm, O. 1999. Noise sensitivity of Boolean functions and applications to percolation. Inst. Hautes Études Sci. Publ. Math. 90, 1, 5--43.

[8]

Bentkus, V. K. 1990. Smooth approximations of the norm and differentiable functions with bounded support in Banach space l^k_∞. Lithuan. Math. J. 30, 3, 223--230.

[9]

Bentkus, V. K. 2003. On the dependence of the Berry-Esseen bound on dimension. J. Stat. Plan. Inf. 113, 2, 385--402.

[10]

Blais, E. and O'Donnell, R. 2010. Lower bounds for testing function isomorphism. In Proceedings of the IEEE Conference on Computational Complexity. IEEE Computer Society, 235--246. http://doi. ieeecomputersociety.org/10.1109/CCC.2010.30.

Digital Library

[11]

Chatterjee, S. 2005. A simple invariance theorem. arXiv:math/0508213.

[12]

Cryan, M. and Dyer, M. E. 2003. A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. J. Comput. Syst. Sci. 67, 2, 291--310.

Digital Library

[13]

de Wolf, R. 2008. A brief introduction to Fourier analysis on the Boolean cube. Theory of Comput. Graduate Sur. 1, 1--20.

[14]

Diakonikolas, I., Harsha, P., Klivans, A., Meka, R., Raghavendra, P., Servedio, R. A., and Tan, L.-Y. 2010a. Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), ACM, 533--542. http://doi.acm.org/10.1145/1806689.1806763.

Digital Library

[15]

Diakonikolas, I., Kane, D. M., and Nelson, J. 2010b. Bounded independence fools degree-2 threshold functions. In Proceedings of the 51st IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 11--20.

Digital Library

[16]

Dinur, I., Friedgut, E., and Regev, O. 2008. Independent sets in graph powers are almost contained in juntas. Geomet. Funct. Anal. 18, 1, 77--97.

[17]

Dinur, I., Mossel, E., and Regev, O. 2009. Conditional hardness for approximate coloring. SIAM J. Comput 39, 3, 843--873. http://dx.doi.org/10.1137/07068062X.

Digital Library

[18]

Dyer, M. E. 2003. Approximate counting by dynamic programming. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC). 693--699.

Digital Library

[19]

Feldman, V., Guruswami, V., Raghavendra, P., and Wu, Y. 2009. Agnostic learning of monomials by halfspaces is hard. In Proceedings of the 50th IEEE Symposium on Foundation of Computer Science (FOCS). IEEE Computer Society, 385--394. http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.26.

Digital Library

[20]

Feller, W. 1968. An Introduction to Probability Theory and Its Applications, Volume 1 3rd Ed. Wiley.

[21]

Feller, W. 1971. An Introduction to Probability Theory and Its Applications, Volume 2 2nd Ed. Wiley.

[22]

Goemans, M. X. and Williamson, D. P. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 6, 1115--1145.

Digital Library

[23]

Gopalan, P., Klivans, A., and Meka, R. 2010a. Polynomial-time approximation schemes for knapsack and related counting problems using branching programs. Electron. Colloq. Comput. Complex. (ECCC) 17, 133. http://eccc.hpi-web.de/report/2010/133.

[24]

Gopalan, P., O'Donnell, R., Wu, Y., and Zuckerman, D. 2010b. Fooling functions of halfspaces under product distributions. In Proceedings of 25th IEEE Conference on Computational Complexity 223--234.

Digital Library

[25]

Harsha, P., Klivans, A., and Meka, R. 2010. An invariance principle for polytopes. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC). ACM, 543--552.

Digital Library

[26]

Håstad, J. 2001. Some optimal inapproximability results. J. ACM 48, 4, 798--859.

Digital Library

[27]

Haussler, D. 1992. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Inf. Comput. 100, 1, 78--150.

Digital Library

[28]

Impagliazzo, R., Nisan, N., and Wigderson, A. 1994. Pseudorandomness for network algorithms. In Proceedings of the 26th ACM Symposium on Theory of Computing (STOC). ACM, 356--364.

Digital Library

[29]

Jerrum, M. and Sinclair, A. 1997. The Markov chain Monte Carlo method: An approach to approximate counting and integration. In Approximation Algorithms for NP-hard Problems, D. S. Hochbaum, Ed., PWS Publishing Company. http://www.ieor.berkeley.edu/-hochbaum/html/book-aanp.html.

Digital Library

[30]

Kahn, J., Kalai, G., and Linial, N. 1988. The influence of variables on Boolean functions (extended abstract). In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science (FOCS). 68--80.

Digital Library

[31]

Kalai, A. T., Klivans, A. R., Mansour, Y., and Servedio, R. A. 2008. Agnostically learning halfspaces. SIAM J. Comput. 37, 6, 1777--1805.

Digital Library

[32]

Kalai, G. 2005. Noise sensitivity and chaos in social choice theory. Tech. rep. 399, Center for Rationality and Interactive Decision Theory, Hebrew University of Jerusalem. http://www.ratio.huji.ac.il/dp_files/dp-399.pdf.

[33]

Kearns, M. J., Schapire, R. E., and Sellie, L. 1994. Toward efficient agnostic learning. Mach. Learn. 17, 2--3, 115--141.

Digital Library

[34]

Khot, S., Kindler, G., Mossel, E., and O'Donnell, R. 2007. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs&quest; SIAM J. Comput. 37, 1, 319--357.

Digital Library

[35]

Klivans, A. R., O'Donnell, R., and Servedio, R. A. 2004. Learning intersections and thresholds of halfspaces. J. Comput. Syst. Sci. 68, 4, 808--840.

Digital Library

[36]

Klivans, A. R., O'Donnell, R., and Servedio, R. A. 2008. Learning geometric concepts via Gaussian surface area. In Proceedings of the Symposium on Foundations of Computer Science (FOCS) 541--550.

Digital Library

[37]

Linial, N., Mansour, Y., and Nisan, N. 1993. Constant depth circuits, Fourier transform, and learnability. J. ACM 40, 3, 607--620.

Digital Library

[38]

Mahajan, S. and Hariharan, R. 1999. Derandomizing approximation algorithms based on semidefinite programming. SIAM J. Comput. 28, 5, 1641--1663.

Digital Library

[39]

Mansour, Y. 1994. Learning Boolean functions via the Fourier transform. In Theoretical Advances in Neural Computation and Learning, V. P. Roychowdhury, K.-Y. Siu, and A. Orlitsky, Eds., Kluwer Academic Publishers, 391--424. http://www.springer.com/physics/complexity/book/978-0-7923-9478-5.

[40]

Meka, R. and Zuckerman, D. 2010. Pseudorandom generators for polynomial threshold functions. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 427--436.

Digital Library

[41]

Mossel, E. 2008. Gaussian bounds for noise correlation of functions and tight analysis of long codes. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), 156--165.

Digital Library

[42]

Mossel, E. 2012. A quantitative arrow theorem. Probab. Theory Relat. Fields 154, 49--88.

[43]

Mossel, E., O'Donnell, R., and Oleszkiewicz, K. 2005. Noise stability of functions with low influences invariance and optimality. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS). 21--30.

Digital Library

[44]

Naor, J. and Naor, M. 1993. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput. 22, 4, 838--856.

Digital Library

[45]

Nazarov, F. 2003. On the maximal perimeter of a convex set in ℝⁿ with respect to a Gaussian measure. In Geometric Aspects of Functional Analysis (Israel Seminar 2001--2002). Lecture Notes in Mathematics Series, vol. 1807/2003, Springer, 169--187.

[46]

O'Donnell, R. 2004. Hardness amplification within NP. J. Comput. Syst. Sci. 69, 1, 68--94.

Digital Library

[47]

O'Donnell, R. 2008. Some topics in analysis of Boolean functions. In Proceedings of the 40th ACM Symposium on Theory of Computing (STOC). 569--578.

Digital Library

[48]

O'Donnell, R. and Wu, Y. 2009. Conditional hardness for satisfiable 3-CSPs. In Proceedings of the 41st ACM Symposium on Theory of Computing (STOC). 493--502. http://doi.acm.org/10.1145/1536414.1536482.

Digital Library

[49]

Paulauskas, V. and Račkauskas, A. 1989. Approximation Theory in the Central Limit Theorem: Exact Results in Banach Spaces. Kluwer Academic Publishers. (Translated from Russian).

[50]

Peres, Y. 2004. Noise stability of weighted majority. (arXiv:math/0412377.)

[51]

Pinelis, I. 1994. Extremal probabilistic problems and hotelling T² test under a symmetry condition. Ann. Statist. 22, 1, 357--368.

[52]

Raghavendra, P. 2008. Optimal algorithms and inapproximability results for every CSP&quest; In STOC, ACM, 245--254. http://doi.acm.org/10.1145/1374376.

Digital Library

[53]

Rotar', V. I. 1979. Limit theorems for polylinear forms. J. Multivar. Anal. 9, 4, 511--530.

[54]

Shi, Y. 2000. Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. Inf. Process. Lett. 75, 1-2, 79--83.

Digital Library

[55]

Tao, T. 2009. Talagrand's concentration inequality. (Post in Blog “What's new”). htt://terrytao.wordpress. com/2009/06/09/talagrands-concentration-inequality/.

[56]

Wolff, P. 2007. Hypercontractivity of simple random variables. Studia Math 180, 3, 219--236.

[57]

Ziegler, G. M. 1995. Lectures on polytopes. Graduate texts in Mathematics Series, vol. 152. Springer. http://www.springer.com/math/geometry/book/978-0-387-94365-7.

Cited By

Arunachalam SRegev OYao P(2023)On the Gaussian Surface Area of SpectrahedraGeometric Aspects of Functional Analysis10.1007/978-3-031-26300-2_2(57-65)Online publication date: 30-Sep-2023
https://doi.org/10.1007/978-3-031-26300-2_2
Arunachalam SYao PLeonardi SGupta A(2022)Positive spectrahedra: invariance principles and pseudorandom generatorsProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3519965(208-221)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3519965
O’Donnell RServedio RTan L(2022)Fooling PolytopesJournal of the ACM10.1145/346053269:2(1-37)Online publication date: 31-Jan-2022
https://dl.acm.org/doi/10.1145/3460532
Show More Cited By

Index Terms

An invariance principle for polytopes
1. Mathematics of computing
  1. Probability and statistics
    1. Probabilistic reasoning algorithms
      1. Random number generation
2. Theory of computation

Recommendations

An invariance principle for polytopes
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computing

Let X be randomly chosen from {-1,1}ⁿ, and let Y be randomly chosen from the standard spherical Gaussian on Rⁿ. For any (possibly unbounded) polytope P formed by the intersection of k halfspaces, we prove that |Pr[X ∈ P] - Pr[Y ∈ P]| ≤ log^8/5k • Δ, ...
The complexity of constructing pseudorandom generators from hard functions

We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0,1}^l --> {0,1} computable in alternating time O(l) with O(1) alternations that ...
Average-case hardness of NP from exponential worst-case hardness assumptions
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

A long-standing and central open question in the theory of average-case complexity is to base average-case hardness of NP on worst-case hardness of NP. A frontier question along this line is to prove that PH is hard on average if UP requires (sub-)...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 59, Issue 6

December 2012

213 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/2395116

Issue’s Table of Contents

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 January 2013

Accepted: 01 September 2012

Revised: 01 September 2012

Received: 01 September 2012

Published in JACM Volume 59, Issue 6

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
394
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)1

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Arunachalam SRegev OYao P(2023)On the Gaussian Surface Area of SpectrahedraGeometric Aspects of Functional Analysis10.1007/978-3-031-26300-2_2(57-65)Online publication date: 30-Sep-2023
https://doi.org/10.1007/978-3-031-26300-2_2
Arunachalam SYao PLeonardi SGupta A(2022)Positive spectrahedra: invariance principles and pseudorandom generatorsProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3519965(208-221)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3519965
O’Donnell RServedio RTan L(2022)Fooling PolytopesJournal of the ACM10.1145/346053269:2(1-37)Online publication date: 31-Jan-2022
https://dl.acm.org/doi/10.1145/3460532
Chattopadhyay AMande N(2022)A Short List of Equalities Induces Large Sign-RankSIAM Journal on Computing10.1137/19M127134851:3(820-848)Online publication date: 14-Jun-2022
https://doi.org/10.1137/19M1271348
Hatami PHoza WTal ATell R(2022)Fooling Constant-Depth Threshold Circuits (Extended Abstract)2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS52979.2021.00019(104-115)Online publication date: Feb-2022
https://doi.org/10.1109/FOCS52979.2021.00019
Qin MYao P(2021)Nonlocal Games with Noisy Maximally Entangled States are DecidableSIAM Journal on Computing10.1137/20M134592X50:6(1800-1891)Online publication date: 2-Dec-2021
https://doi.org/10.1137/20M134592X
Goldwasser SKalai AKalai YMontasser O(2020)Identifying unpredictable test examples with worst-case guarantees2020 Information Theory and Applications Workshop (ITA)10.1109/ITA50056.2020.9244996(1-14)Online publication date: 2-Feb-2020
https://doi.org/10.1109/ITA50056.2020.9244996
O'Donnell RServedio RTan LCharikar MCohen E(2019)Fooling polytopesProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing10.1145/3313276.3316321(614-625)Online publication date: 23-Jun-2019
https://dl.acm.org/doi/10.1145/3313276.3316321
Tell RDiakonikolas IKempe DHenzinger M(2018)Quantified derandomization of linear threshold circuitsProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3188745.3188822(855-865)Online publication date: 20-Jun-2018
https://dl.acm.org/doi/10.1145/3188745.3188822
Gopalan PKane DMeka R(2018)Pseudorandomness via the Discrete Fourier TransformSIAM Journal on Computing10.1137/16M106213247:6(2451-2487)Online publication date: 18-Dec-2018
https://doi.org/10.1137/16M1062132
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents