Noise Stability Is Computable and Approximately Low-Dimensional

Anindya De

[0]

Elchanan Mossel

[0]

Joe Neeman

[0]

Leibniz International Proceedings in Informatics, pp. 10:1-10:11, 2017.

Cited by: 2|Views11

Keywords:

Gaussian noise stabilityPlurality is stablestOrnstein Uhlenbeck operator

Abstract:

Questions of noise stability play an important role in hardness of approximation in computer science as well as in the theory of voting. In many applications, the goal is to find an optimizer of noise stability among all possible partitions of R-n for n >= 1 to k parts with given Gaussian measures mu(1),..., mu(k). We call a partition eps...More

Code:

Data:

Get fulltext within 24h

View via Publisher