2017/02/17 by Louart, Cosme, Liao, Zhenyu, Couillet, Romain · 10 citations
#FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Probability (math.PR)
paper · doi:10.48550/arxiv.1702.05419
This article studies the Gram random matrix model G=\frac1TΣ\rm TΣ, Σ=σ(WX), classically found in the analysis of random feature maps and random neural networks, where X=[x1,…,xT]∈\mathbb Rp× T is a (data) matrix of bounded norm, W∈\mathbb Rn× p is a matrix of independent zero-mean unit variance entries, and σ:\mathbb R→\mathbb R is a Lipschitz continuous (activation) function --- σ(WX) being understood entry-wise. By means of a key concentration of measure lemma arising from non-asymptotic random matrix arguments, we prove that, as n,p,T grow large at the same rate, the resolvent Q=(G+γIT)-1, for γ>0, has a similar behavior as that met in sample covariance matrix models, involving notably the moment Φ=\fracTn\mathbb E[G], which provides in passing a deterministic equivalent for the empirical spectral measure of G. Application-wise, this result enables the estimation of the asymptotic performance of single-layer random neural networks. This in turn provides practical insights into the underlying mechanisms into play in random neural networks, entailing several unexpected consequences, as well as a fast practical means to tune the network hyperparameters.