mlsanityData to 7 Oct 2026

Why flatness does and does not correlate with generalization for deep neural networks

arXiv 2103.06219 ↗First posted 10 Mar 2021cs.LG stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

The intuition that local flatness of the loss landscape is correlated with better generalization for deep neural networks (DNNs) has been explored for decades, spawning many different flatness measures. Recently, this link with generalization has been called into question by a demonstration that many measures of flatness are vulnerable to parameter re-scaling which arbitrarily changes their value without changing neural network outputs. Here we show that, in addition, some popular variants of SGD such as Adam and Entropy-SGD, can also break the flatness-generalization correlation. As an alternative to flatness measures, we use a function based picture and propose using the log of Bayesian prior upon initialization, log P(f), as a predictor of the generalization when a DNN converges on function f after training to zero error. The prior is directly proportional to the Bayesian posterior for functions that give zero error on a test set. For the case of image classification, we show that log P(f) is a significantly more robust predictor of generalization than flatness measures are. Whilst local flatness measures fail under parameter re-scaling, the prior/posterior, which is global quantity, remains invariant under re-scaling. Moreover, the correlation with generalization as a function of data complexity remains good for different variants of SGD.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 43 of its 72 references that are in the map. First posted on arXiv 10 Mar 2021.

Builds on

43 of 72 references.

References · 43

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  3. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  4. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
  5. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  6. 2018On the Spectral Bias of Neural Networkscited by 1,321
  7. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  8. 2017A Closer Look at Memorization in Deep Networkscited by 936
  9. 2017Spectrally-normalized margin bounds for neural networkscited by 681
  10. 2017Deep Neural Networks as Gaussian Processescited by 617
  11. 2017Exploring Generalization in Deep Learningcited by 595
  12. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
31 more
  1. 2019Fantastic Generalization Measures and Where to Find Themcited by 507
  2. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  3. 2019Frequency Principle: Fourier Analysis Sheds Light on Deep Neural Networkscited by 360
  4. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
  5. 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 314
  6. 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 313
  7. 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
  8. 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 278
  9. 2018Sensitivity and Generalization in Neural Networks: an Empirical Studycited by 187
  10. 2018Deep learning generalizes because the parameter-function map is biased towards simple functionscited by 180
  11. 2018Bayesian Deep Convolutional Networks with Many Channels are Gaussian Processescited by 164
  12. 2016Eigenvalues of the Hessian in Deep Learning: Singularity and Beyondcited by 156
  13. 2019Tensor Programs I: Wide Feedforward or Recurrent Neural Networks of Any Architecture are Gaussian Processescited by 148
  14. 2018Deep Convolutional Networks as shallow Gaussian Processescited by 137
  15. 2018Predicting the Generalization Gap in Deep Networks with Margin Distributionscited by 111
  16. 2016Why does deep and cheap learning work so well?cited by 100
  17. 2018Hessian-based Analysis of Large Batch Training and Robustness to Adversariescited by 87
  18. 2017Towards Understanding Generalization of Deep Learning: Perspective of Loss Landscapescited by 84
  19. 2019A Fine-Grained Spectral Perspective on Neural Networkscited by 68
  20. 2019Normalized Flat Minima: Exploring Scale Invariant Definition of Flat Minima for Neural Networks using PAC-Bayesian Analysiscited by 58
  21. 2020Rethinking Parameter Counting in Deep Models: Effective Dimensionality Revisitedcited by 50
  22. 2020Is SGD a Bayesian sampler? Well, almostcited by 50
  23. 2020Generalization bounds for deep learningcited by 38
  24. 2019Neural networks are a priori biased towards Boolean functions with low entropycited by 24
  25. 2021Learning by Turning: Neural Architecture Aware Optimisationcited by 23
  26. 2018Energy-entropy competition and the effectiveness of stochastic gradient descent in machine learningcited by 20
  27. 2019Asymptotic learning curves of kernel methods: empirical data v.s. Teacher-Student paradigmcited by 20
  28. 2019How noise affects the Hessian spectrum in overparameterized neural networkscited by 17
  29. 2019A Scale Invariant Flatness Measure for Deep Network Minimacited by 8
  30. 2019A Reparameterization-Invariant Flatness Measure for Deep Neural Networkscited by 7
  31. 2018A Surprising Linear Relationship Predicts Test Performance in Deep Networkscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 2; 2024: 2; 2025: 2; 2026: 3.

13 papers.

Sort: