HDS

Exercise 5.14: Maximum Singular Value of Gaussian Random Matrices

chapter 5 Lipschitz Gaussian

(a)

This is an easy programming exercise. We leave those to the reader.

(b)

Taking the SVD decomposition W=USV, the result follows.

(c)

If the Sudakov-Fernique inequality applies, E[supu,vZu,v]E[supu,vYu,v], the desired result is implied by the Jensen’s inequality: (1)E[supu,vYu,v]=E[g2+h2]n+d.

Reducing to fixed finite subsets {u1,,uN}Sn1 and {v1,,vN}Sd1, we need to show (2)E[(Zui,vjZuk,vl)2]E[(Yui,vjYuk,vl)2] for any i,j,k,l[N]. Using the mutual independence of the standard normal random variables constituting Zu,v and Yu,v (3)E[(Zui,vjZuk,vl)2]=uivjukvlF2,(4)E[(Yui,vjYuk,vl)2]=uiuk22+vjvl22. Application of the inequality derived in Exercise 5.11 implies the assumptions of the Sudakov-Fernique inequality hold. Hence (5)E[supi,j[N]Zui,vj]E[supi,j[N]Yui,vj], and the desired result follows by applying the monotone convergence theorem, first on the r.h.s., then on the l.h.s.

(d)

This follows from Exercise 5.11(c), using that (6)supu,vV(Zu,v)=supu,vE[(uWv)2]=supu,vu22v22=1, which avoids the factor of two when the one-sided version of the Lipschitz Gaussian concentration (Theorem 2.26) is applied.

Published on 1 March 2021.