mlsanityData to 14 Oct 2026

A Two-Phase Perspective on Deep Learning Dynamics

arXiv 2504.12700 ↗First posted 17 Apr 2025hep-th cond-mat.dis-nn cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We propose that learning in deep neural networks proceeds in two phases: a rapid curve fitting phase followed by a slower compression or coarse graining phase. This view is supported by the shared temporal structure of three phenomena: grokking, double descent and the information bottleneck, all of which exhibit a delayed onset of generalization well after training error reaches zero. We empirically show that the associated timescales align in two rather different settings. Mutual information between hidden layers and input data emerges as a natural progress measure, complementing circuit-based metrics such as local complexity and the linear mapping number. We argue that the second phase is not actively optimized by standard training algorithms and may be unnecessarily prolonged. Drawing on an analogy with the renormalization group, we suggest that this compression phase reflects a principled form of forgetting, critical for generalization.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 17 of its 22 references that are in the map. First posted on arXiv 17 Apr 2025.

Builds on

17 of 22 references.

References · 17

  1. 2015Deep Learning and the Information Bottleneck Principlecited by 802
  2. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
  3. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
  4. 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
  5. 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 187
  6. 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 146
  7. 2023Explaining grokking through circuit efficiencycited by 111
  8. 2020Double Trouble in Double Descent : Bias and Variance(s) in the Lazy Regimecited by 95
  9. 2014An exact mapping between the Variational Renormalization Group and Deep Learningcited by 56
  10. 2024Deep Networks Always Grok and Here is Whycited by 51
  11. 2020A Brief Prehistory of Double Descentcited by 44
  12. 2024Why Do You Grok? A Theoretical Analysis of Grokking Modular Additioncited by 36
5 more
  1. 2017Mutual Information, Neural Networks and the Renormalization Groupcited by 33
  2. 2023Benign Overfitting and Grokking in ReLU Networks for XOR Cluster Datacited by 33
  3. 2023Grokking as Compression: A Nonlinear Complexity Perspectivecited by 14
  4. 2020Why Unsupervised Deep Networks Generalizecited by 4
  5. 2020Short sighted deep learningcited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.