paper-with-me

홈 › Papers

Beyond Accuracy: A Unified Random Matrix Theory Diagnostic Framework for Crash Classification Models

2026-02-23 · Ibne Farabi Shihab, Sanjeda Akter, Anuj Sharma arxiv

Crash classification models in transportation safety are typically evaluated using accuracy, F1, or AUC, metrics that cannot reveal whether a model is silently overfitting. We introduce a spectral diagnostic framework grounded in Random Matrix Theory (RMT) and Heavy-Tailed Self-Regularization (HTSR) that spans the ML taxonomy: weight matrices for BERT/ALBERT/Qwen2.5, out-of-fold increment matrices for XGBoost/Random Forest, empirical Hessians for Logistic Regression, induced affinity matrices for Decision Trees, and Graph Laplacians for KNN. Evaluating nine model families on two Iowa DOT crash classification tasks (173,512 and 371,062 records respectively), we find that the power-law exponent $α$ provides a structural quality signal: well-regularized models consistently yield $α$ within $[2, 4]$ (mean $2.87 \pm 0.34$), while overfit variants show $α< 2$ or spectral collapse. We observe a strong rank correlation between $α$ and expert agreement (Spearman $ρ= 0.89$, $p < 0.001$), suggesting spectral quality captures model behaviors aligned with expert reasoning. We propose an $α$-based early stopping criterion and a spectral model selection protocol, and validate both against cross-validated F1 baselines. Sparse Lanczos approximations make the framework scalable to large datasets.

📄 PDF Abstract BibTeX arXiv:2602.19528

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

The Singular Value Decomposition, Applications and Beyond

2015-10-29 · Zhihua Zhang

The singular value decomposition (SVD) is not only a classical theory in matrix computation and analysis, but also is a powerful tool in machine learning and modern data analysis. In this tutorial we first study the basi…

BIG-bench Machine LearningMatrix Completion

Spectral Geometry for Deep Learning: Compression and Hallucination Detection via Random Matrix Theory

2026-01-24 · Davide Ettori arxiv

Large language models and deep neural networks achieve strong performance but suffer from reliability issues and high computational cost. This thesis proposes a unified framework based on spectral geometry and random mat…

Knowledge Distillation

High-Dimensional Asymptotics of Prediction: Ridge Regression and Classification

2015-07-10 · Edgar Dobriban, Stefan Wager

We provide a unified analysis of the predictive risk of ridge regression and regularized discriminant analysis in a dense random effects model. We work in a high-dimensional asymptotic regime where $p, n \to \infty$ and …

ClassificationGeneral ClassificationregressionVocal Bursts Intensity Prediction

Differentially Private Spectral Graph Clustering: Balancing Privacy, Accuracy, and Efficiency

2025-10-08 · Antti Koskela, Mohamed Seif, H. Vincent Poor, Andrea J. Goldsmith arxiv

We study spectral graph clustering under edge differential privacy. We propose a matrix shuffling mechanism that combines randomized edge flipping with a random permutation of the adjacency matrix. While edge flipping al…

Graph Clustering

Enhancing Accuracy in Deep Learning Using Random Matrix Theory

2023-10-04 · Leonid Berlyand, Etienne Sandier, Yitzchak Shmalo, Lei Zhang

We explore the applications of random matrix theory (RMT) in the training of deep neural networks (DNNs), focusing on layer pruning that is reducing the number of DNN parameters (weights). Our numerical results show that…

Deep Learning