GAUSSIAN COMPARISON LEMMA -...

3
GAUSSIAN COMPARISON LEMMA 1. Gaussian Comparision Lemma Lemma 1.1. Let G : R n R be a bounded, twice continuously differentiable function with bounded derivatives G i (x)= ∂G(x) ∂x i 1 6 i 6 n and G ij = ∂G(x) ∂x i ∂x j 1 6 i, j 6 n. If X ∼N n (0, Σ X ) and Y ∼N n (0, Σ Y ) are normal random vectors then E G(Y) - E G(X)= 1 2 n X i,j =1 Δ ij Z 1 0 E G ij (X t ) dt where Δ ij = E Y i Y j -E X i X j = (Σ Y - Σ X ) ij and X t ∼N n (0, Σ t ) with Σ t := (1 -tX +t Σ Y . Proof: Assume without loss of generality that X and Y are independent. For each t [0, 1] define the random vector X t = (1 - t) 1/2 X + t 1/2 Y and the associated function ϕ(t)= E G(X t ). Note that X 0 = X, X 1 = Y, and that X t N n (0, Σ t ), where Σ t is defined as in the statement of the lemma. Thus E G(Y) - E G(X)= ϕ(1) - ϕ(0) = Z 1 0 ϕ 0 (t) dt, and it suffices to show that for each t (0, 1) phipr0 phipr0 (1.1) ϕ 0 (t)= 1 2 n X i,j =1 Δ ij E G ij (X t ). To this end, fix t (0, 1) and note that X t is distributed as Σ 1/2 t Z where Z ∼N (0,I ) is a standard normal random vector with independent components. To simplify notation, let A t := Σ 1/2 t . It follows from our regularity assumptions and the chain rule that ϕ 0 (t) = d dt E G(A t Z)= E d dt G(A t Z) = E " n X i=1 G i (A t Z) d dt (A t Z) i # = n X i,j =1 (A 0 t ) ij E (Z j G i (A t Z)) , phipr1 (1.2) where A 0 t denotes the entry-by-entry derivative of the matrix A t . Fix i, j for the moment and define the function H ij (s) := E G i (A t Z s ) where Z s := (Z 1 , ··· ,Z j -1 , s, Z j +1 , ··· ,Z n ). Date : April 2017. 1

Transcript of GAUSSIAN COMPARISON LEMMA -...

Page 1: GAUSSIAN COMPARISON LEMMA - nobel.web.unc.edunobel.web.unc.edu/files/2017/04/GaussianComparison.pdf · GAUSSIAN COMPARISON LEMMA 3 1.1. Further Reading: Gaussian Tail Bounds. Let

GAUSSIAN COMPARISON LEMMA

1. Gaussian Comparision Lemma

Lemma 1.1. Let G : Rn → R be a bounded, twice continuously differentiable function withbounded derivatives

Gi(x) =∂G(x)

∂xi1 6 i 6 n and Gij =

∂G(x)

∂xi∂xj1 6 i, j 6 n.

If X ∼ Nn(0,ΣX) and Y ∼ Nn(0,ΣY ) are normal random vectors then

EG(Y)− EG(X) =1

2

n∑i,j=1

∆ij

∫ 1

0EGij(X

t) dt

where ∆ij = EYiYj−EXiXj = (ΣY − ΣX)ij and Xt ∼ Nn(0,Σt) with Σt := (1−t) ΣX+tΣY .

Proof: Assume without loss of generality that X and Y are independent. For each t ∈ [0, 1]define the random vector

Xt = (1− t)1/2X + t1/2Y

and the associated function ϕ(t) = EG(Xt). Note that X0 = X, X1 = Y, and that Xt ∼Nn(0,Σt), where Σt is defined as in the statement of the lemma. Thus

EG(Y)− EG(X) = ϕ(1)− ϕ(0) =

∫ 1

0ϕ′(t) dt,

and it suffices to show that for each t ∈ (0, 1)

phipr0phipr0 (1.1) ϕ′(t) =1

2

n∑i,j=1

∆ij EGij(Xt).

To this end, fix t ∈ (0, 1) and note that Xt is distributed as Σ1/2t Z where Z ∼ N (0, I) is

a standard normal random vector with independent components. To simplify notation, let

At := Σ1/2t . It follows from our regularity assumptions and the chain rule that

ϕ′(t) =d

dtEG(At Z) = E

[d

dtG(At Z)

]= E

[n∑i=1

Gi(At Z)d

dt(At Z)i

]

=

n∑i,j=1

(A′t)ij E (Zj Gi(At Z)) ,phipr1 (1.2)

where A′t denotes the entry-by-entry derivative of the matrix At. Fix i, j for the moment anddefine the function

Hij(s) := EGi(At Zs) where Zs := (Z1, · · · , Zj−1, s, Zj+1, · · · , Zn).

Date: April 2017.

1

Page 2: GAUSSIAN COMPARISON LEMMA - nobel.web.unc.edunobel.web.unc.edu/files/2017/04/GaussianComparison.pdf · GAUSSIAN COMPARISON LEMMA 3 1.1. Further Reading: Gaussian Tail Bounds. Let

2 GAUSSIAN COMPARISON LEMMA

It follows from a simple conditioning argument and Gaussian integration by parts that

GIPGIP (1.3) E [Zj Gi(AtZ)] = E [Zj Hij(Zj)] = EH ′ij(Zj).

By another application of the chain rule,

H ′ij(s) = E

[d

dsGi(At Zs)

]=

n∑k=1

E

[Gik(At Zs)

d

dt(At Zs)k

]

=n∑k=1

(At)jk EGik(At Zs).

Thus, as Z1, . . . , Zn are independent,

EH ′ij(Zj) =n∑k=1

(At)jk EGik(At Z).

Combining this last equation with (1.2), we find that

ϕ′(t) =

n∑i,k=1

EGik(At Z) ·n∑j=1

(A′t)ij(At)jk

=n∑

i,k=1

EGik(Xt) · (A′tAt)ik.phipr2 (1.4)

Recalling that At = Σ1/2t , it is easy to see that (A2

t )′ik = (Σt)

′ik = ∆ik. Furthermore, as At

and A′t are symmetric,

atsqatsq (1.5) (A2t )′ = A′tAt + AtA

′t = A′tAt + (A′tAt)

T .

Fix 1 6 i < k 6 n. Continuity of the second partial derivatives ensures that Gik = Gki, andtherefore

EGik(Xt) · (A′tAt)ik + EGki(X

t) · (A′tAt)ki

= EGik(Xt)((A′tAt)ik + (A′tAt)ki

)= EGik(X

t) (A2t )′ik = EGik(X

t) ∆ik,

where the penultimate equality follows from (1.5). A similar argument shows that (A′tAt)ii =∆ii/2. Thus (1.1) follows from (1.2), and the proof is complete.

Page 3: GAUSSIAN COMPARISON LEMMA - nobel.web.unc.edunobel.web.unc.edu/files/2017/04/GaussianComparison.pdf · GAUSSIAN COMPARISON LEMMA 3 1.1. Further Reading: Gaussian Tail Bounds. Let

GAUSSIAN COMPARISON LEMMA 3

1.1. Further Reading: Gaussian Tail Bounds. Let Φ̄(x) = 1 − Φ(x) where Φ(x) is thecumulative distribution function of the standard Gaussian distribution. Recall that for x > 0,

Φ̄(x) 61√2πx

e−x2/2.eq:g1eq:g1 (1.6)

The proof of Theorem ?? requires an inequality for the probability that two correlated Gauss-ian random variables each exceeds a common threshold.

lem:biv-norm-tail Lemma 1.2. Let (Z,Zρ) be jointly Gaussian random variables with mean 0, variance 1, andcorrelation E(ZZρ) = ρ ∈ (−1, 1). Then for any u > 0,

eq:zzr0eq:zzr0 (1.7) P(Z > u,Zρ > u) 6(1 + ρ)2

2πu2√

1− ρ2exp

(−u2/(1 + ρ)

).

Proof of Lemma 1.2. Fix u > 0. When ρ > 0 the proof follows from known inequalities inthe literature (see R. Willink, Bounds on the bivariate normal distribution function, Comm.Statist. Theory Methods 33 (2004), pp.2281-2297). Here we consider the case ρ < 0. Note

that we may write Zρ = ρZ +√

1− ρ2Z ′, where Z ′ is a standard Gaussian random variableindependent of Z. By conditioning on the value of Z, it is easy to see that

eq:zzr1eq:zzr1 (1.8) P(Z > u,Zρ > u) =

∫ ∞u

Φ̄ (g(t)) φ(t) dt where g(t) =u− ρt√1− ρ2

.

Now define

η =

√1− ρ1 + ρ

and h(x) = ex2/2 Φ̄(x).

As h′(x) = x ex2/2 Φ̄(x) − 1/

√2π, inequality (1.6) implies that h(x) is decreasing for x > 0.

It follows from equation (1.8) that

P(Z > u,Zρ > u) =

∫ ∞u

e−g(t)2/2 h(g(t))φ(t) dteq:zzr2 (1.9)

6 h(g(u))

∫ ∞u

e−g(t)2/2 φ(t) dt

= h(ηu)

∫ ∞u

e−g(t)2/2 φ(t) dt,

where in the last step we have used the fact that g(u) = ηu. Routine algebra and a change ofvariables establishes that∫ ∞

ue−g(t)

2/2 φ(t) dt = e−u2/2

∫ ∞u

1√2π

exp

(− (t− ρu)2

2(1− ρ2)

)dt(1.10)

=√

1− ρ2 e−u2/2Φ̄(ηu).

Combining (1.9), (1.11), and inequality (1.6) yields the bound (1.7), as desired. �