Learning Trajectories are Generalization Indicators
Not on the map. Why?
Abstract (arXiv)
This paper explores the connection between learning trajectories of Deep Neural Networks (DNNs) and their generalization capabilities when optimized using (stochastic) gradient descent algorithms. Instead of concentrating solely on the generalization error of the DNN post-training, we present a novel perspective for analyzing generalization error by investigating the contribution of each update step to the change in generalization error. This perspective allows for a more direct comprehension of how the learning trajectory influences generalization error. Building upon this analysis, we propose a new generalization bound that incorporates more extensive trajectory information. Our proposed generalization bound depends on the complexity of learning trajectory and the ratio between the bias and diversity of training set. Experimental findings reveal that our method effectively captures the generalization error throughout the training process. Furthermore, our approach can also track changes in generalization error when adjustments are made to learning rates and label noise levels. These results demonstrate that learning trajectory information is a valuable indicator of a model's generalization capabilities.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 30 of its 47 references that are in the map. First posted on arXiv 25 Apr 2023.
Builds on
30 of 47 references.
References · 30
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 413
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
- 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
- 2017Three Factors Influencing Minima in SGDcited by 270
- 2019Uniform convergence may be unable to explain generalization in deep learningcited by 223
- 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 213
- 2020Stability of Stochastic Gradient Descent on Nonsmooth Convex Lossescited by 172
- 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
18 more
- 2020Implicit Gradient Regularizationcited by 145
- 2019Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimatescited by 118
- 2020Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descentcited by 118
- 2015How much does your data exploration overfit? Controlling bias via information usagecited by 95
- 2020Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithmscited by 89
- 2021Information-Theoretic Generalization Bounds for Stochastic Gradient Descentcited by 84
- 2022Understanding the unstable convergence of gradient descentcited by 84
- 2018Generalization Error Bounds for Noisy, Iterative Algorithmscited by 79
- 2020Catastrophic Fisher Explosion: Early Phase Fisher Matrix Impacts Generalizationcited by 61
- 2021Stability of SGD: Tightness Analysis and Improved Boundscited by 33
- 2022Stability and Generalization of Stochastic Optimization with Nonconvex and Nonsmooth Problemscited by 25
- 2022Better Supervisory Signals by Observing Learning Pathscited by 21
- 2022Beyond Lipschitz: Sharp Generalization and Excess Risk Bounds for Full-Batch GDcited by 19
- 2021Neural Network Weights Do Not Converge to Stationary Points: An Invariant Measure Perspectivecited by 15
- 2022Generalization Bounds for Stochastic Gradient Descent via Localized varepsilon-Coverscited by 11
- 2022On the generalization of learning algorithms that do not convergecited by 9
- 2022Stability Based Generalization Bounds for Exponential Family Langevin Dynamicscited by 8
- 2022Generalization Bounds for Gradient Methods via Discrete and Continuous Priorcited by 5
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 2.
5 papers.
- 2024GenEFT: Understanding Statics and Dynamics of Model Generalization via Effective Theorycited by 4
- 2024A General Theory for Compositional Generalizationcited by 4
- 2023Generalization error bounds for iterative learning algorithms with bounded updatescited by 1
- 2025Stability, Complexity and Data-Dependent Worst-Case Generalization Boundscited by 1
- 2025Feature Dynamics as Implicit Data Augmentation: A Depth-Decomposed View on Deep Neural Network Generalizationcited by 0
- 2025Feature Dynamics as Implicit Data Augmentation: A Depth-Decomposed View on Deep Neural Network Generalization24 Sep 2025
- 2025Stability, Complexity and Data-Dependent Worst-Case Generalization Bounds9 Jul 2025
- 2024A General Theory for Compositional Generalization20 May 2024
- 2024GenEFT: Understanding Statics and Dynamics of Model Generalization via Effective Theory8 Feb 2024
- 2023Generalization error bounds for iterative learning algorithms with bounded updates10 Sep 2023