Difference between revisions of "Noise sensitivity"

From Boolean Zoo
Jump to: navigation, search
(Definition)
m (Definition)
Line 2: Line 2:
 
For <math>f:\{-1,1\}^{n}\longrightarrow\{-1,1\}</math> and <math>\delta\in[0,1]</math>, the '''noise sensitivity''' of <math>f</math> at <math>\delta</math>, <math>\mathbf{NS}_{\delta}[f]</math>, is the probability that <math>f(x)\neq f(y)</math> when <math>x\sim\{-1,1\}^{n}</math> is uniformly random and <math>y</math> is formed from <math>x</math> by reversing each bit independently with probability <math>\delta</math>.
 
For <math>f:\{-1,1\}^{n}\longrightarrow\{-1,1\}</math> and <math>\delta\in[0,1]</math>, the '''noise sensitivity''' of <math>f</math> at <math>\delta</math>, <math>\mathbf{NS}_{\delta}[f]</math>, is the probability that <math>f(x)\neq f(y)</math> when <math>x\sim\{-1,1\}^{n}</math> is uniformly random and <math>y</math> is formed from <math>x</math> by reversing each bit independently with probability <math>\delta</math>.
  
A series of functions <math>f_n:\{-1,1\}^n \to \{-1,1\}</math> is said to be '''noise sensitive''' if for any <math>\delta > 0</math>, we have that <math>\mathbb{E}[f_n(x)f_n(y)] - \mathbb{E}[f]^2 \to 0</math> as <math>n \to \infty </math>.
+
A series of functions <math>f_n:\{-1,1\}^n \to \{-1,1\}</math> is said to be '''noise sensitive''' if for any <math>\delta > 0</math>, we have that <math>\mathbb{E}[f_n(x)f_n(y)] - \mathbb{E}[f_n]^2 \to 0</math> as <math>n \to \infty </math>.
  
 
== Properties ==
 
== Properties ==

Revision as of 13:01, 1 November 2020

Definition

For [math]f:\{-1,1\}^{n}\longrightarrow\{-1,1\}[/math] and [math]\delta\in[0,1][/math], the noise sensitivity of [math]f[/math] at [math]\delta[/math], [math]\mathbf{NS}_{\delta}[f][/math], is the probability that [math]f(x)\neq f(y)[/math] when [math]x\sim\{-1,1\}^{n}[/math] is uniformly random and [math]y[/math] is formed from [math]x[/math] by reversing each bit independently with probability [math]\delta[/math].

A series of functions [math]f_n:\{-1,1\}^n \to \{-1,1\}[/math] is said to be noise sensitive if for any [math]\delta \gt 0[/math], we have that [math]\mathbb{E}[f_n(x)f_n(y)] - \mathbb{E}[f_n]^2 \to 0[/math] as [math]n \to \infty [/math].

Properties

  • The connection between noise sensitivity and stability is given by [math]\mathbf{NS}_{\delta}[f]=\frac{1}{2}-\frac{1}{2}Stab_{1-2\delta}[f][/math]. [1]
  • For [math]\delta\leq\frac{1}{2}[/math], and [math]f[/math] is linear threshold function ([math]f(x)=sgn(\sum_{i=1}^{n}\omega_{i}x_{i}-t)[/math]), then [math]\mathbf{NS}_{\delta}[f]\leq2\delta^{1/2}[/math]. furthermore, [math]\underset{\delta\rightarrow0}{\limsup}\frac{\limsup_{n\rightarrow\infty}\sup_{\omega,t}\mathbf{NS}_{\delta}[f]}{\sqrt{\delta}}\leq\sqrt{\frac{2}{\pi}}[/math]. [2]
  • The noise sensitivity can be lower-bounded by the total influence of a function: [math]\mathbf{NS}_{1/n}(f) \geq \mathrm{Inf}(f)/ne[/math].[3]

References

  1. Ryan O'Donnell, Analysis of Boolean functions, Chapter 2.4 [1]
  2. Peres (2004). "Noise Stability of Weighted Majority" [2]
  3. Prahladh Harsha, Adam Klivans, Raghu Meka, Bounding the Sensitivity of Polynomial Threshold Functions, Lemma 8.1