Bulk Phase Transition and Edge Behavior in Temporally Correlated Random Matrices
arXiv:2608.23944
2026
Architecture
2 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper provides a concrete mechanism by which temporal or coordinate-wise correlations in Gaussian random matrices deform the bulk spectrum: correlated entries sharing a row create a combinatorial hub contribution, while long-range correlations produce a fourth-moment transition at correlation exponent \(\gamma_c=1/2\). A second threshold, \(\gamma=1\), separates summable from nonsummable correlations and controls the flatness assumptions needed for stable matrix-Dyson edge behavior. These mechanisms can be transferred to neural networks by designing and stress-testing correlated weight initialization or cross-layer weight sharing, with explicit spectral and moment thresholds rather than relying only on validation accuracy.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Construct deep or recurrent networks whose layer weights are correlated across depth with a prescribed power-law covariance, rather than either fully tying or fully independently sampling layers. The paper predicts two usable design boundaries: \(\gamma=1/2\) for divergence of correlation-induced fourth moments and \(\gamma=1\) for loss of summable-correlation flatness.
Useful7/10
Difficulty6/10
Novelty8/10
✗ Failed on benchmark
2026
Initialize each row of a neural weight matrix as a stationary correlated Gaussian process instead of using independent entries, but constrain its correlation tail to remain on the finite-fourth-moment side of the transition. This creates controllable structured spectra while avoiding the heavy-edge regime predicted for correlations slower than \(t^{-1/2}\).
Useful7/10
Difficulty4/10
Novelty7/10