Unveiling Memorization-Generalization Coexistence: A Case Study on Arithmetic Tasks with Label Noise
Not on the map. Why?
Abstract (arXiv)
Highly over-parameterized models can simultaneously memorize noisy labels and generalize well, yet how these behaviors coexist remains poorly understood. In this work, we investigate the underlying mechanisms of this coexistence using modular arithmetic tasks under heavy label noise. Through extensive experiments on two-layer neural networks, we find that larger models tend to generalize better under appropriate optimization and model configurations, while noisy labels are memorized faster than clean data. Over-parameterized models internally form a generalization structure, but its expression in the output is suppressed by the need to fit noisy labels. Remarkably, even with 80% label noise, near-perfect test accuracy can be achieved by extracting this internal structure using frequency-based methods. We further propose a task-agnostic method to partition networks into generalization and memorization components. Although this subnetwork improves generalization, it is limited compared with frequency-based extraction, indicating that the generalization structure is distributed across neurons and motivating the development of new tools to retrieve generalizable knowledge from over-parameterized networks.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 37 of its 41 references that are in the map. First posted on arXiv 18 May 2026.
Builds on
37 of 41 references.
References · 37
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2022Emergent Abilities of Large Language Modelscited by 2,512
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 672
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
- 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 582
- 2019Benign Overfitting in Linear Regressioncited by 549
- 2020Scaling Laws for Autoregressive Generative Modelingcited by 522
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
25 more
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2017High-dimensional dynamics of generalization error in neural networkscited by 241
- 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 230
- 2022Memorization Without Overfitting: Analyzing the Training Dynamics of Large Language Modelscited by 220
- 2019Two models of double descent for weak featurescited by 195
- 2019Gradient Descent with Early Stopping is Provably Robust to Label Noise for Overparameterized Neural Networkscited by 159
- 2023The Clock and the Pizza: Two Stories in Mechanistic Explanation of Neural Networkscited by 156
- 2019Harmless interpolation of noisy data in regressioncited by 121
- 2020Optimal Regularization Can Mitigate Double Descentcited by 109
- 2020Rethinking Bias-Variance Trade-off for Generalization of Neural Networkscited by 107
- 2020The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalizationcited by 101
- 2022Robust Training under Label Noise by Over-parameterizationcited by 93
- 2023Grokking modular arithmeticcited by 83
- 2022Can Neural Nets Learn the Same Model Twice? Investigating Reproducibility and Double Descent from the Decision Boundary Perspectivecited by 57
- 2023Unifying Grokking and Double Descentcited by 50
- 2023Feature emergence via margin maximization: case studies in algebraic taskscited by 33
- 2025Superposition Yields Robust Neural Scalingcited by 31
- 2024Emergence in non-neural models: grokking modular arithmetic via average gradient outer productcited by 28
- 2023To grok or not to grok: Disentangling generalization and memorization on corrupted algorithmic datasetscited by 24
- 2024Unified View of Grokking, Double Descent and Emergent Abilities: A Perspective from Circuits Competitioncited by 23
- 2025Provable Scaling Laws of Feature Emergence from Learning Dynamics of Grokkingcited by 15
- 2025Uncovering a Universal Abstract Algorithm for Modular Addition in Neural Networkscited by 10
- 2022Deep Double Descent via Smooth Interpolationcited by 8
- 2015Distinct types of eigenvector localization in networkscited by 4
- 2025The Effect of Label Noise on the Information Content of Neural Representationscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.