Maximizing Local Entropy Where It Matters: Prefix-Aware Localized LLM Unlearning
Naixin Zhai, Pengyang Shao, Binbin Zheng, Fei Shen, Long Bai, Xun Yang
TL;DR
The paper addresses the challenge of forgetting sensitive content in large language models while preserving general utility. It introduces PALU, a dual-locality unlearning framework that surgically targets the sensitive prefix in time and flattens only the decoding-critical top-$K$ logits via localized entropy maximization, guided by a frozen reference model. This yields an efficient $\mathcal{O}(T K)$ optimization cost and superior forgetting-utility trade-offs compared to state-of-the-art baselines on TOFU and MUSE benchmarks. The work demonstrates strong empirical results, rapid convergence, and robust performance across models, while outlining limitations to text-only LLMs and proposing future work for multimodal extensions.
Abstract
Machine unlearning aims to forget sensitive knowledge from Large Language Models (LLMs) while maintaining general utility. However, existing approaches typically treat all tokens in a response indiscriminately and enforce uncertainty over the entire vocabulary. This global treatment results in unnecessary utility degradation and extends optimization to content-agnostic regions. To address these limitations, we propose PALU (Prefix-Aware Localized Unlearning), a framework driven by a local entropy maximization objective across both temporal and vocabulary dimensions. PALU reveals that (i) suppressing the sensitive prefix alone is sufficient to sever the causal generation link, and (ii) flattening only the top-$k$ logits is adequate to maximize uncertainty in the critical subspace. These findings allow PALU to avoid redundant optimization across the full vocabulary and parameter space while minimizing collateral damage to general model performance. Extensive experiments validate that PALU achieves superior forgetting efficacy and utility preservation compared to state-of-the-art baselines.
