mlsanityData to 7 Oct 2026

Early Stopping in Deep Networks: Double Descent and How to Eliminate it

arXiv 2007.10099 ↗First posted 20 Jul 2020cs.LG stat.MLcited by 40

Not on the map. Why?

Abstract (arXiv)

Over-parameterized models, such as large deep networks, often exhibit a double descent phenomenon, whereas a function of model size, error first decreases, increases, and decreases at last. This intriguing double descent behavior also occurs as a function of training epochs and has been conjectured to arise because training epochs control the model complexity. In this paper, we show that such epoch-wise double descent arises for a different reason: It is caused by a superposition of two or more bias-variance tradeoffs that arise because different parts of the network are learned at different epochs, and eliminating this by proper scaling of stepsizes can significantly improve the early stopping performance. We show this analytically for i) linear regression, where differently scaled features give rise to a superposition of bias-variance tradeoffs, and for ii) a two-layer neural network, where the first and second layer each govern a bias-variance tradeoff. Inspired by this theory, we study two standard convolutional networks empirically and show that eliminating epoch-wise double descent through adjusting stepsizes of different layers improves the early stopping performance significantly.

Key facts. Cited by 40 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 6; 2022: 10; 2023: 7; 2024: 6; 2025: 8; 2026: 3.

40 papers.

Sort:

By area:

  1. 2022Data Determines Distributional Robustness in Contrastive Language Image Pre-training (CLIP)cited by 137
  2. 2023Unifying Grokking and Double Descentcited by 49
  3. 2022On the Impossible Safety of Large AI Modelscited by 27
  4. 2021Multi-scale Feature Learning Dynamics: Insights for Double Descentcited by 24
  5. 2021When and how epochwise double descent happenscited by 20
  6. 2021Provable Continual Learning via Sketched Jacobian Approximationscited by 15
  7. 2023Over-training with Mixup May Hurt Generalizationcited by 13
  8. 2022Defects of Convolutional Decoder Networks in Frequency Representationcited by 10
  9. 2021Disparity Between Batches as a Signal for Early Stoppingcited by 9
  10. 2022Regularization-wise double descent: Why it occurs and how to eliminate itcited by 9
  11. 2024Post-Hoc Reversal: Are We Selecting Models Prematurely?cited by 7
  12. 2025What Can Grokking Teach Us About Learning Under Nonstationarity?cited by 7
28 more
  1. 2022Benign Overfitting in Classification: Provably Counter Label Noise with Larger Modelscited by 5
  2. 2024Swing-by Dynamics in Concept Learning and Compositional Generalizationcited by 5
  3. 2021Optimization Variance: Exploring Generalization Properties of DNNscited by 4
  4. 2021Trap of Feature Diversity in the Learning of MLPscited by 4
  5. 2022Image Augmentation for Satellite Imagescited by 3
  6. 2023Representation Learning Dynamics of Self-Supervised Modelscited by 3
  7. 2024Towards Understanding Epoch-wise Double descent in Two-layer Linear Neural Networkscited by 3
  8. 2025Not All Explanations for Deep Learning Phenomena Are Equally Valuablecited by 3
  9. 2022Towards Theoretical Analysis of Transformation Complexity of ReLU DNNscited by 2
  10. 2023Dropout Drops Double Descentcited by 2
  11. 2024Unified Neural Network Scaling Laws and Scale-time Equivalencecited by 2
  12. 2024On Local Overfitting and Forgetting in Deep Neural Networkscited by 2
  13. 2025A dynamic view of some anomalous phenomena in SGDcited by 2
  14. 2022Information FOMO: The unhealthy fear of missing out on information. A method for removing misleading data for healthier modelscited by 1
  15. 2025Early-stopping for Transformer model trainingcited by 1
  16. 2022Generalizing similarity in noisy setups: the DIBS phenomenoncited by 0
  17. 2022Feature Weaken: Vicinal Data Augmentation for Classificationcited by 0
  18. 2023Double Descent of Discrepancy: A Task-, Data-, and Model-Agnostic Phenomenoncited by 0
  19. 2023Gibbs-Based Information Criteria and the Over-Parameterized Regimecited by 0
  20. 2023Relearning Forgotten Knowledge: on Forgetting, Overfit and Training-Free Ensembles of DNNscited by 0
  21. 2024Accelerating Recommender Model Training by Dynamically Skipping Stale Embeddingscited by 0
  22. 2025On the Relationship Between Double Descent of CNNs and Shape/Texture Bias Under Learning Processcited by 0
  23. 2025Forget Me Not: Fighting Local Overfitting with Knowledge Fusion and Distillationcited by 0
  24. 2025GRADSTOP: Early Stopping of Gradient Descent via Posterior Samplingcited by 0
  25. 2025Theoretical Foundations of Representation Learning using Unlabeled Data: Statistics and Optimizationcited by 0
  26. 2026Deep Exploration of Epoch-wise Double Descent in Noisy Data: Signal Separation, Large Activation, and Benign Overfittingcited by 0
  27. 2026Practical Scaling Laws: Converting Compute into Performance in a Data-Constrained Worldcited by 0
  28. 2026A Data-dependent Early Stopping Rule using Rademacher Complexity with L1-normcited by 0