mlsanityData to 14 Oct 2026

Towards Scalable Exact Machine Unlearning Using Parameter-Efficient Fine-Tuning

arXiv 2406.16257 ↗First posted 24 Jun 2024cs.LGcited by 27

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

Machine unlearning is the process of efficiently removing the influence of a training data instance from a trained machine learning model without retraining it from scratch. A popular subclass of unlearning approaches is exact machine unlearning, which focuses on techniques that explicitly guarantee the removal of the influence of a data instance from a model. Exact unlearning approaches use a machine learning model in which individual components are trained on disjoint subsets of the data. During deletion, exact unlearning approaches only retrain the affected components rather than the entire model. While existing approaches reduce retraining costs, it can still be expensive for an organization to retrain a model component as it requires halting a system in production, which leads to service failure and adversely impacts customers. To address these challenges, we introduce an exact unlearning framework -- Sequence-aware Sharded Sliced Training (S3T), which is designed to enhance the deletion capabilities of an exact unlearning system while minimizing the impact on model's performance. At the core of S3T, we utilize a lightweight parameter-efficient fine-tuning approach that enables parameter isolation by sequentially training layers with disjoint data slices. This enables efficient unlearning by simply deactivating the layers affected by data deletion. Furthermore, to reduce the retraining cost and improve model performance, we train the model on multiple data sequences, which allows S3T to handle an increased number of deletion requests. Both theoretically and empirically, we demonstrate that S3T attains superior deletion capabilities and enhanced performance compared to baselines across a wide range of settings.

Key facts. Cited by 27 papers in the map (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 46 of its 74 references that are in the map. First posted on arXiv 24 Jun 2024.

Builds on

46 of 74 references.

Closest ancestors · 17

Same direction, newest first

  1. 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning8 Apr
  2. 2024Inexact Unlearning Needs More Careful Evaluations to Avoid a False Sense of Privacy2 Mar
  3. 2024Rethinking Machine Unlearning for Large Language Models13 Feb
  4. 2023Certified Minimax Unlearning with Generalization Rates and Deletion Capacity16 Dec
  5. 2023Unlearn What You Want to Forget: Efficient Unlearning for LLMs31 Oct
  6. 2023Who's Harry Potter? Approximate Unlearning in LLMs3 Oct
  7. 2023Machine Unlearning: Solutions and Challenges14 Aug
  8. 2023SAFE: Machine Unlearning With Shard Graphs25 Apr
  9. 2023Towards Unbounded Machine Unlearning20 Feb
  10. 2022Privacy Adhering Machine Un-learning in NLP19 Dec
  11. 2022Deep Regression Unlearning15 Oct
  12. 2022Algorithms that Approximate Data Removal: New Results and Limitations25 Sep
5 more
  1. 2022A Survey of Machine Unlearning6 Sep
  2. 2021Fast Yet Effective Machine Unlearning17 Nov
  3. 2021On the Necessity of Auditable Algorithmic Definitions for Machine Unlearning22 Oct
  4. 2021Adaptive Machine Unlearning8 Jun
  5. 2021Remember What You Want to Forget: Algorithms for Machine Unlearning4 Mar

Other references · 29

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  5. 2023GPT-4 Technical Reportcited by 18,396
  6. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  7. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  8. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  9. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  10. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  11. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  12. 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,975
17 more
  1. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  2. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
  3. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  4. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  5. 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
  6. 2019Machine Unlearningcited by 1,061
  7. 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 618
  8. 2019Certified Data Removal from Machine Learning Modelscited by 535
  9. 2020Amnesiac Machine Learningcited by 319
  10. 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 311
  11. 2017Certified Defenses for Data Poisoning Attackscited by 303
  12. 2020Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observationscited by 180
  13. 2023Can Sensitive Information Be Deleted From LLMs? Objectives for Defending Against Extraction Attackscited by 158
  14. 2020Secure and Robust Machine Learning for Healthcare: A Surveycited by 80
  15. 2020Coded Machine Unlearningcited by 36
  16. 2023Training Data Protection with Compositional Diffusion Modelscited by 17
  17. 2023AI Model Disgorgement: Methods and Choicescited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 15; 2026: 10.

27 papers.

Sort:

By area:

  1. 2024Position: LLM Unlearning Benchmarks are Weak Measures of Progresscited by 63
  2. 2025Learning to Unlearn while Retaining: Combating Gradient Conflicts in Machine Unlearningcited by 19
  3. 2025Unlearning through Knowledge Overwriting: Reversible Federated Unlearning via Selective Sparse Adaptercited by 16
  4. 2024Machine Unlearning Doesn't Do What You Think: Lessons for Generative AI Policy and Researchcited by 15
  5. 2025BLUR: A Benchmark for LLM Unlearning Robust to Forget-Retain Overlapcited by 15
  6. 2025Exact Unlearning of Finetuning Data via Model Merging at Scalecited by 14
  7. 2025UCD: Unlearning in LLMs via Contrastive Decodingcited by 9
  8. 2025OpenGU: A Comprehensive Benchmark for Graph Unlearningcited by 8
  9. 2025UPCORE: Utility-Preserving Coreset Selection for Balanced Unlearningcited by 7
  10. 2025Gaussian Certified Unlearning in High Dimensions: A Hypothesis Testing Approachcited by 6
  11. 2025The Erasure Illusion: Stress-Testing the Generalization of LLM Forgetting Evaluationcited by 5
  12. 2025System-Aware Unlearning Algorithms: Use Lesser, Forget Fastercited by 4
15 more
  1. 2025Revisiting the Past: Data Unlearning with Model State Historycited by 2
  2. 2026Controllable Concept Bottleneck Modelscited by 2
  3. 2026Inference-time Unlearning Using Conformal Predictioncited by 2
  4. 2025Unlearning at Scale: State-Exact Trace-Preserving Deletion in Billion-Parameter Language Modelscited by 1
  5. 2025SEQR: Secure and Efficient QR-based LoRA Routingcited by 1
  6. 2026Less Noise, Same Certificate: Retain Sensitivity for Unlearningcited by 1
  7. 2025The Measure of Deception: An Analysis of Data Forging in Machine Unlearningcited by 0
  8. 2025FedSGT: Exact Federated Unlearning via Sequential Group-based Trainingcited by 0
  9. 2026A Robust Certified Machine Unlearning Method Under Distribution Shiftcited by 0
  10. 2026Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Datacited by 0
  11. 2026Interference-Aware Multi-Task Unlearningcited by 0
  12. 2026Characterizing Privacy-Audit Alignment in Behavioral Audit of Machine Unlearningcited by 0
  13. 2026Machine Unlearning for the XGBoost Model with Network Intrusion Datasetscited by 0
  14. 2026DECAF: De-Clustering for Adaptive Representational Unlearningcited by 0
  15. 2026Pristine Modelscited by 0

Similar, not cited

Close in wording, no citation either way

  1. 2025Efficient Machine Unlearning by Model Splitting and Core Sample Selection
  2. 2024Fast Exact Unlearning for In-Context Learning Data for LLMs
  3. 2024nabla τ: Gradient-based and Task-Agnostic machine Unlearning
  4. 2024A hybrid framework for effective and efficient machine unlearning
  5. 2024Efficient Knowledge Deletion from Trained Models through Layer-wise Partial Machine Unlearning
  6. 2023Model Sparsity Can Simplify Machine Unlearning
  7. 2025On the Impossibility of Retrain Equivalence in Machine Unlearning
  8. 2026Exact Unlearning via Quantized Sufficient Statistics