Geometric-disentangelment Unlearning
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Large language models (LLMs) can internalize private or harmful content, motivating unlearning that removes a forget set while preserving retaining knowledge. However, forgetting updates often cause collateral degradation on retaining knowledge, creating a persistent trade-off. Existing LLM unlearning methods are often heuristic, and other theoretical approaches rely on offline feature constructions that do not capture update-time forget-retain interaction in LLMs. To address this limitation, we aim to develop an LLM unlearning method that reduces the forget-retain trade-off with theoretical guarantees. We take a first-principles view by formalizing "no side effects" as local retain invariance under small parameter updates, and prove an equivalence under optimizer-induced geometry: the retain loss is locally invariant if and only if the update direction is orthogonal to the subspace spanned by retain gradients. Based on the insight, we propose Geometric-disentanglement Unlearning (GU), a lightweight and theoretically grounded projection that can be plug-and-play to existing gradient-based unlearning methods to mitigate forget-retain side effects. Experiments on TOFU, MUSE, and WMDP-cyber show that GU strengthens forgetting while reducing retain drift. When added to SimNPO, it achieves up to 62% improved forgetting Extraction Strength (ES) and 31% higher retain ES. We open-sourced our code in https://github.com/Lemutisme/Geometric-Unlearning.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 49 of its 63 references that are in the map. First posted on arXiv 21 Nov 2025.
Builds on
49 of 63 references.
Closest ancestors · 24
Same direction, newest first
- 2025OpenUnlearning: Accelerating LLM Unlearning via Unified Benchmarking of Methods and Metrics14 Jun
- 2025Machine Unlearning under Overparameterization28 May
- 2025Exploring Criteria of Loss Reweighting to Enhance LLM Unlearning17 May
- 2025Go Beyond Your Means: Unlearning with Per-Sample Gradient Orthogonalization4 Mar
- 2025Rethinking LLM Unlearning Objectives: A Gradient Perspective and Go Beyond26 Feb
- 2025SEMU: Singular Value Decomposition for Efficient Machine Unlearning11 Feb
- 2024A Review on Machine Unlearning18 Nov
- 2024LLM Unlearning via Loss Adjustment with Only Forget Data14 Oct
- 2024Simplicity Prevails: Rethinking Negative Preference Optimization for LLM Unlearning9 Oct
- 2024NegMerge: Sign-Consensual Weight Merging for Machine Unlearning8 Oct
- 2024Deep Unlearn: Benchmarking Machine Unlearning for Image Classification2 Oct
- 2024MUSE: Machine Unlearning Six-Way Evaluation for Language Models8 Jul
12 more
- 2024Reversing the Forget-Retain Objectives: An Efficient LLM Unlearning Framework from Logit Difference12 Jun
- 2024Large Language Model Unlearning via Embedding-Corrupted Prompts12 Jun
- 2024Towards Natural Machine Unlearning24 May
- 2024Machine Unlearning via Null Space Calibration21 Apr
- 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning8 Apr
- 2024Machine Unlearning of Pre-trained Large Language Models23 Feb
- 2024UNDIAL: Self-Distillation with Adjusted Logits for Robust Unlearning in Large Language Models15 Feb
- 2024TOFU: A Task of Fictitious Unlearning for LLMs11 Jan
- 2023Learn to Unlearn for Deep Neural Networks: Minimizing Unlearning Interference with Gradient Projection7 Dec
- 2023Deep Unlearning: Fast and Efficient Gradient-free Approach to Class Forgetting1 Dec
- 2023Unlearn What You Want to Forget: Efficient Unlearning for LLMs31 Oct
- 2021Unrolling SGD: Understanding Factors Influencing Machine Unlearning27 Sep
Other references · 25
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2020Extracting Training Data from Large Language Modelscited by 2,189
- 2020Gradient Surgery for Multi-Task Learningcited by 1,256
- 2019Machine Unlearningcited by 1,061
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2024The WMDP Benchmark: Measuring and Reducing Malicious Use With Unlearningcited by 509
- 2023Zephyr: Direct Distillation of LM Alignmentcited by 506
- 2019Making AI Forget You: Data Deletion in Machine Learningcited by 465
13 more
- 2019Orthogonal Gradient Descent for Continual Learningcited by 369
- 2020Amnesiac Machine Learningcited by 319
- 2024Is DPO Superior to PPO for LLM Alignment? A Comprehensive Studycited by 262
- 2020Approximate Data Deletion from Machine Learning Modelscited by 255
- 2024AlphaEdit: Null-Space Constrained Knowledge Editing for Language Modelscited by 236
- 2025Taming Knowledge Conflicts in Language Modelscited by 30
- 2018Fisher Information and Natural Gradient Learning of Random Deep Networkscited by 28
- 2024Knowledge Overshadowing Causes Amalgamated Hallucination in Large Language Modelscited by 25
- 2025The Law of Knowledge Overshadowing: Towards Understanding, Predicting, and Preventing LLM Hallucinationcited by 23
- 2023VIBE: Topic-Driven Temporal Adaptation for Twitter Classificationcited by 12
- 2025Atomic Reasoning for Scientific Table Claim Verificationcited by 8
- 2025Memorization Sinks: Isolating Memorization during LLM Trainingcited by 7
- 2025GeoEdit: Geometric Knowledge Editing for Large Language Modelscited by 6
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learningcited by 1
- 2026Retain-Neutral Surrogates for Min-Max Unlearningcited by 0
- 2026RepSelect: Robust LLM Unlearning via Representation Selectivitycited by 0
- 2026SAGE: Retain-Aware Post-Hoc Sanitization of Final Unlearning Vectorcited by 0
- 2026SAGE: Retain-Aware Post-Hoc Sanitization of Final Unlearning Vector16 Jun 2026
- 2026RepSelect: Robust LLM Unlearning via Representation Selectivity15 Jun 2026
- 2026Retain-Neutral Surrogates for Min-Max Unlearning7 May 2026
- 2026Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learning6 Feb 2026
Similar, not cited
Close in wording, no citation either way
- 2026Less is More: Geometric Unlearning for LLMs with Minimal Data Disclosure
- 2026RA2: Retain-Anchored Attraction Preserves Forget-Adjacent Utility in LLM Unlearning
- 2026Confess What You Know: Forget-Set Misalignment with Model Knowledge in LLM Unlearning
- 2025LLM Unlearning on Noisy Forget Sets: A Study of Incomplete, Rewritten, and Watermarked Data
- 2026Forgetting Only What Matters: Layer-Selective Unlearning toward Robust LLMs
- 2025Unlearning That Lasts: Utility-Preserving, Robust, and Almost Irreversible Forgetting in LLMs
- 2026CALIBURN: Self-Calibrated LLM Unlearning Alignment
- 2026Representation-Guided Parameter-Efficient LLM Unlearning