Robust LLM Unlearning Against Relearning Attacks: The Minor Components in Representations Matter
Xiao, Zeguan, Xu, Xuanzhe, Wang, Yong, Yang, Jian, HU, Yanqing, Chen, YunarXiv.orgPublished May 12, 2026Original︎ ↗Archived copy
Examinations
None recorded. An examination is commissioned by a claim’s Steward for what its claim rests on; a review of the document for its own sake is asked for as a request bearing on it.
Text59 passages · 1 marked
Abstract: Large language model (LLM) unlearning aims to remove specific data influences from pre-trained model without costly retraining, addressing privacy, copyright, and safety concerns. However, recent studies reveal a critical vulnerability: unlearned models rapidly recover "forgotten" knowledge through relearning attacks. This fragility raises serious security concerns, especially for open-weight models. In this work, we investigate the fundamental mechanism underlying this fragility from a representation geometry perspective. We discover that existing unlearning methods predominantly optimize along dominant components, leaving minor components largely unchanged. Critically, during relearning attacks, the modifications in these dominant components are easily reversed, enabling rapid knowledge recovery, whereas minor components exhibit stronger resistance to such reversal. We further provide a theoretical analysis that explains both observations from the spectral structure of representations. Building on this insight, we propose Minor Component Unlearning (MCU), a novel unlearning approach that explicitly targets minor components in representations. Extensive experiments on three datasets validate that, by concentrating unlearning effects in these inherently robust directions, our method achieves substantially improved resistance to relearning attacks.
Not yet read by this claim’s Steward.
Not yet read by this claim’s Steward.
Not yet read by this claim’s Steward.
Not found in the text 1
However, recent studies reveal a critical vulnerability: unlearned models rapidly recover "forgotten" knowledge through relearning attacks.
Not yet read by this claim’s Steward.
Lineage across 4 claims
Record
- Kind
- unknown
- Authors
- Xiao, Zeguan, Xu, Xuanzhe, Wang, Yong, Yang, Jian, HU, Yanqing, Chen, Yun
- Publisher
- arXiv.org
- Published
- May 12, 2026
- DOI
- None
- Link
- https://arxiv.org/abs/2605.11685
- Archived copy
- https://web.archive.org/web/20260514090807/https://arxiv.org/abs/2605.11685
- Stored text
- 5,065 characters, retrieved Nov 11, 2026 · 45 sections, 59 passages
- Claims extracted
- For
why existing unlearning is reversed by relearning according to the paper, what the proposed method changes, and how robustness to relearning was tested
· 4 claims (3 new) · Nov 11, 2026 for Reconciling conflicting published results on contested AI safety research questions
- For
- Versions
- One known
- Copies
- None recorded
- Corrections
- None recorded
- Facts checked
- Nov 11, 2026
History 3
- Nov 11, 2026DividedSegmenter · Divided into 104 parts by its own structure
- Nov 11, 2026FactsFacts fetcher · Facts looked up
- Nov 11, 2026Entered the graphEntered the graph; copy stored