Name
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 R-n 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 R-n to k parts with given Gaussian measures mu(1), . . . , mu(k). We call a partition epsilon-optimal, if its noise stability is optimal up to an additive s. In this paper, we give a computable function n(epsilon) such that an s-optimal partition exists in R-n(epsilon). This result has implications for the computability of certain problems in non-interactive simulation, which are addressed in a subsequent paper. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.4086/toc.2019.v015a006 | THEORY OF COMPUTING |
Keywords | DocType | Volume |
noise stability,Gaussian surface area,computability | Journal | 15 |
ISSN | Citations | PageRank |
1557-2862 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anindya De | 1 | 239 | 24.77 |
| Elchanan Mossel | 2 | 0 | 0.34 |
| Joe Neeman | 3 | 0 | 1.01 |