mlsanityData to 7 Oct 2026

Stake the Points: Structure-Faithful Instance Unlearning

arXiv 2603.12915 ↗First posted 13 Mar 2026cs.CV cs.AIcited by 0

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

Machine unlearning (MU) addresses privacy risks in pretrained models. The main goal of MU is to remove the influence of designated data while preserving the utility of retained knowledge. Achieving this goal requires preserving semantic relations among retained instances, which existing studies often overlook. We observe that without such preservation, models suffer from progressive structural collapse, undermining both the deletion-retention balance. In this work, we propose a novel structure-faithful framework that introduces stakes, i.e., semantic anchors that serve as reference points to maintain the knowledge structure. By leveraging these anchors, our framework captures and stabilizes the semantic organization of knowledge. Specifically, we instantiate the anchors from language-driven attribute descriptions encoded by a semantic encoder (e.g., CLIP). We enforce preservation of the knowledge structure via structure-aware alignment and regularization: the former aligns the organization of retained knowledge before and after unlearning around anchors, while the latter regulates updates to structure-critical parameters. Results from image classification, retrieval, and face recognition show average gains of 32.9%, 22.5%, and 19.3% in performance, balancing the deletion-retention trade-off and enhancing generalization.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 27 of its 42 references that are in the map. First posted on arXiv 13 Mar 2026.

Builds on

27 of 42 references.

Closest ancestors · 11

Same direction, newest first

  1. 2025Decoupled Distillation to Erase: A General Unlearning Method for Any Class-centric Tasks31 Mar
  2. 2025LoTUS: Large-Scale Machine Unlearning with a Taste of Uncertainty24 Mar
  3. 2023SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation19 Oct
  4. 2023Fast Machine Unlearning Without Retraining Through Selective Synaptic Dampening15 Aug
  5. 2023Boundary Unlearning21 Mar
  6. 2023Learning to Unlearn: Instance-wise Unlearning for Pre-trained Classifiers27 Jan
  7. 2022Few-Shot Unlearning by Model Inversion31 May
  8. 2022Deep Unlearning via Randomized Conditionally Independent Hessians15 Apr
  9. 2022Towards Adversarial Evaluations for Inexact Machine Unlearning17 Jan
  10. 2021Fast Yet Effective Machine Unlearning17 Nov
  11. 2021Unrolling SGD: Understanding Factors Influencing Machine Unlearning27 Sep

Other references · 16

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  4. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  5. 2023Sigmoid Loss for Language Image Pre-Trainingcited by 3,048
  6. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
  7. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  8. 2019Machine Unlearningcited by 1,020
  9. 2019Deep Leakage from Gradientscited by 1,004
  10. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
  11. 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 599
  12. 2022Visual Classification via Description from Large Language Modelscited by 331
4 more
  1. 2021Federated Unlearning via Class-Discriminative Pruningcited by 108
  2. 2025Language Guided Concept Bottleneck Models for Interpretable Continual Learningcited by 28
  3. 2025RainbowPrompt: Diversity-Enhanced Prompt-Evolving for Continual Learningcited by 10
  4. 2025ESC: Erasing Space Concept for Knowledge Deletioncited by 9

Built on by

Not cited yet.