This analysis uncovers eigenvalue behavior in large perturbations of random matrices, indicating implications for neural network weight matrices.
The paper is concerned with deformed Wigner random matrices. These matrices are closely connected with Deep Neural Networks (DNNs): weight matrices of trained DNNs could be represented in the form $R + S$, where R is random and S is highly correlated. The spectrum of such matrices plays a key role in rigorous underpinning of the novel pruning technique based on Random Matrix Theory. Mathematics has been done only for finite-rank matrix S. However, in practice rank may grow. In this paper we develop asymptotic analysis for the case of growing rank.
No takes yet. Share an insight, caveat, or question.
Afanasiev et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: