Learning Trajectories are Generalization Indicators
Jingwen Fu, Zhizheng Zhang, Dacheng Yin, Yan Lu, Nanning Zheng
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 028d38b1-54f5-4981-8e62-d69a9ef3a075Cited by top-tier papers3
- Topological Generalization Bounds for Discrete-Time Stochastic Optimization AlgorithmsRayna Andreeva, Benjamin Dupuis, Rik Sarkar, Tolga Birdal et al.NeurIPS 2024 · 13 citations
- Generalization Bounds for Kolmogorov-Arnold Networks (KANs) and Enhanced KANs with Lower Lipschitz ComplexityPengqi Li, Lizhong Ding, Jiarun Fu, Chunhui Zhang et al.NeurIPS 2025 · 8 citations
- On the Statistical Mechanisms of Distributional Compositional GeneralizationJingwen Fu, Nanning ZhengICML 2025
Builds on13
- Beyond neural scaling laws: beating power law scaling via data pruningBen Sorscher, Robert Geirhos, Shashank Shekhar, Surya Ganguli et al.NeurIPS 2022 · 720 citations
- Stability of Stochastic Gradient Descent on Nonsmooth Convex LossesRaef Bassily, Vitaly Feldman, Cristóbal Guzmán, Kunal TalwarNeurIPS 2020 · 240 citations
- Implicit Gradient RegularizationDavid G. T. Barrett, Benoit DherinICLR 2021 · 235 citations
- Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient DescentYunwen Lei, Yiming YingICML 2020 · 165 citations
- Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative AlgorithmsMahdi Haghifam, Jeffrey Negrea, Ashish Khisti, Daniel M. Roy et al.NeurIPS 2020 · 124 citations
Related papers
- Hausdorff Dimension, Heavy Tails, and Generalization in Neural NetworksUmut Simsekli, Ozan Sener, George Deligiannidis, Murat A. ErdogduNeurIPS 2020 · 79 citations
- Analyzing Generalization of Neural Networks through Loss Path KernelsYilan Chen, Wei Huang, Hao Wang, Charlotte Loh et al.NeurIPS 2023 · 4 citations
- What training reveals about neural network complexityAndreas Loukas, Marinos Poiitis, Stefanie JegelkaNeurIPS 2021 · 12 citations
- Sharp Generalization for Nonparametric Regression by Over-Parameterized Neural Networks: A Distribution-Free Analysis in Spherical CovariateYingzhen YangICML 2025
- Leveraging Flatness to Improve Information-Theoretic Generalization Bounds for SGDZe Peng, Jian Zhang, Yisen Wang, Lei Qi et al.ICLR 2025
