Forget Narrowly, Retain Broadly: Unlearning as an Asymmetric Generalization Problem
Machine unlearning in LLMs is the targeted removal of specific knowledge while preserving all other capabilities, critical for privacy and safety. Yet existing benchmarks measure it unreliably. They miss knowledge that resurfaces under paraphrased or indirect queries, a failure we call under-forgetting, and lack the semantic, syntactic, and lexical probes needed to verify that unrelated knowledge is preserved, a failure we call over-forgetting. Both failures reflect an asymmetric generalization problem. Forget evaluation must cover diverse query formulations of the same target facts, testing whether forgetting holds beyond exact training prompts. Retain evaluation must probe a far larger ...
| Authors | Amit Peleg, Naman Deep Singh, Naama Pearl et al. |
|---|---|
| Primary category | cs.LG |
| Published | 10 July 2026 |
| Last updated at source | 10 July 2026 |
Popularity, last 4 days
0 now. Counts as reported by the source, snapshotted daily by Silytics.
Connected in the knowledge graph
- apeleg/SUITEDataset · cited by
- apeleg/SUITE-rephrasingsDataset · cited by
Models and datasets referencing this paper
- apeleg/SUITEDataset
- apeleg/SUITE-rephrasingsDataset
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 20 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.