mlsanityData to 14 Oct 2026

Delete and Retain: Efficient Unlearning for Document Classification

arXiv 2512.13711 ↗First posted 6 Dec 2025cs.LGcited by 0

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

Machine unlearning aims to efficiently remove the influence of specific training data from a model without full retraining. While much progress has been made in unlearning for LLMs, document classification models remain relatively understudied. In this paper, we study class-level unlearning for document classifiers and present Hessian Reassignment, a two-step, model-agnostic solution. First, we perform a single influence-style update that subtracts the contribution of all training points from the target class by solving a Hessian-vector system with conjugate gradients, requiring only gradient and Hessian-vector products. Second, in contrast to common unlearning baselines that randomly reclassify deleted-class samples, we enforce a decision-space guarantee via Top-1 classification. On standard text benchmarks, Hessian Reassignment achieves retained-class accuracy close to full retrain-without-class while running orders of magnitude faster. Additionally, it consistently lowers membership-inference advantage on the removed class, measured with pooled multi-shadow attacks. These results demonstrate a practical, principled path to efficient class unlearning in document classification.

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 15 of its 29 references that are in the map. First posted on arXiv 6 Dec 2025.

Builds on

15 of 29 references.

Closest ancestors · 7

Same direction, newest first

  1. 2024The Utility and Complexity of in- and out-of-Distribution Machine Unlearning12 Dec
  2. 2024Towards Natural Machine Unlearning24 May
  3. 2024Machine Unlearning for Document Classification29 Apr
  4. 2024Unlearning Traces the Influential Training Data of Language Models26 Jan
  5. 2023Unlearn What You Want to Forget: Efficient Unlearning for LLMs31 Oct
  6. 2023Random Relabeling for Efficient Machine Unlearning21 May
  7. 2021Machine Unlearning of Features and Labels26 Aug

Other references · 8

  1. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
  2. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  3. 2018ML-Leaks: Model and Data Independent Membership Inference Attacks and Defenses on Machine Learning Modelscited by 498
  4. 2019Making AI Forget You: Data Deletion in Machine Learningcited by 465
  5. 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 311
  6. 2020Influence Functions in Deep Learning Are Fragilecited by 252
  7. 2022Training Data Influence Analysis and Estimation: A Surveycited by 135
  8. 2019On Second-Order Group Influence Functions for Black-Box Predictionscited by 79

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024Hessian-Free Online Certified Unlearning
  2. 2024nabla τ: Gradient-based and Task-Agnostic machine Unlearning
  3. 2024A Comparative Study of Machine Unlearning Techniques for Image and Text Classification Models
  4. 2022An Introduction to Machine Unlearning
  5. 2023Deep Unlearning: Fast and Efficient Gradient-free Approach to Class Forgetting
  6. 2024A More Practical Approach to Machine Unlearning
  7. 2025On the Necessity of Output Distribution Reweighting for Effective Class Unlearning
  8. 2026Suppression or Deletion: A Restoration-Based Representation-Level Analysis of Machine Unlearning