Modeling LLM Unlearning as an Asymmetric Two-Task Learning Problem
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Machine unlearning for large language models (LLMs) aims to remove targeted knowledge while preserving general capability. In this paper, we recast LLM unlearning as an asymmetric two-task problem: retention is the primary objective and forgetting is an auxiliary. From this perspective, we propose a retention-prioritized gradient synthesis framework that decouples task-specific gradient extraction from conflict-aware combination. Instantiating the framework, we adapt established PCGrad to resolve gradient conflicts, and introduce SAGO, a novel retention-prioritized gradient synthesis method. Theoretically, both variants ensure non-negative cosine similarity with the retain gradient, while SAGO achieves strictly tighter alignment through constructive sign-constrained synthesis. Empirically, on WMDP Bio/Cyber and RWKU benchmarks, SAGO consistently pushes the Pareto frontier: e.g., on WMDP Bio (SimNPO+GD), recovery of target model MMLU performance progresses from 44.6% (naive) to 94.0% (+PCGrad) and further to 96.0% (+SAGO), while maintaining comparable forgetting strength. Our results show that re-shaping gradient geometry, rather than re-balancing losses, is the key to mitigating unlearning-retention trade-offs.
Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 28 of its 38 references that are in the map. First posted on arXiv 16 Apr 2026.
Builds on
28 of 38 references.
Closest ancestors · 9
Same direction, newest first
- 2025Robust LLM Unlearning with MUDMAN: Meta-Unlearning with Disruption Masking And Normalization14 Jun
- 2025UCD: Unlearning in LLMs via Contrastive Decoding12 Jun
- 2025BLUR: A Bi-Level Optimization Approach for LLM Unlearning9 Jun
- 2024Simplicity Prevails: Rethinking Negative Preference Optimization for LLM Unlearning9 Oct
- 2024MUSE: Machine Unlearning Six-Way Evaluation for Language Models8 Jul
- 2024Reversing the Forget-Retain Objectives: An Efficient LLM Unlearning Framework from Logit Difference12 Jun
- 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning8 Apr
- 2024TOFU: A Task of Fictitious Unlearning for LLMs11 Jan
- 2023In-Context Unlearning: Language Models as Few Shot Unlearners11 Oct
Other references · 19
- 2020Measuring Massive Multitask Language Understandingcited by 7,876
- 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 3,064
- 2016Pointer Sentinel Mixture Modelscited by 3,047
- 2022Locating and Editing Factual Associations in GPTcited by 2,650
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,323
- 2020Gradient Surgery for Multi-Task Learningcited by 1,225
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 687
- 2024The WMDP Benchmark: Measuring and Reducing Malicious Use With Unlearningcited by 498
- 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 446
- 2023GPT-4 Is Too Smart To Be Safe: Stealthy Chat with LLMs via Ciphercited by 422
- 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 251
- 2022Multi-Task Learning as a Bargaining Gamecited by 212
7 more
- 2020Just Pick a Sign: Optimizing Deep Multitask Models with Gradient Sign Dropoutcited by 199
- 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 145
- 2025No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspacescited by 93
- 2024Distract Large Language Models for Automatic Jailbreak Attackcited by 45
- 2025CAT Merging: A Training-Free Approach for Resolving Conflicts in Model Mergingcited by 22
- 2024SeqAR: Jailbreak LLMs with Sequential Auto-Generated Characterscited by 6
- 2024A Modular-based Strategy for Mitigating Gradient Conflicts in Simultaneous Speech Translationcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Representation-Guided Parameter-Efficient LLM Unlearningcited by 0
- 2026Representation-Guided Parameter-Efficient LLM Unlearning19 Apr 2026
Similar, not cited
Close in wording, no citation either way
- 2024Multi-Objective Large Language Model Unlearning
- 2024Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate
- 2025Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs
- 2024LLM Unlearning via Loss Adjustment with Only Forget Data
- 2024Machine Unlearning of Pre-trained Large Language Models
- 2025Constrained Entropic Unlearning: A Primal-Dual Framework for Large Language Models
- 2025Learning to Unlearn while Retaining: Combating Gradient Conflicts in Machine Unlearning
- 2026Unlearning in LLMs: Methods, Evaluation, and Open Challenges