mlsanityData to 7 Oct 2026

Network Dynamics-Based Framework for Understanding Deep Neural Networks

arXiv 2501.02436 ↗First posted 5 Jan 2025cs.LG nlin.CD stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Advancements in artificial intelligence call for a deeper understanding of the fundamental mechanisms underlying deep learning. In this work, we propose a theoretical framework to analyze learning dynamics through the lens of dynamical systems theory. We redefine the notions of linearity and nonlinearity in neural networks by introducing two fundamental transformation units at the neuron level: order-preserving transformations and non-order-preserving transformations. Different transformation modes lead to distinct collective behaviors in weight vector organization, different modes of information extraction, and the emergence of qualitatively different learning phases. Transitions between these phases may occur during training, accounting for key phenomena such as grokking. To further characterize generalization and structural stability, we introduce the concept of attraction basins in both sample and weight spaces. The distribution of neurons with different transformation modes across layers, along with the structural characteristics of the two types of attraction basins, forms a set of core metrics for analyzing the performance of learning models. Hyperparameters such as depth, width, learning rate, and batch size act as control variables for fine-tuning these metrics. Our framework not only sheds light on the intrinsic advantages of deep learning, but also provides a novel perspective for optimizing network architectures and training strategies.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 39 references that are in the map. First posted on arXiv 5 Jan 2025.

Builds on

18 of 39 references.

References · 18

  1. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  2. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
  3. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
  4. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
  5. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
  6. 2021Explaining Neural Scaling Lawscited by 353
  7. 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 219
  8. 2024What Matters in Transformers? Not All Attention is Neededcited by 83
  9. 2023How Two-Layer Neural Networks Learn, One (Giant) Step at a Timecited by 67
  10. 2016Unreasonable Effectiveness of Learning Neural Networks: From Accessible States and Robust Ensembles to Basic Algorithmic Schemescited by 40
  11. 2022Information Flow in Deep Neural Networkscited by 22
  12. 2024Deep Grokking: Would Deep Neural Networks Generalize Better?cited by 13
6 more
  1. 2022The activity-weight duality in feed forward neural networks: The geometric determinants of generalizationcited by 12
  2. 2020Inferring Global Dynamics Using a Learning Machinecited by 4
  3. 2023Energy--Information Trade-off Induces Continuous and Discontinuous Phase Transitions in Lateral Predictive Codingcited by 3
  4. 2024Fermi-Bose Machine achieves both generalization and adversarial robustnesscited by 2
  5. 2021Cycle-tree guided attack of random K-core: Spin glass model and efficient message-passing algorithmcited by 1
  6. 2022How and what to learn:The modes of machine learningcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.