Easy to Learn, Yet Hard to Forget: Towards Robust Unlearning Under Bias
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Machine unlearning, which enables a model to forget specific data, is crucial for ensuring data privacy and model reliability. However, its effectiveness can be severely undermined in real-world scenarios where models learn unintended biases from spurious correlations within the data. This paper investigates the unique challenges of unlearning from such biased models. We identify a novel phenomenon we term ``shortcut unlearning," where models exhibit an ``easy to learn, yet hard to forget" tendency. Specifically, models struggle to forget easily-learned, bias-aligned samples; instead of forgetting the class attribute, they unlearn the bias attribute, which can paradoxically improve accuracy on the class intended to be forgotten. To address this, we propose CUPID, a new unlearning framework inspired by the observation that samples with different biases exhibit distinct loss landscape sharpness. Our method first partitions the forget set into causal- and bias-approximated subsets based on sample sharpness, then disentangles model parameters into causal and bias pathways, and finally performs a targeted update by routing refined causal and bias gradients to their respective pathways. Extensive experiments on biased datasets including Waterbirds, BAR, and Biased NICO++ demonstrate that our method achieves state-of-the-art forgetting performance and effectively mitigates the shortcut unlearning problem.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 22 of its 31 references that are in the map. First posted on arXiv 25 Feb 2026.
Builds on
22 of 31 references.
Closest ancestors · 8
Same direction, newest first
- 2025Decoupled Distillation to Erase: A General Unlearning Method for Any Class-centric Tasks31 Mar
- 2024Distribution-Level Feature Distancing for Machine Unlearning: Towards a Better Trade-off Between Model Utility and Forgetting23 Sep
- 2024What makes unlearning hard and what to do about it3 Jun
- 2023SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation19 Oct
- 2023Model Sparsity Can Simplify Machine Unlearning11 Apr
- 2023Boundary Unlearning21 Mar
- 2022Towards Adversarial Evaluations for Inexact Machine Unlearning17 Jan
- 2021Unrolling SGD: Understanding Factors Influencing Machine Unlearning27 Sep
Other references · 14
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2020Shortcut Learning in Deep Neural Networkscited by 1,928
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2023Can Sensitive Information Be Deleted From LLMs? Objectives for Defending Against Extraction Attackscited by 156
- 2021Learning Debiased Representation via Disentangled Feature Augmentationcited by 116
- 2022NICO++: Towards Better Benchmarking for Domain Generalizationcited by 86
- 2024Unlearning Concepts in Diffusion Model via Concept Domain Correction and Concept Preserving Gradientcited by 69
- 2022How Does Sharpness-Aware Minimization Minimize Sharpness?cited by 64
- 2023ImbSAM: A Closer Look at Sharpness-Aware Minimization in Class-Imbalanced Recognitioncited by 31
- 2025The European Union general data protection regulation: what it is and what it meanscited by 30
2 more
Built on by
Citing papers per year: 2026: 1.
1 paper.