mlsanityData to 14 Oct 2026

Deep Exploration of Epoch-wise Double Descent in Noisy Data: Signal Separation, Large Activation, and Benign Overfitting

arXiv 2601.08316 ↗First posted 13 Jan 2026cs.LG cs.CV stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Deep double descent is one of the key phenomena underlying the generalization capability of deep learning models. In this study, epoch-wise double descent, which is delayed generalization following overfitting, was empirically investigated by focusing on the evolution of internal structures. Fully connected neural networks of three different sizes were trained on the CIFAR-10 dataset with 30% label noise. By decomposing the loss curves into signal contributions from clean and noisy training data, the epoch-wise evolutions of internal signals were analyzed separately. Three main findings were obtained from this analysis. First, the model achieved strong re-generalization on test data even after perfectly fitting noisy training data during the double descent phase, corresponding to a "benign overfitting" state. Second, noisy data were learned after clean data, and as learning progressed, their corresponding internal activations became increasingly separated in outer layers; this enabled the model to overfit only noisy data. Third, a single, very large activation emerged in the shallow layer across all models; this phenomenon is referred as "outliers," "massive activa-tions," and "super activations" in recent large language models and evolves with re-generalization. The magnitude of large activation correlated with input patterns but not with output patterns. These empirical findings directly link the recent key phenomena of "deep double descent," "benign overfitting," and "large activation", and support the proposal of a novel scenario for understanding deep double descent.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 43 of its 52 references that are in the map. First posted on arXiv 13 Jan 2026.

Builds on

43 of 52 references.

References · 43

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  3. 2017A Closer Look at Memorization in Deep Networkscited by 942
  4. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  5. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
  6. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
  7. 2019Benign Overfitting in Linear Regressioncited by 549
  8. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
  9. 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 416
  10. 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
  11. 2024Massive Activations in Large Language Modelscited by 294
  12. 2019Two models of double descent for weak featurescited by 195
31 more
  1. 2020Benign overfitting in ridge regressioncited by 153
  2. 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 146
  3. 2021Understanding and Overcoming the Challenges of Efficient Transformer Quantizationcited by 141
  4. 2020Optimal Regularization Can Mitigate Double Descentcited by 109
  5. 2020Rethinking Bias-Variance Trade-off for Generalization of Neural Networkscited by 107
  6. 2022Robust Training under Label Noise by Over-parameterizationcited by 93
  7. 2022Benign Overfitting in Two-layer Convolutional Neural Networkscited by 91
  8. 2019A Model of Double Descent for High-dimensional Binary Linear Classificationcited by 81
  9. 2020Understanding Double Descent Requires a Fine-Grained Bias-Variance Decompositioncited by 76
  10. 2020Triple descent and the two kinds of overfitting: Where & why do they appear?cited by 65
  11. 2025Deep Learning is Not So Mysterious or Differentcited by 56
  12. 2024The Super Weight in Large Language Modelscited by 52
  13. 2024Deep Networks Always Grok and Here is Whycited by 51
  14. 2023Unifying Grokking and Double Descentcited by 50
  15. 2023High-dimensional analysis of double descent for linear regression with random projectionscited by 47
  16. 2020Multiple Descent: Design Your Own Generalization Curvecited by 45
  17. 2020Early Stopping in Deep Networks: Double Descent and How to Eliminate itcited by 41
  18. 2023Benign Overfitting for Two-layer ReLU Convolutional Neural Networkscited by 34
  19. 2023Benign Overfitting and Grokking in ReLU Networks for XOR Cluster Datacited by 33
  20. 2023Benign Overfitting in Linear Classifiers and Leaky ReLU Networks from KKT Conditions for Margin Maximizationcited by 29
  21. 2021Multi-scale Feature Learning Dynamics: Insights for Double Descentcited by 24
  22. 2021When and how epochwise double descent happenscited by 21
  23. 2021Model, sample, and epoch-wise descents: exact solution of gradient flow in the random feature modelcited by 17
  24. 2022Homophily modulates double descent generalization in graph convolution networkscited by 13
  25. 2020On the Universality of the Double Descent Peak in Ridgeless Regressioncited by 11
  26. 2023On the Lipschitz Constant of Deep Networks and Double Descentcited by 11
  27. 2025Grokking in LLM Pretraining? Monitor Memorization-to-Generalization without Testcited by 10
  28. 2023Unraveling the Enigma of Double Descent: An In-depth Analysis through the Lens of Learned Feature Spacecited by 6
  29. 2022Deep Learning is Provably Robust to Symmetric Label Noisecited by 2
  30. 2025A dynamic view of some anomalous phenomena in SGDcited by 2
  31. 2025Generalisation and benign over-fitting for linear regression onto random functional covariatescited by 1

Built on by

Not cited yet.