paper-with-me

홈 › Papers

Reversing the Forget-Retain Objectives: An Efficient LLM Unlearning Framework from Logit Difference

2024-06-12 · Jiabao Ji, Yujian Liu, Yang Zhang, Gaowen Liu, Ramana Rao Kompella, Sijia Liu, Shiyu Chang

As Large Language Models (LLMs) demonstrate extensive capability in learning from documents, LLM unlearning becomes an increasingly important research area to address concerns of LLMs in terms of privacy, copyright, etc. A conventional LLM unlearning task typically involves two goals: (1) The target LLM should forget the knowledge in the specified forget documents, and (2) it should retain the other knowledge that the LLM possesses, for which we assume access to a small number of retain documents. To achieve both goals, a mainstream class of LLM unlearning methods introduces an optimization framework with a combination of two objectives - maximizing the prediction loss on the forget documents while minimizing that on the retain documents, which suffers from two challenges, degenerated output and catastrophic forgetting. In this paper, we propose a novel unlearning framework called Unlearning from Logit Difference (ULD), which introduces an assistant LLM that aims to achieve the opposite of the unlearning goals: remembering the forget documents and forgetting the retain knowledge. ULD then derives the unlearned LLM by computing the logit difference between the target and the assistant LLMs. We show that such reversed objectives would naturally resolve both aforementioned challenges while significantly improving the training efficiency. Extensive experiments demonstrate that our method efficiently achieves the intended forgetting while preserving the LLM's overall capabilities, reducing training time by more than threefold. Notably, our method loses 0% of model utility on the ToFU benchmark, whereas baseline methods may sacrifice 17% of utility on average to achieve comparable forget quality. Our code will be publicly available at https://github.com/UCSB-NLP-Chang/ULD.

📄 PDF Abstract BibTeX arXiv:2406.08607

Code (1)

ucsb-nlp-chang/uld 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

Tofu 설명 없음

Similar Papers 제목 키워드 기반

How Hard Can It Be? Hardness-Aware Multi-Objective Unlearning

2026-06-01 · Jiangwei Chen, Xinyuan Niu, Rachael Hwee Ling Sim, Zhengyuan Liu 외 arxiv

Machine unlearning aims to remove the influence of specific forget training data due to privacy, copyright or bias concerns while maintaining the model performance on the remaining retain data. Existing unlearning algori…

CURE:Circuit-Aware Unlearning for LLM-based Recommendation

2026-04-04 · Ziheng Chen, Jiali Cheng, Zezhong Fan, Hadi Amiri 외 arxiv

Recent advances in large language models (LLMs) have opened new opportunities for recommender systems by enabling rich semantic understanding and reasoning about user interests and item attributes. However, as privacy re…

From Logits to Latents: Contrastive Representation Shaping for LLM Unlearning

2026-01-29 · Haoran Tang, Rajiv Khanna arxiv

Most LLM unlearning methods aim to approximate retrain-from-scratch behaviors with minimal distribution shift, often via alignment-style objectives defined in the prediction space. While effective at reducing forgotten c…

DualOptim+: Bridging Shared and Decoupled Optimizer States for Better Machine Unlearning in Large Language Models

2026-05-20 · Xuyang Zhong, Qizhang Li, Yiwen Guo, Chen Liu arxiv

We propose DualOptim+, a novel optimization framework for improving machine unlearning in large language models. It introduces a base state to capture common representations shared by forgetting and retaining objectives …

Multi-Task Learning

SAUL: Sharpness-Aware Augmented-Lagrangian Unlearning

2026-08-17 · Jaewan Choi, Junyoung Yang, Sangdon Park 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 form…