RA squared: Retain-Anchored Attraction Preserves Forget-Adjacent Utility in LLM Unlearning
cs.LG
Submitted: 2026-10-14
Updated: 2026-10-14
Code: https://github.com/ZacLing/retain_anchored_attraction
License: http://creativecommons.org/licenses/by/4.0/
The gist: Large Language Model (LLM) unlearning is often evaluated primarily by target suppression and clean retain utility.
Abstract
Large Language Model (LLM) unlearning is often evaluated primarily by target suppression and clean retain utility. These metrics can miss a local failure mode: a model may perform well on standard retain prompts, yet degrade on benign reasoning when prompts lie near the forgotten domain. This phenomenon is termed forget-adjacent utility loss. A fundamental question is: where should forget representations go after they leave the removed behavior? Successful unlearning depends not only on whether forget-conditioned representations depart from the harmful computation, but also on the direction in which they are redirected afterward. We propose RA squared (Retain-Anchored Attraction), a latent-space unlearning method that redirects forget-token states toward nearby retain-supported representations while preserving higher-layer behavior on retain data. On WMDP and MUSE, RA squared yields higher forget-adjacent utility than strong unlearning baselines at similar broad-utility levels. These results show that the migration direction of forget representations materially affects benign behavior near the forget boundary. Our code is available at https://github.com/ZacLing/retain anchored attraction.
Sources
- Soft Prompting for Unlearning in Large Language Models
- Which Retain Set Matters for LLM Unlearning? A Case Study on Entity Unlearning
- Machine Unlearning under Retain-Forget Entanglement
- OpenUnlearning: Accelerating LLM Unlearning via Unified Benchmarking of Methods and Metrics
- Who's Harry Potter? Approximate Unlearning in LLMs
- Towards LLM Unlearning Resilient to Relearning Attacks: A Sharpness-Aware Minimization Perspective and Beyond
- LLM Unlearning Under the Microscope: A Full-Stack View on Methods and Metrics
- KUDA: Knowledge Unlearning by Deviating Representation for Large Language Models
- On Large Language Model Continual Unlearning
- A Comprehensive Survey of Machine Unlearning Techniques for Large Language Models
- Mechanistic Unlearning: Robust Knowledge Unlearning and Editing via Mechanistic Localization
- Measuring Massive Multitask Language Understanding
- Intrinsic Test of Unlearning Using Parametric Knowledge Traces
- Improving LLM Unlearning Robustness via Random Perturbations
- Editing Models with Task Arithmetic
- DUSK: Do Not Unlearn Shared Knowledge
- SEPS: A Separability Measure for Robust Unlearning in LLMs
- Reversing the Forget-Retain Objectives: An Efficient LLM Unlearning Framework from Logit Difference
- Towards Robust Evaluation of Unlearning in LLMs via Data Transformations
- Erase at the Core: Representation Unlearning for Machine Unlearning
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks