arXiv Machine Learning By Zhenyu Liao, Michael W. Mahoney

Random Matrix Theory for Deep Learning: Beyond Eigenvalues of Linear Models

Read the original on arXiv Machine Learning →

arXiv:2506. 13139v3 Announce Type: replace-cross Abstract: Modern Machine Learning (ML) and Deep Neural Networks (DNNs) often operate on high-dimensional data and rely on overparameterized models, where classical low-dimensional intuitions break down.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Jul 15

How the Hessian-Spectrum of Neural Networks Depends on Data

The Hessian matrix is an important quantity of interest when it comes to studying the loss landscape and optimization dynamics in deep learning, as well as designing measures of generalization, second-order learning algorithms, etc. Prior works have focused on empirical results or pursued a theoretical treatment under overly simplified settings.

arXiv Machine Learning
Jun 17

Eigen-Spike Emergence and Quadratic Equivalents for Conjugate Kernels on Nonlinearly Separable Data

arXiv:2605. 29669v2 Announce Type: replace-cross Abstract: Recent work in random matrix theory (RMT) has developed the notion of deterministic equivalents: typically linear surrogate models that approximate the spectral behavior of large nonlinear random matrices, such as nonlinear feature maps in neural networks (NNs).

By Collin Cranston, Zhichao Wang, Todd Kemp, Michael W. Mahoney
arXiv Machine Learning
Jul 16

How the Hessian-Spectrum of Neural Networks Depends on Data

arXiv:2607. 13631v1 Announce Type: new Abstract: The Hessian matrix is an important quantity of interest when it comes to studying the loss landscape and optimization dynamics in deep learning, as well as designing measures of generalization, second-order learning algorithms, etc.

By Jasraj Singh, Enea Monzio Compagnoni, Antonio Orvieto