Alternate Preference Optimization for Unlearning Factual Knowledge in Large Language Models
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3EQXIUASrecord.jsonopen to challenge →
read the original abstract
Machine unlearning aims to efficiently eliminate the influence of specific training data, known as the forget set, from the model. However, existing unlearning methods for Large Language Models (LLMs) face a critical challenge: they rely solely on negative feedback to suppress responses related to the forget set, which often results in nonsensical or inconsistent outputs, diminishing model utility and posing potential privacy risks. To address this limitation, we propose a novel approach called Alternate Preference Optimization (AltPO), which combines negative feedback with in-domain positive feedback on the forget set. Additionally, we introduce new evaluation metrics to assess the quality of responses related to the forget set. Extensive experiments show that our approach not only enables effective unlearning but also avoids undesirable model behaviors while maintaining overall model performance. Our implementation can be found at https://github.com/molereddy/Alternate-Preference-Optimization.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
SAGE: Retain-Aware Post-Hoc Sanitization of Final Unlearning Vector
SAGE is a source-agnostic post-hoc correction for LLM unlearning updates that suppresses components aligned with high-energy retained activation directions while preserving the forgetting carrier.
-
OFMU: Optimization-Driven Framework for Machine Unlearning
A penalty-based bi-level optimization framework for machine unlearning that decorrelates forget and retention gradients via inner maximization and restores utility via outer minimization, with convergence guarantees a...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.