SAUL: Sharpness-Aware Augmented-Lagrangian Unlearning
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Machine unlearning in Large Language Models (LLMs) faces a critical trade-off between erasing target knowledge and preserving general utility. We propose SAUL (Sharpness-Aware Augmented-Lagrangian Unlearning), which formulates unlearning as a constrained minimization problem following the principle of "forget enough, but no more than necessary." At its core, SAUL formulates forgetting as an explicit constraint with a prescribed satisfaction criterion, whereas prior unlearning methods typically specify the desired level of forgetting implicitly through optimization objectives. An augmented Lagrangian controller adaptively adjusts forget-side pressure according to constraint violation and can eventually deactivate the forget-side update as the prescribed criterion remains satisfied. Sharpness-aware updates on both retain and forget objectives, together with a dual-optimizer design that maintains role-separated states, further stabilize the resulting unlearning dynamics. We evaluate SAUL on the TOFU, WMDP, and MUSE benchmarks, demonstrating favorable forgetting-utility trade-offs over representative sharpness- and perturbation-based baselines under benchmark-specific forgetting criteria. Beyond the complete SAUL framework, we further show on TOFU that applying the augmented-Lagrangian controller as a drop-in modifier to representative baselines improves their post-forgetting utility, demonstrating the practical value of explicit forgetting control.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 16 of its 24 references that are in the map. First posted on arXiv 17 Aug 2026.
Builds on
16 of 24 references.
Closest ancestors · 13
Same direction, newest first
- 2025OFMU: Optimization-Driven Framework for Machine Unlearning26 Sep
- 2025Sharpness-Aware Machine Unlearning16 Jun
- 2025BLUR: A Bi-Level Optimization Approach for LLM Unlearning9 Jun
- 2025DualOptim: Enhancing Efficacy and Stability in Machine Unlearning with Dual Optimizers22 Apr
- 2025Sharpness-Aware Parameter Selection for Machine Unlearning8 Apr
- 2025Towards LLM Unlearning Resilient to Relearning Attacks: A Sharpness-Aware Minimization Perspective and Beyond7 Feb
- 2024Unlearning as multi-task optimization: A normalized gradient difference approach with an adaptive learning rate29 Oct
- 2024LLM Unlearning via Loss Adjustment with Only Forget Data14 Oct
- 2024MUSE: Machine Unlearning Six-Way Evaluation for Language Models8 Jul
- 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning8 Apr
- 2024TOFU: A Task of Fictitious Unlearning for LLMs11 Jan
- 2023Who's Harry Potter? Approximate Unlearning in LLMs3 Oct
Other references · 3
- 2020Extracting Training Data from Large Language Modelscited by 2,144
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2021Sharpness-Aware Minimization Improves Language Model Generalizationcited by 108
Built on by
Not cited yet.