LGCLDec 8, 2025

Recover-to-Forget: Gradient Reconstruction from LoRA for Efficient LLM Unlearning

arXiv:2512.07374v12 citationsh-index: 9
Originality Incremental advance
AI Analysis

This addresses the need for scalable and practical unlearning methods in LLMs to support dynamic knowledge updates and data deletion rights, offering a lightweight alternative to existing approaches.

The paper tackles the problem of unlearning in large language models (LLMs) by introducing Recover-to-Forget (R2F), a framework that reconstructs full-model gradients from low-rank LoRA adapter updates to enable efficient unlearning without full-model fine-tuning or access to original training data, achieving effective unlearning while preserving general model performance.

Unlearning in large foundation models (e.g., LLMs) is essential for enabling dynamic knowledge updates, enforcing data deletion rights, and correcting model behavior. However, existing unlearning methods often require full-model fine-tuning or access to the original training data, which limits their scalability and practicality. In this work, we introduce Recover-to-Forget (R2F), a novel framework for efficient unlearning in LLMs based on reconstructing full-model gradient directions from low-rank LoRA adapter updates. Rather than performing backpropagation through the full model, we compute gradients with respect to LoRA parameters using multiple paraphrased prompts and train a gradient decoder to approximate the corresponding full-model gradients. To ensure applicability to larger or black-box models, the decoder is trained on a proxy model and transferred to target models. We provide a theoretical analysis of cross-model generalization and demonstrate that our method achieves effective unlearning while preserving general model performance. Experimental results demonstrate that R2F offers a scalable and lightweight alternative for unlearning in pretrained LLMs without requiring full retraining or access to internal parameters.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes