Evaluating Singular Value Thresholds for DNN Weight Matrices based on Random Matrix Theory
arXiv stat.ML / 4/10/2026
💬 OpinionIdeas & Deep AnalysisModels & Research
Key Points
- The paper studies how to choose singular-value thresholds for low-rank approximations of DNN weight matrices using random matrix theory to separate signal from noise components.
- It models each weight matrix as the sum of a signal matrix plus a noise matrix, then removes “noise-related” singular values to obtain the low-rank approximation.
- To validate whether a threshold is appropriate, the authors introduce an evaluation metric based on cosine similarity between singular vectors of the inferred signal and the original weight matrix.
- Numerical experiments compare two threshold estimation methods using the proposed cosine-similarity metric to judge approximation adequacy.
Related Articles

GLM 5.1 tops the code arena rankings for open models
Reddit r/LocalLLaMA
can we talk about how AI has gotten really good at lying to you?
Reddit r/artificial

AI just found thousands of zero-days. Your firewall is still pattern-matching from 2014
Dev.to

Emergency Room and the Vanishing Moat
Dev.to

I Built a 100% Browser-Based OCR That Never Uploads Your Documents — Here's How
Dev.to