Pith. sign in

REVIEW 4 cited by

ReLearn: Unlearning via Learning for Large Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.11190 v3 pith:ZNE6NMLL submitted 2025-02-16 cs.CL cs.AIcs.CVcs.HCcs.LG

classification cs.CLcs.AIcs.CVcs.HCcs.LG
keywords relearnforgettingunlearningwhiledisruptsevaluationframeworkgeneration
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Current unlearning methods for large language models usually rely on reverse optimization to reduce target token probabilities. However, this paradigm disrupts the subsequent tokens prediction, degrading model performance and linguistic coherence. Moreover, existing evaluation metrics overemphasize contextual forgetting while inadequately assessing response fluency and relevance. To address these challenges, we propose ReLearn, a data augmentation and fine-tuning pipeline for effective unlearning, along with a comprehensive evaluation framework. This framework introduces Knowledge Forgetting Rate (KFR) and Knowledge Retention Rate (KRR) to measure knowledge-level preservation, and Linguistic Score (LS) to evaluate generation quality. Our experiments show that ReLearn successfully achieves targeted forgetting while preserving high-quality output. Through mechanistic analysis, we further demonstrate how reverse optimization disrupts coherent text generation, while ReLearn preserves this essential capability. Code is available at https://github.com/zjunlp/unlearn.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Model Unlearning via Sparse Autoencoder Subspace Guided Projections

    cs.CL 2025-05 conditional novelty 6.0 of 10

    SSPU uses SAE-derived subspaces to guide weight updates, lowering WMDP-Cyber accuracy by 3.22% more than RMU while largely preserving MMLU, TruthfulQA, and GSM8K performance.

  2. Representation-Aware Unlearning via Activation Signatures: From Suppression to Entity-Signature Erasure

    cs.CL 2026-01 reject novelty 5.0 of 10

    KIF reports near-oracle entity unlearning on TOFU (FQ=0.99, MU=0.62) by suppressing subject-specific activation directions and distilling the behavior into LoRA, but its 'internal attenuation' evidence rests on an out...

  3. SoK: Machine Unlearning for Large Language Models

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A new taxonomy for LLM unlearning distinguishes removal-intended from suppression-intended methods, and argues that gradient ascent methods functionally behave like suppression.

  4. Editing as Unlearning: Are Knowledge Editing Methods Strong Baselines for Large Language Model Unlearning?

    cs.LG 2025-05 conditional novelty 5.0 of 10

    WISE and AlphaEdit, two knowledge editing methods, are competitive unlearning baselines when unlearning is framed as editing a model's answer into a refusal.

Pith tools