329 Boolean Analysis — Noise Stability
329.1 Overview
This chapter defines uniform noise stability for dimension-indexed function classes and records the influence-to-noise reduction, Peres’s bound for linear threshold functions, and Kane’s bounds for polynomial threshold functions.
329.2 Declarations
A class of functions on Boolean cubes is a family \(B=(B_n)_{n\in \mathbb N}\), where \(B_n\) is a set of real-valued functions on \(\{ 0,1\} ^{n}\).
For a family \(B=(B_n)_{n\in \mathbb N}\) of sets of functions \(\{ 0,1\} ^{n}\to \mathbb R\), being Boolean-valued means that every \(f\in B_n\), in every dimension \(n\), satisfies \(f(x)\in \{ -1,1\} \) for all \(x\in \{ 0,1\} ^{n}\).
For \(k,n\in \mathbb N\), the degree-at-most-\(k\) polynomial threshold class consists of functions \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) for which there is a real multilinear polynomial \(p\) of degree at most \(k\) such that \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) for every \(x\), where \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(\operatorname {sgn}_{+}(t)=-1\) for \(t\lt 0\).
For every \(n\in \mathbb N\), the linear threshold class consists of functions \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) admitting real coefficients \(c,a_1,\ldots ,a_n\) with
where \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).
For a family \(B=(B_n)_{n\in \mathbb N}\) of sets of real-valued functions on \(\{ 0,1\} ^{n}\), uniform noise stability means that every member is \(\{ -1,1\} \)-valued and there exists a function \(\varepsilon :\mathbb R\to \mathbb R\) with \(0\leq \varepsilon (\delta )\leq 1\) for \(0\leq \delta \leq 1/2\) and \(\lim _{\delta \to 0^{+}}\varepsilon (\delta )=0\), such that
Here \(X\) is uniform on \(\{ 0,1\} ^{n}\) and \(Y\) is obtained by flipping each coordinate of \(X\) independently with probability \(\delta \); no range condition is imposed on \(\varepsilon \) outside \([0,1/2]\).
For every \(n,m\in \mathbb N\), a function \(f:\{ 0,1\} ^{n}\to \mathbb R\), a vector \(z\in \{ 0,1\} ^{n}\) and a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), negating according to \(z\) and identifying according to \(\pi \) gives the function \(g:\{ 0,1\} ^{m}\to \mathbb R\) defined by
For a family \(B=(B_n)_{n\in \mathbb N}\) of sets of real-valued functions on \(\{ 0,1\} ^{n}\), closure under input negation and identification means that, for all \(n,m\in \mathbb N\), \(f\in B_n\), \(z\in \{ 0,1\} ^{n}\) and maps \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), the function
belongs to \(B_m\).
For a real parameter \(\delta \), the block count is the natural number
where the floor is the integer floor and \(0^{-1}\) is defined to be \(0\); in particular \(m(\delta )=0\) for \(\delta \leq 0\).
For every \(n\in \mathbb N\), \(f:\{ 0,1\} ^{n}\to \mathbb R\) and real \(\rho \geq 0\), the noise stability
is nonnegative, where \(\widehat f(S)=2^{-n}\sum _{x\in \{ 0,1\} ^{n}}f(x)\prod _{i\in S}(-1)^{x_i}\) is the normalized Walsh coefficient (and \(\rho ^0=1\), including at \(\rho =0\)).
For every \(n\in \mathbb N\), real-valued \(f:\{ 0,1\} ^{n}\to \mathbb R\) and real \(\delta \leq 1/2\), including negative \(\delta \), the total real-valued noise sensitivity satisfies
where \(\widehat f(S)=2^{-n}\sum _{x\in \{ 0,1\} ^{n}}f(x)\prod _{i\in S}(-1)^{x_i}\).
For every real \(\delta \) with \(0\lt \delta \leq 1/2\), the natural number \(m=\lfloor 1/\delta \rfloor \) satisfies
For every real \(\delta \) with \(0\lt \delta \leq 1/2\), setting \(m=\lfloor 1/\delta \rfloor \) gives
Let \(B=(B_n)_{n\in \mathbb N}\) be a family of sets of functions \(\{ 0,1\} ^{n}\to \{ -1,1\} \) and let \(\varepsilon :\mathbb R\to \mathbb R\) satisfy \(\varepsilon (\delta )\geq 0\) for \(0\leq \delta \leq 1/2\), \(\lim _{\delta \to 0^{+}}\varepsilon (\delta )=0\) and \(\operatorname {NS}_{\delta }(f)\leq \varepsilon (\delta )\) for every \(n\), \(f\in B_n\) and \(0\lt \delta \leq 1/2\). Then \(B\) is uniformly noise-stable: there exists \(\eta :\mathbb R\to \mathbb R\) with \(0\leq \eta (\delta )\leq 1\) on \([0,1/2]\), \(\lim _{\delta \to 0^{+}}\eta (\delta )=0\) and \(\operatorname {NS}_{\delta }(f)\leq \eta (\delta )\) for every such \(n,f,\delta \), where \(\operatorname {NS}_{\delta }(f)=\Pr [f(X)\neq f(Y)]\), \(X\) is uniform on the cube and \(Y\) flips each coordinate independently with probability \(\delta \).
For every \(n\in \mathbb N\), every member \(f\) of the linear threshold class on \(\{ 0,1\} ^{n}\) takes values in \(\{ -1,1\} \); the class consists of functions \(f(x)=\operatorname {sgn}_{+}(c+\sum _{i=1}^{n}a_i(-1)^{x_i})\) with real coefficients, where \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).
For all \(n,m\in \mathbb N\), real coefficients \(c,a_1,\ldots ,a_n\), \(z\in \{ 0,1\} ^{n}\) and maps \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), if \(f(x)=\operatorname {sgn}_{+}(c+\sum _{i=1}^{n}a_i(-1)^{x_i})\), then \(g(w)=f((z_i+w_{\pi (i)}\pmod2)_{i=1}^{n})\) is a \(\{ -1,1\} \)-valued linear threshold function on \(\{ 0,1\} ^{m}\), meaning that \(g(w)=\operatorname {sgn}_{+}(b+\sum _{j=1}^{m}u_j(-1)^{w_j})\) for some real \(b,u_1,\ldots ,u_m\). Here \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).
For \(n,m\in \mathbb N\), a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \) and a subset \(S\subseteq \{ 1,\ldots ,n\} \), the odd-multiplicity image is the set
For all \(n,m\in \mathbb N\), maps \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \) and subsets \(S\subseteq \{ 1,\ldots ,n\} \), the set \(O_{\pi }(S)=\{ j\in \{ 1,\ldots ,m\} :|\{ i\in S:\pi (i)=j\} |\text{ is odd}\} \) satisfies \(|O_{\pi }(S)|\leq |S|\).
For every bit \(b\in \{ 0,1\} \) and natural number \(c\), setting \(s(b)=(-1)^b\) gives
For \(n,m\in \mathbb N\), a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), \(S\subseteq \{ 1,\ldots ,n\} \) and \(w\in \{ 0,1\} ^{m}\), set \(O_{\pi }(S)=\{ j\in \{ 1,\ldots ,m\} :|\{ i\in S:\pi (i)=j\} |\text{ is odd}\} \); then
For \(n,m\in \mathbb N\), \(z\in \{ 0,1\} ^{n}\), \(w\in \{ 0,1\} ^{m}\), a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \) and \(S\subseteq \{ 1,\ldots ,n\} \), define \(\chi _A(x)=\prod _{i\in A}(-1)^{x_i}\) for subsets of the coordinate set of \(x\), and set \(O_{\pi }(S)=\{ j\in \{ 1,\ldots ,m\} :|\{ i\in S:\pi (i)=j\} |\text{ is odd}\} \); then
For every \(k,n,m\in \mathbb N\), a function \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) of the form \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) for a real multilinear polynomial \(p\) of degree at most \(k\), every \(z\in \{ 0,1\} ^{n}\) and every map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), the function \(g(w)=f((z_i+w_{\pi (i)}\pmod2)_{i=1}^{n})\) is also \(\{ -1,1\} \)-valued and has a representation \(g(w)=\operatorname {sgn}_{+}(q((-1)^{w_1},\ldots ,(-1)^{w_m}))\) with a real multilinear polynomial \(q\) of degree at most \(k\). Here \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).
For every \(n,k,k'\in \mathbb N\) with \(k\leq k'\), every \(\{ -1,1\} \)-valued function on \(\{ 0,1\} ^{n}\) represented by \(\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) for a real multilinear polynomial \(p\) of degree at most \(k\) also admits such a representation of degree at most \(k'\), where \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).
For every \(n,m\in \mathbb N\), \(f:\{ 0,1\} ^{n}\to \mathbb R\), \(z\in \{ 0,1\} ^{n}\), \(w\in \{ 0,1\} ^{m}\) and map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), define \(g(v)=f((u_i(v))_{i=1}^{n})\), where \(u_i(v)=1-v_{\pi (i)}\) when \(z_i=1\) and \(u_i(v)=v_{\pi (i)}\) when \(z_i=0\); then
where \(\oplus \) is coordinatewise addition modulo \(2\).
For \(n,m\in \mathbb N\), \(f:\{ 0,1\} ^{n}\to \mathbb R\), \(z\in \{ 0,1\} ^{n}\), a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), \(w\in \{ 0,1\} ^{m}\) and \(j\in \{ 1,\ldots ,m\} \), define \(g(v)=f(z\oplus (v_{\pi (i)})_{i=1}^{n})\), where \(\oplus \) is coordinatewise addition modulo \(2\), and write \(x^{A}\) for the vector obtained by flipping precisely the coordinates in \(A\); then
For \(n,m\in \mathbb N\), \(f:\{ 0,1\} ^{n}\to \mathbb R\), a map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \) and \(j\in \{ 1,\ldots ,m\} \), define \(g_z(w)=f(z\oplus (w_{\pi (i)})_{i=1}^{n})\), where \(\oplus \) is coordinatewise addition modulo \(2\), and write \(x^{A}\) for the vector obtained by flipping the coordinates in \(A\); then
Each expectation is uniform on the full Boolean cube of its variable’s dimension.
For every \(n\in \mathbb N\), positive integer \(m\), \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) and \(j\in \{ 1,\ldots ,m\} \),
Here \(X\) is uniform on \(\{ 0,1\} ^{n}\), \(X^{A}\) flips precisely the coordinates of \(A\), and \(\operatorname {NS}_{1/m}(f)\) is \(\Pr [f(X)\neq f(Y)]\) when each coordinate of \(X\) is independently flipped with probability \(1/m\) to obtain \(Y\).
For every \(n\in \mathbb N\), \(f:\{ 0,1\} ^{n}\to \mathbb R\) and real \(\delta \leq \delta '\leq 1/2\), with no lower bound on either rate, one has \(\operatorname {NS}_{\delta }(f)\leq \operatorname {NS}_{\delta '}(f)\), where the total real-valued extension is
Let \(B=(B_n)_{n\in \mathbb N}\) be a family of sets of functions \(\{ 0,1\} ^{n}\to \{ -1,1\} \), closed under all substitutions \(w\mapsto (z_i+w_{\pi (i)}\pmod2)_{i=1}^{n}\) for every \(n,m\in \mathbb N\), \(z\in \{ 0,1\} ^{n}\) and map \(\pi :\{ 1,\ldots ,n\} \to \{ 1,\ldots ,m\} \), and let \(A:\mathbb N\to \mathbb R\) satisfy
where \(X\) is uniform on \(\{ 0,1\} ^{n}\) and \(X^{\{ i\} }\) flips coordinate \(i\). Then for every \(0\lt \delta \leq 1/2\), \(n\in \mathbb N\) and \(f\in B_n\), setting \(m=\lfloor 1/\delta \rfloor \) gives
where \(\operatorname {NS}_{\delta }(f)=\Pr [f(X)\neq f(Y)]\) and \(Y\) independently flips each coordinate of \(X\) with probability \(\delta \).
There exists a universal real constant \(C\geq 0\) such that, for every \(n\in \mathbb N\), every linear threshold function \(f(x)=\operatorname {sgn}_{+}(c+\sum _{i=1}^{n}a_i(-1)^{x_i})\) on \(\{ 0,1\} ^{n}\) with real coefficients and every \(0\lt \delta \leq 1/2\),
Here \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\), and \(\operatorname {NS}_{\delta }(f)=\Pr [f(X)\neq f(Y)]\) with uniform \(X\) and independent coordinate flips of probability \(\delta \) producing \(Y\).
The family of linear threshold functions on Boolean cubes is uniformly noise-stable: every function has the form \(f(x)=\operatorname {sgn}_{+}(c+\sum _{i=1}^{n}a_i(-1)^{x_i})\) for real coefficients, is \(\{ -1,1\} \)-valued, and there exists \(\varepsilon :\mathbb R\to \mathbb R\) satisfying \(0\leq \varepsilon (\delta )\leq 1\) on \([0,1/2]\), \(\lim _{\delta \to 0^{+}}\varepsilon (\delta )=0\) and
for every dimension \(n\in \mathbb N\), every such \(f\) and every \(0\lt \delta \leq 1/2\). Here \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\), \(X\) is uniform on \(\{ 0,1\} ^{n}\), and \(Y\) independently flips its coordinates with probability \(\delta \).
For every natural number \(d\), with \(\log \) denoting the natural logarithm,
There exists a universal real constant \(C\gt 0\) such that, for every \(n,k\in \mathbb N\) with \(k\geq 2\) and every \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) admitting a representation \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) by a real multilinear polynomial \(p\) of degree at most \(k\),
Here \(\operatorname {Inf}(f)=\sum _{i=1}^{n}\Pr _X[f(X)\neq f(X^{\{ i\} })]\), \(X\) is uniform, \(X^{\{ i\} }\) flips coordinate \(i\), \(\log \) is the natural logarithm, real powers have positive bases, and \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).
For every \(n,k\in \mathbb N\) with \(k\leq 1\), if \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) has a representation \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) by a real multilinear polynomial \(p\) of degree at most \(k\), then there exist real \(c,a_1,\ldots ,a_n\) such that
where \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).
There exists a universal real constant \(C\gt 0\) such that, for every \(n,k\in \mathbb N\), including \(n=0\) and \(k=0\), and every \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) represented as \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) by a real multilinear polynomial \(p\) of degree at most \(k\),
Here \(\operatorname {Inf}(f)=\sum _{i=1}^{n}\Pr _X[f(X)\neq f(X^{\{ i\} })]\), \(X\) is uniform, \(X^{\{ i\} }\) flips coordinate \(i\), \(\log \) is the natural logarithm, real powers have positive bases, and \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\).
For real \(L,E\) and \(d\in \mathbb N\) with \(L\geq \log 2\) and \(0\leq E\leq d\), where \(\log \) is the natural logarithm, one has
with real exponentiation on the positive bases \(L\) and \(\log 2\).
For \(k,d\in \mathbb N\) and real \(E,\delta \) with \(0\leq E\leq d\) and \(0\lt \delta \leq 1/2\), setting \(m=\lfloor 1/\delta \rfloor \) gives
where \(\log \) is the natural logarithm and the powers with real exponents have positive bases.
For \(n,k\in \mathbb N\), let a degree-at-most-\(k\) polynomial threshold function mean \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) of the form \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) for a real multilinear polynomial \(p\) of degree at most \(k\), with \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\); there exists a universal \(C_0\gt 0\) such that every such function satisfies
In addition, for every fixed \(k\in \mathbb N\) with \(k\gt 0\), there exist a real \(C_k\geq 0\) and a natural number \(d_k\) such that every dimension \(n\in \mathbb N\), every degree-at-most-\(k\) polynomial threshold function \(f\) and every \(0\lt \delta \leq 1/2\) satisfy
Here \(\operatorname {Inf}(f)=\sum _{i=1}^{n}\Pr _X[f(X)\neq f(X^{\{ i\} })]\), \(X\) is uniform, \(X^{\{ i\} }\) flips coordinate \(i\), \(\operatorname {NS}_{\delta }(f)=\Pr [f(X)\neq f(Y)]\) when \(Y\) independently flips each coordinate of \(X\) with probability \(\delta \), and \(\log \) is the natural logarithm.
For every fixed \(k\in \mathbb N\), including \(k=0\), the degree-at-most-\(k\) polynomial threshold functions form a uniformly noise-stable family: there exists \(\varepsilon :\mathbb R\to \mathbb R\) with \(0\leq \varepsilon (\delta )\leq 1\) for \(0\leq \delta \leq 1/2\) and \(\lim _{\delta \to 0^{+}}\varepsilon (\delta )=0\) such that
for every \(n\in \mathbb N\), \(0\lt \delta \leq 1/2\) and \(f:\{ 0,1\} ^{n}\to \{ -1,1\} \) admitting a representation \(f(x)=\operatorname {sgn}_{+}(p((-1)^{x_1},\ldots ,(-1)^{x_n}))\) with a real multilinear polynomial \(p\) of degree at most \(k\). Here \(\operatorname {sgn}_{+}(t)=1\) for \(t\geq 0\) and \(-1\) for \(t\lt 0\), \(X\) is uniform on \(\{ 0,1\} ^{n}\) and \(Y\) independently flips each coordinate of \(X\) with probability \(\delta \).