Position: Many generalization measures for deep learning are fragile
Not on the map. Why?
Abstract (arXiv)
In this position paper, we argue that many post-mortem generalization measures -- those computed on trained networks -- are fragile: small training modifications that barely affect the performance of the underlying deep neural network can substantially change a measure's value, trend, or scaling behavior. For example, minor hyperparameter changes, such as learning rate adjustments or switching between SGD variants, can reverse the slope of a learning curve in widely used generalization measures such as the path norm. We also identify subtler forms of fragility. For instance, the PAC-Bayes origin measure is regarded as one of the most reliable, and is indeed less sensitive to hyperparameter tweaks than many other measures. However, it completely fails to capture differences in data complexity across learning curves. This data fragility contrasts with the function-based marginal-likelihood PAC-Bayes bound, which does capture differences in data-complexity, including scaling behavior, in learning curves, but which is not a post-mortem measure. Beyond demonstrating that many post-mortem bounds are fragile, this position paper also argues that developers of new measures should explicitly audit them for fragility.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 61 of its 80 references that are in the map. First posted on arXiv 21 Oct 2025.
Builds on
61 of 80 references.
References · 61
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
- 2017Spectrally-normalized margin bounds for neural networkscited by 686
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
38 more
- 2013Network In Networkcited by 605
- 2017Exploring Generalization in Deep Learningcited by 600
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 582
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
- 2019Benign Overfitting in Linear Regressioncited by 549
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2017Sharp Minima Can Generalize For Deep Netscited by 466
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
- 2021Explaining Neural Scaling Lawscited by 363
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 320
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 314
- 2018Regularisation of Neural Networks by Enforcing Lipschitz Continuitycited by 314
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 307
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 303
- 2015Norm-Based Capacity Control in Neural Networkscited by 299
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2017Size-Independent Sample Complexity of Neural Networkscited by 290
- 2018An Empirical Model of Large-Batch Trainingcited by 281
- 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 279
- 2017Three Factors Influencing Minima in SGDcited by 273
- 2019Uniform convergence may be unable to explain generalization in deep learningcited by 224
- 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 214
- 2018Sensitivity and Generalization in Neural Networks: an Empirical Studycited by 189
- 2018Deep learning generalizes because the parameter-function map is biased towards simple functionscited by 183
- 2017Spectral Norm Regularization for Improving the Generalizability of Deep Learningcited by 182
- 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 157
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
- 2019An Exponential Learning Rate Schedule for Deep Learningcited by 121
- 2018Predicting the Generalization Gap in Deep Networks with Margin Distributionscited by 113
- 2020Tighter risk certificates for neural networkscited by 112
- 2017Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of Entropy-SGD and data-dependent priorscited by 81
- 2020In Search of Robust Measures of Generalizationcited by 79
- 2022PAC-Bayes Compression Bounds So Tight That They Can Explain Generalizationcited by 76
- 2018The Description Length of Deep Learning Modelscited by 72
- 2018Theoretical Analysis of Auto Rate-Tuning by Batch Normalizationcited by 65
- 2019Normalized Flat Minima: Exploring Scale Invariant Definition of Flat Minima for Neural Networks using PAC-Bayesian Analysiscited by 59
50 most cited of 61 All 61 (JSON)
Built on by
Not cited yet.