Class Unlearning via Depth-Aware Removal of Forget-Specific Directions
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Machine unlearning aims to remove targeted knowledge from a trained model without the cost of retraining from scratch. In class unlearning, however, reducing accuracy on forget classes does not necessarily imply true forgetting: forgotten information can remain encoded in internal representations, and apparent forgetting may arise from classifier-head suppression rather than representational removal. We show that existing class-unlearning methods often exhibit weak or negative selectivity, preserve forget-class structure in deep representations, or rely heavily on final-layer bias shifts. We then introduce DAMP (Depth-Aware Modulation by Projection), a one-shot, closed-form weight-surgery method that removes forget-specific directions from a pretrained network without gradient-based optimization. At each stage, DAMP computes class prototypes in the input space of the next learnable operator, extracts forget directions as residuals relative to retain-class prototypes, and applies a projection-based update to reduce downstream sensitivity to those directions. To preserve utility, DAMP uses a parameter-free depth-aware scaling rule derived from probe separability, applying smaller edits in early layers and larger edits in deeper layers. The method naturally extends to multi-class forgetting through low-rank subspace removal. Across MNIST, CIFAR-10, CIFAR-100, and Tiny ImageNet, and across convolutional and transformer architectures, DAMP more closely resembles the retraining gold standard than some of the prior methods, improving selective forgetting while better preserving retain-class performance and reducing residual forget-class structure in deep layers.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 30 of its 37 references that are in the map. First posted on arXiv 16 Apr 2026.
Builds on
30 of 37 references.
Closest ancestors · 17
Same direction, newest first
- 2025Ascent Fails to Forget30 Sep
- 2025Decoupled Distillation to Erase: A General Unlearning Method for Any Class-centric Tasks31 Mar
- 2024Deep Unlearn: Benchmarking Machine Unlearning for Image Classification2 Oct
- 2024Unified Gradient-Based Machine Unlearning with Remain Geometry Enhancement29 Sep
- 2024Decoupling the Class Label and the Target Concept in Machine Unlearning12 Jun
- 2024Towards Natural Machine Unlearning24 May
- 2024Machine Unlearning: A Comprehensive Survey13 May
- 2024Is Retain Set All You Need in Machine Unlearning? Restoring Performance of Unlearned Models with Out-Of-Distribution Images19 Apr
- 2024Inexact Unlearning Needs More Careful Evaluations to Avoid a False Sense of Privacy2 Mar
- 2023Deep Unlearning: Fast and Efficient Gradient-free Approach to Class Forgetting1 Dec
- 2023SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation19 Oct
- 2023Fast Machine Unlearning Without Retraining Through Selective Synaptic Dampening15 Aug
5 more
Other references · 13
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2016Understanding intermediate layers using linear classifier probescited by 1,279
- 2014How transferable are features in deep neural networks?cited by 1,216
- 2019Machine Unlearningcited by 1,020
- 2022Mass-Editing Memory in a Transformercited by 976
- 2020Machine Unlearning: Linear Filtration for Logit-based Classifierscited by 89
- 2024Model Editing as a Robust and Denoised variant of DPO: A Case Study on Toxicitycited by 33
- 2025CURE: Concept Unlearning via Orthogonal Representation Editing in Diffusion Modelscited by 24
1 more
Built on by
Citing papers per year: 2026: 3.
3 papers.