This article studies the Gram random matrix model $G=\frac1T\Sigma^{\rm T}\Sigma$, $\Sigma=\sigma(WX)$, classically found in random neural networks, where $X=[x_1,\ldots,x_T]\in\mathbb{R}^{p\times T}$ is a (data) matrix of bounded norm, $W\in\mathbb{R}^{n\times p}$ is a matrix of independent zero-mean unit variance entries, and $\sigma:\mathbb{R}\to\mathbb{R}$ is a Lipschitz continuous (activation) function --- $\sigma(WX)$ being understood entry-wise. We prove that, as $n,p,T$ grow large at the same rate, the resolvent $Q=(G+\gamma I_T)^{-1}$, for $\gamma>0$, has a similar behavior as that met in sample covariance matrix models, involving notably the moment $\Phi=\frac{T}n\mathrm{E}[G]$, which provides in passing a deterministic equivalent for the empirical spectral measure of $G$. This result, established by means of concentration of measure arguments, 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.

研究Gram随机矩阵模型，证明当$n,p,T$同时增长时，具有相似行为与样本协方差矩阵模型，应用于单层随机神经网络的渐进性能估计，提供了对随机神经网络基础机制的实际见解，并快速调整网络超参数。

神经网络的随机矩阵方法