mlsanityData to 14 Oct 2026

Phases of learning dynamics in artificial neural networks: with or without mislabeled data

arXiv 2101.06509 ↗First posted 16 Jan 2021cs.LG cond-mat.stat-mech physics.data-ancited by 4

Not on the map. Why?

Abstract (arXiv)

Despite tremendous success of deep neural network in machine learning, the underlying reason for its superior learning capability remains unclear. Here, we present a framework based on statistical physics to study dynamics of stochastic gradient descent (SGD) that drives learning in neural networks. By using the minibatch gradient ensemble, we construct order parameters to characterize dynamics of weight updates in SGD. Without mislabeled data, we find that the SGD learning dynamics transitions from a fast learning phase to a slow exploration phase, which is associated with large changes in order parameters that characterize the alignment of SGD gradients and their mean amplitude. In the case with randomly mislabeled samples, SGD learning dynamics falls into four distinct phases. The system first finds solutions for the correctly labeled samples in phase I, it then wanders around these solutions in phase II until it finds a direction to learn the mislabeled samples during phase III, after which it finds solutions that satisfy all training samples during phase IV. Correspondingly, the test error decreases during phase I and remains low during phase II; however, it increases during phase III and reaches a high plateau during phase IV. The transitions between different phases can be understood by changes of order parameters that characterize the alignment of mean gradients for the correctly and incorrectly labeled samples and their (relative) strength during learning. We find that individual sample losses for the two datasets are most separated during phase II, which leads to a cleaning process to eliminate mislabeled samples for improving generalization.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 23 of its 32 references that are in the map. First posted on arXiv 16 Jan 2021.

Builds on

23 of 32 references.

References · 23

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  3. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  4. 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,475
  5. 2014How transferable are features in deep neural networks?cited by 1,225
  6. 2017A Closer Look at Memorization in Deep Networkscited by 942
  7. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
  8. 2015Deep Learning and the Information Bottleneck Principlecited by 802
  9. 2017Exploring Generalization in Deep Learningcited by 600
  10. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 521
  11. 2019Fantastic Generalization Measures and Where to Find Themcited by 513
  12. 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
11 more
  1. 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
  2. 2019Unsupervised Label Noise Modeling and Loss Correctioncited by 328
  3. 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 261
  4. 2017High-dimensional dynamics of generalization error in neural networkscited by 241
  5. 2019Gradient Descent with Early Stopping is Provably Robust to Label Noise for Overparameterized Neural Networkscited by 159
  6. 2020Generalisation error in learning with random features and the hidden manifold modelcited by 127
  7. 2017Stochastic gradient descent performs variational inference, converges to limit cycles for deep networkscited by 109
  8. 2019Scaling description of generalization with number of parameters in deep learningcited by 83
  9. 2017SGD Learns Over-parameterized Networks that Provably Generalize on Linearly Separable Datacited by 79
  10. 2018Energy-entropy competition and the effectiveness of stochastic gradient descent in machine learningcited by 20
  11. 2020How neural networks find generalizable solutions: Self-tuned annealing in deep learningcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1; 2026: 2.

4 papers.