Sign inGet started
Paper · arXiv

BLADE: Bilevel Low-rank Augmented-Lagrangian Erasure for LLM Unlearning

Existing LLM unlearning methods struggle with robustness: unbounded forget losses degrade model coherence, fixed-weight balancing cannot adapt as retain difficulty shifts mid-training, and methods that work on one benchmark falter under scaling or repeated application. We propose BLADE, a constrained bilevel framework whose three mechanisms give smooth, predictable control over the optimization landscape: a clamped-entropy forget loss whose gradient is exactly zero once a token reaches sufficient uncertainty; an asymmetric augmented Lagrangian that permanently ratchets retain protection after any violation; and a bilevel structure confined to LoRA adapters that repairs retain damage befor...

AuthorsMd Toufikuzzaman, Ahmad Mousavi, Dongwon Lee
Primary categorycs.LG
Published23 August 2026
Last updated at source23 August 2026
cs.LGcs.AIcs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/ca5d7180-fbf6-4edc-8246-2d322e951485" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.