mlsanityData to 14 Oct 2026

Grokked Models are Better Unlearners

arXiv 2512.03437 ↗First posted 3 Dec 2025cs.LGcited by 0

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

Grokking-delayed generalization that emerges well after a model has fit the training data-has been linked to robustness and representation quality. We ask whether this training regime also helps with machine unlearning, i.e., removing the influence of specified data without full retraining. We compare applying standard unlearning methods before versus after the grokking transition across vision (CNNs/ResNets on CIFAR, SVHN, and ImageNet) and language (a transformer on a TOFU-style setup). Starting from grokked checkpoints consistently yields (i) more efficient forgetting (fewer updates to reach a target forget level), (ii) less collateral damage (smaller drops on retained and test performance), and (iii) more stable updates across seeds, relative to early-stopped counterparts under identical unlearning algorithms. Analyses of features and curvature further suggest that post-grokking models learn more modular representations with reduced gradient alignment between forget and retain subsets, which facilitates selective forgetting. Our results highlight when a model is trained (pre- vs. post-grokking) as an orthogonal lever to how unlearning is performed, providing a practical recipe to improve existing unlearning methods without altering their algorithms.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 34 of its 40 references that are in the map. First posted on arXiv 3 Dec 2025.

Builds on

34 of 40 references.

Closest ancestors · 11

Same direction, newest first

  1. 2025Unlearning Isn't Deletion: Investigating Reversibility of Machine Unlearning in LLMs22 May
  2. 2024Towards Effective Evaluations and Comparisons for LLM Unlearning Methods13 Jun
  3. 2024What makes unlearning hard and what to do about it3 Jun
  4. 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning8 Apr
  5. 2024nabla τ: Gradient-based and Task-Agnostic machine Unlearning21 Mar
  6. 2024Inexact Unlearning Needs More Careful Evaluations to Avoid a False Sense of Privacy2 Mar
  7. 2024TOFU: A Task of Fictitious Unlearning for LLMs11 Jan
  8. 2023Towards Machine Unlearning Benchmarks: Forgetting the Personal Identities in Facial Recognition Systems3 Nov
  9. 2023Multi-Class Unlearning for Image Classification via Weight Filtering4 Apr
  10. 2023Towards Unbounded Machine Unlearning20 Feb
  11. 2022Can Bad Teaching Induce Forgetting? Unlearning in Deep Networks using an Incompetent Teacher17 May

Other references · 23

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  3. 2020Extracting Training Data from Large Language Modelscited by 2,189
  4. 2019Similarity of Neural Network Representations Revisitedcited by 1,755
  5. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  6. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
  7. 2019Machine Unlearningcited by 1,061
  8. 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
  9. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
  10. 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 618
  11. 2023Textbooks Are All You Need II: phi-1.5 technical reportcited by 565
  12. 2024The WMDP Benchmark: Measuring and Reducing Malicious Use With Unlearningcited by 509
11 more
  1. 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 146
  2. 2023A Toy Model of Universality: Reverse Engineering How Networks Learn Group Operationscited by 144
  3. 2023Explaining grokking through circuit efficiencycited by 111
  4. 2023Grokking modular arithmeticcited by 83
  5. 2023A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworkscited by 83
  6. 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 80
  7. 2024Deep Networks Always Grok and Here is Whycited by 51
  8. 2023Unifying Grokking and Double Descentcited by 50
  9. 2023Predicting Grokking Long Before it Happens: A look into the loss landscape of models which grokcited by 35
  10. 2024Critical Data Size of Language Models from a Grokking Perspectivecited by 24
  11. 2024Towards Empirical Interpretation of Internal Circuits and Properties in Grokked Transformers on Modular Polynomialscited by 14

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Reference-Guided Machine Unlearning
  2. 2026Models Designed to Forget: Machine Unlearning via Key Deletion
  3. 2025POUR: A Provably Optimal Method for Unlearning Representations via Neural Collapse
  4. 2026Why Some Models Resist Unlearning: A Linear Stability Perspective
  5. 2025When Data Falls Short: Grokking Below the Critical Threshold
  6. 2023Grokking in Linear Estimators -- A Solvable Model that Groks without Understanding
  7. 2026Erase at the Core: Representation Unlearning for Machine Unlearning
  8. 2026Cross-Domain Generalization in Machine Unlearning via Label-Conditioned Energy Magnitude Regularization