mlsanityData to 7 Oct 2026

The Curious Case of Benign Memorization

arXiv 2210.14019 ↗First posted 25 Oct 2022cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

Despite the empirical advances of deep learning across a variety of learning tasks, our theoretical understanding of its success is still very restricted. One of the key challenges is the overparametrized nature of modern models, enabling complete overfitting of the data even if the labels are randomized, i.e. networks can completely textitmemorize all given patterns. While such a memorization capacity seems worrisome, in this work we show that under training protocols that include textitdata augmentation, neural networks learn to memorize entirely random labels in a benign way, i.e. they learn embeddings that lead to highly non-trivial performance under nearest neighbour probing. We demonstrate that deep models have the surprising ability to separate noise from signal by distributing the task of memorization and feature learning to different layers. As a result, only the very last layers are used for memorization, while preceding layers encode performant features which remain largely unaffected by the label noise. We explore the intricate role of the augmentations used for training and identify a memorization-generalization trade-off in terms of their diversity, marking a clear distinction to all previous works. Finally, we give a first explanation for the emergence of benign memorization by showing that textitmalign memorization under data augmentation is infeasible due to the insufficient capacity of the model for the increased sample size. As a consequence, the network is forced to leverage the correlated nature of the augmentations and as a result learns meaningful features. To complete the picture, a better theory of feature learning in deep neural networks is required to fully understand the origins of this phenomenon.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 54 of its 67 references that are in the map. First posted on arXiv 25 Oct 2022.

Builds on

54 of 67 references.

References · 54

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  4. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  5. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  6. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  7. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  8. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  9. 2020Exploring Simple Siamese Representation Learningcited by 2,853
  10. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  11. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
  12. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
38 more
  1. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  2. 2016Understanding intermediate layers using linear classifier probescited by 1,279
  3. 2022CoCa: Contrastive Captioners are Image-Text Foundation Modelscited by 1,265
  4. 2021Swin Transformer V2: Scaling Up Capacity and Resolutioncited by 1,215
  5. 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
  6. 2021Scaling Vision Transformerscited by 993
  7. 2017A Closer Look at Memorization in Deep Networkscited by 936
  8. 2017Spectrally-normalized margin bounds for neural networkscited by 681
  9. 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
  10. 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 580
  11. 2021CoAtNet: Marrying Convolution and Attention for All Data Sizescited by 566
  12. 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
  13. 2019Benign Overfitting in Linear Regressioncited by 544
  14. 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
  15. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
  16. 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 492
  17. 2020Meta Pseudo Labelscited by 372
  18. 2021Provable Guarantees for Self-Supervised Deep Learning with Spectral Contrastive Losscited by 311
  19. 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
  20. 2018Stronger generalization bounds for deep nets via a compression approachcited by 306
  21. 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 304
  22. 2014Discriminative Unsupervised Feature Learning with Exemplar Convolutional Neural Networkscited by 299
  23. 2015Norm-Based Capacity Control in Neural Networkscited by 299
  24. 2017Deep Learning is Robust to Massive Label Noisecited by 164
  25. 2021On Feature Decorrelation in Self-Supervised Learningcited by 160
  26. 2017The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learningcited by 150
  27. 2021Toward Understanding the Feature Learning Process of Self-supervised Contrastive Learningcited by 119
  28. 2019Finite Depth and Width Corrections to the Neural Tangent Kernelcited by 114
  29. 2018A Kernel Theory of Modern Data Augmentationcited by 106
  30. 2022Understanding Contrastive Learning Requires Incorporating Inductive Biasescited by 96
  31. 2019What Can ResNet Learn Efficiently, Going Beyond Kernels?cited by 91
  32. 2021Augmentation Strategies for Learning with Noisy Labelscited by 86
  33. 2022Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Datacited by 74
  34. 2020What Do Neural Networks Learn When Trained With Random Labels?cited by 58
  35. 2020On the Generalization Effects of Linear Transformations in Data Augmentationcited by 47
  36. 2020How benign is benign overfitting?cited by 40
  37. 2021Neural Architecture Search with Random Labelscited by 33
  38. 2019To Balance or Not to Balance: A Simple-yet-Effective Approach for Learning with Long-Tailed Distributionscited by 20

50 most cited of 54 All 54 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

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

11 papers.