One-Shot Machine Unlearning with Mnemonic Code
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Ethical and privacy issues inherent in artificial intelligence (AI) applications have been a growing concern with the rapid spread of deep learning. Machine unlearning (MU) is the research area that addresses these issues by making a trained AI model forget about undesirable training data. Unfortunately, most existing MU methods incur significant time and computational costs for forgetting. Therefore, it is often difficult to apply these methods to practical datasets and sophisticated architectures, e.g., ImageNet and Transformer. To tackle this problem, we propose a lightweight and effective MU method. Our method identifies the model parameters sensitive to the forgetting targets and adds perturbation to such model parameters. We identify the sensitive parameters by calculating the Fisher Information Matrix (FIM). This approach does not require time-consuming additional training for forgetting. In addition, we introduce class-specific random signals called mnemonic code to reduce the cost of FIM calculation, which generally requires the entire training data and incurs significant computational costs. In our method, we train the model with mnemonic code; when forgetting, we use a small number of mnemonic codes to calculate the FIM and get the effective perturbation for forgetting. Comprehensive experiments demonstrate that our method is faster and better at forgetting than existing MU methods. Furthermore, we show that our method can scale to more practical datasets and sophisticated architectures.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 33 of its 45 references that are in the map. First posted on arXiv 9 Jun 2023.
Builds on
33 of 45 references.
Closest ancestors · 3
Same direction, newest first
- 2022A Survey of Machine Unlearning6 Sep
- 2022Zero-Shot Machine Unlearning14 Jan
- 2021Fast Yet Effective Machine Unlearning17 Nov
Other references · 30
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,546
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2016Progressive Neural Networkscited by 1,361
- 2019Machine Unlearningcited by 1,061
- 2018Efficient Lifelong Learning with A-GEMcited by 1,058
18 more
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
- 2019Large Scale Incremental Learningcited by 732
- 2023Extracting Training Data from Diffusion Modelscited by 732
- 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 618
- 2019Certified Data Removal from Machine Learning Modelscited by 535
- 2019Making AI Forget You: Data Deletion in Machine Learningcited by 465
- 2020Backdoor Learning: A Surveycited by 426
- 2016Expert Gate: Lifelong Learning with a Network of Expertscited by 372
- 2017Variational Continual Learningcited by 339
- 2019Maintaining Discrimination and Fairness in Class Incremental Learningcited by 283
- 2020Mnemonics Training: Multi-Class Incremental Learning without Forgettingcited by 221
- 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 201
- 2020Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observationscited by 180
- 2020Anatomy of Catastrophic Forgetting: Hidden Representations and Task Semanticscited by 161
- 2019Uncertainty-based Continual Learning with Adaptive Regularizationcited by 146
- 2018Task Agnostic Continual Learning Using Online Variational Bayescited by 61
- 2017On Quadratic Penalties in Elastic Weight Consolidationcited by 55
- 2021On robustness of generative representations against catastrophic forgettingcited by 5
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.
- 2024Human-inspired Perspectives: A Survey on AI Long-term Memorycited by 12
- 2025Targeted Forgetting of Image Subgroups in CLIP Modelscited by 6
Similar, not cited
Close in wording, no citation either way
- 2023DeepClean: Machine Unlearning on the Cheap by Resetting Privacy Sensitive Weights using the Fisher Diagonal
- 2025When to Forget? Complexity Trade-offs in Machine Unlearning
- 2024Towards Natural Machine Unlearning
- 2024Machine Unlearning using Forgetting Neural Networks
- 2021Lightweight machine unlearning in neural network
- 2022Can Bad Teaching Induce Forgetting? Unlearning in Deep Networks using an Incompetent Teacher
- 2024Remaining-data-free Machine Unlearning by Suppressing Sample Contribution
- 2026Models Designed to Forget: Machine Unlearning via Key Deletion