Entrywise application of non-linear functions on orthogonally invariant matrices
Roland Speicher, Alexander Wendel
TL;DR
The paper develops a general framework for understanding how entrywise non-linear transformations of symmetric, orthogonally invariant random matrices affect the limiting eigenvalue distribution. Using a cumulant-based analysis and the Leonov–Shiryaev formula, it derives a Gaussian equivalence principle: the transformed matrix Y_N has the same asymptotic spectrum as a linear combination with an independent GOE, $ ilde{Y}_N= heta_1 X_N+ heta_2 Z_N$, where $g$ is Gaussian and $ heta_1=oldsymbol{b E}[f'(g)]$, $ heta_2^2=oldsymbol{b E}[f(g)^2]-oldsymbol{b E}[f(g)]^2- heta_1^2oldsymbol{ ext{Var}}(X_N)$. This leads to a free-convolution description of the spectrum and extends to multivariate inputs, with concrete examples such as ReLU and the maximum function, including correlated cases validated numerically. The results provide a broad, interpretable principle for non-linear entrywise perturbations in high-dimensional rotationally invariant models, with implications for understanding non-linear preprocessing in learning and physics-inspired matrix models.
Abstract
In this article, we investigate how the entrywise application of a non-linear function to symmetric orthogonally invariant random matrix ensembles alters the spectral distribution. We treat also the multivariate case where we apply multivariate functions to entries of several orthogonally invariant matrices; where even correlations between the matrices are allowed. We find that in all those cases a Gaussian equivalence principle holds, that is, the asymptotic effect of the non-linear function is the same as taking a linear combination of the involved matrices and an additional independent GOE. The ReLU-function in the case of one matrix and the max-function in the case of two matrices provide illustrative examples.
