Pith. sign in

REVIEW 3 cited by

Machine Unlearning in 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 2404.16841 v1 pith:7DKHXXAH submitted 2024-02-03 cs.CR

classification cs.CR
keywords llmsmodelunlearninglosscompromisinglanguagelargemachine
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Recently, large language models (LLMs) have emerged as a notable field, attracting significant attention for its ability to automatically generate intelligent contents for various application domains. However, LLMs still suffer from significant security and privacy issues. For example, LLMs might expose user privacy from hacking attacks or targeted prompts. To address this problem, this paper introduces a novel machine unlearning framework into LLMs. Our objectives are to make LLMs not produce harmful, hallucinatory, or privacy-compromising responses, while retaining their standard output capabilities. To accomplish this, we use an evaluative model to pinpoint dialogues needing unlearning. We also establish a distance loss to function as the model's negative loss, diverting it from previous undesirable outputs. Furthermore, we determine the expected output's cluster mean to formulate a positive loss, directing the model's outputs toward preferable outcomes without compromising its reasoning abilities and performance. Experimental results show that our approach effectively meets unlearning objectives without substantially compromising model performance.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Module-Aware Parameter-Efficient Machine Unlearning on Transformers

    cs.LG 2025-08 conditional novelty 5.0 of 10

    MAPE-Unlearn uses Fisher-information-based scores and greedy search to select important heads and filters, then applies sparse unlearning updates, claiming improved efficacy-fidelity trade-offs on Transformers.

  2. ForgetMe: Evaluating Selective Forgetting in Generative Models

    cs.CV 2025-04 reject novelty 5.0 of 10

    The authors propose the ForgetMe dataset and the Entangled metric to evaluate selective unlearning in diffusion models, using SAM, CLIP, GPT-4o, and LaMa to build paired original/background images.

  3. Forget Vectors at Play: Universal Input Perturbations Driving Machine Unlearning in Image Classification

    cs.LG 2024-12 reject novelty 5.0 of 10

    A single optimized input perturbation can make a fixed image classifier misclassify targeted classes, mimicking unlearning without any weight update.

Pith tools