Abstract
The notion of Gaussian noise stability plays an important role in hardness of approximation in theoretical computer science as well as in the theory of voting. The Gaussian noise stability of a partition of Rn is simply the probability that two correlated Gaussian vectors both fall into the same part. In many applications, the goal is to find an optimizer of noise stability among all possible partitions of Rn to k parts with given Gaussian measures µ1, …, µk . We call a partition ε-optimal, if its noise stability is optimal up to an additive ε. In this paper, we give a computable function n(ε) such that an ε-optimal partition exists in Rn(ε). This result has implications for the computability of certain problems in non-interactive simulation, which are addressed in a subsequent paper.
Original language | English (US) |
---|---|
Article number | 6 |
Journal | Theory of Computing |
Volume | 15 |
DOIs | |
State | Published - 2019 |
Funding
Supported by NSF grant CCF 1926872 (transferred from CCF 1814706). Most of the work done as a faculty at Northwestern University. Supported by DMS-1737944 and ONR N00014-16-1-2227, N00014-17-1-2598. Funded by a Deutsche Forschungs-gemeinschaft (DFG, German Research Foundation) under GermanyâĂŹs Excellence Strategy GZ 2047/1, Projekt-ID 390685813 and a Sloan Fellowship. A conference version of this paper appeared in the Proceedings of the 32nd Computational Complexity Conference, 2017. ∗Supported by NSF grant CCF 1926872 (transferred from CCF 1814706). Most of the work done as a faculty at Northwestern University. †Supported by DMS-1737944 and ONR N00014-16-1-2227, N00014-17-1-2598. ‡Funded by a Deutsche Forschungs-gemeinschaft (DFG, German Research Foundation) under GermanyâA˘ Źs Excellence Strategy GZ 2047/1, Projekt-ID 390685813 and a Sloan Fellowship.
Keywords
- Computability
- Gaussian surface area
- Noise stability
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Theory and Mathematics