mlsanityData to 14 Oct 2026

Deep Learning as Neural Low-Degree Filtering: A Spectral Theory of Hierarchical Feature Learning

arXiv 2605.13612 ↗First posted 13 May 2026cs.LG cond-mat.dis-nn stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Understanding how deep neural networks learn useful internal representations from data remains a central open problem in the theory of deep learning. We introduce Neural Low-Degree Filtering (Neural LoFi), a stylized limit of gradient-based training in which hierarchical feature learning becomes an explicit iterative spectral procedure. In this limit, the dynamics at each layer decouple: given the current representation, the next layer selects directions with maximal accessible low-degree correlation to the label. This yields a tractable surrogate mechanism for deep learning, together with a natural kernel-space interpretation. Neural LoFi provides a mathematically explicit framework for studying multi-layer feature learning beyond the lazy regime. It predicts how representations are selected layer by layer, explains how emergence of concepts arises with given sample complexity, and gives a concrete mechanism by which depth progressively constructs new features from old ones through low-degree compositionality. We complement the theory with mechanistic experiments on fully connected and convolutional architectures, showing that Neural LoFi improves over lazy random-feature baselines, recovers meaningful structured filters, and predicts representations aligned with early gradient-descent feature discovery with real datasets.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 128 references that are in the map. First posted on arXiv 13 May 2026.

Builds on

19 of 128 references.

References · 19

  1. 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,167
  2. 2024The Platonic Representation Hypothesiscited by 382
  3. 2023A Theory for Emergence of Complex Skills in Language Modelscited by 113
  4. 2023On Learning Gaussian Multi-index Models with Gradient Flowcited by 57
  5. 2024Asymptotics of Random Feature Regression Beyond the Linear Scaling Regimecited by 26
  6. 2025How Compositional Generalization and Creativity Improve as Diffusion Models are Trainedcited by 25
  7. 2026Deriving Neural Scaling Laws from the statistics of natural languagecited by 23
  8. 2023Mechanism of feature learning in convolutional neural networkscited by 17
  9. 2025Asymptotics of Non-Convex Generalized Linear Models in High-Dimensions: A proof of the replica formulacited by 14
  10. 2026Phase Transitions for Feature Learning in Neural Networkscited by 11
  11. 2025When does Gaussian equivalence fail and how to fix it: Non-universal behavior of random features with quadratic scalingcited by 10
  12. 2026Optimal scaling laws in learning hierarchical multi-index modelscited by 9
7 more
  1. 2024Stochastic gradient descent in high dimensions for multi-spiked tensor PCAcited by 7
  2. 2025Computational Thresholds in Multi-Modal Learning via the Spiked Matrix-Tensor Modelcited by 6
  3. 2025Single-Head Attention in High Dimensions: A Theory of Generalization, Weights Spectra, and Scaling Lawscited by 6
  4. 2025Neural Networks Learn Generic Multi-Index Models Near Information-Theoretic Limitcited by 6
  5. 2026Provable Learning of Random Hierarchy Models and Hierarchical Shallow-to-Deep Chainingcited by 6
  6. 2026Deep Learning of Compositional Targets with Hierarchical Spectral Methodscited by 5
  7. 2026The Weight Gram Matrix Captures Sequential Feature Linearization in Deep Networkscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.