Minerval
Sourceunknowntext stored

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

Claims4
ExaminationsNone
Text45 sections
VersionsOne known
CopiesNone recorded
CorrectionsNone recorded
Facts checked Nov 11, 2026
ReachNo copies recorded
StructureIn 4 claims' maps0 sources downstream across 4 claims
EvidenceNot yet read
ReviewsNot reviewed

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

No examination yetMarked passage
Skip to main content0 passages
Search1 passage
Log in0 passages
Search arXiv0 passages
Press Enter to search · Advanced search0 passages
Computer Science > Computation and Language13 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.

Focus to learn more1 passage
Submission history4 passages
View PDF1 passage
TeX Source1 passage
Additional Features0 passages
Audio Summary7 passages
References & Citations0 passages
SciX0 passages
Google Scholar0 passages
Semantic Scholar1 passage
BibTeX formatted citation3 passages
Bookmark0 passages
Bibliographic Tools0 passages
Bibliographic and Citation Tools0 passages
Bibliographic Explorer Toggle1 passage
Connected Papers Toggle1 passage
Litmaps Toggle3 passages
Code, Data, Media0 passages
Code, Data and Media Associated with this Article2 passages
Links to Code Toggle1 passage
DagsHub Toggle1 passage
GotitPub Toggle1 passage
Huggingface Toggle1 passage
ScienceCast Toggle1 passage
Demos0 passages
Demos0 passages
Replicate Toggle1 passage
Spaces Toggle1 passage
Spaces Toggle1 passage
Related Papers0 passages
Recommenders and Search Tools0 passages
Link to Influence Flower1 passage
Core recommender toggle1 passage
Author0 passages
Venue0 passages
Institution0 passages
Topic0 passages
About arXivLabs7 passages
Major funding support from3 passages

Not found in the text 1

As quoted

However, recent studies reveal a critical vulnerability: unlearned models rapidly recover "forgotten" knowledge through relearning attacks.

Lineage across 4 claims

Draws on · none recorded
This source
Robust LLM Unlearning Against Relearning Attacks: The Minor Components in Representations…
in 4 claims' maps
Drawn on by · none recorded

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
Versions
One known
Copies
None recorded
Corrections
None recorded
Facts checked
Nov 11, 2026

History 3

  1. Nov 11, 2026DividedSegmenter · Divided into 104 parts by its own structure
  2. Nov 11, 2026FactsFacts fetcher · Facts looked up
  3. Nov 11, 2026Entered the graphEntered the graph; copy stored
Robust LLM Unlearning Against Relearning Attacks: The Minor Components in Rep… · Minerval