Pith. sign in

REVIEW 4 cited by

Label Smoothing Improves Machine Unlearning

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 2406.07698 v1 pith:EVJQCLCK submitted 2024-06-11 cs.LG

classification cs.LG
keywords labelsmoothingunlearningimprovesperformanceapproachcostdemonstrating
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The objective of machine unlearning (MU) is to eliminate previously learned data from a model. However, it is challenging to strike a balance between computation cost and performance when using existing MU techniques. Taking inspiration from the influence of label smoothing on model confidence and differential privacy, we propose a simple gradient-based MU approach that uses an inverse process of label smoothing. This work introduces UGradSL, a simple, plug-and-play MU approach that uses smoothed labels. We provide theoretical analyses demonstrating why properly introducing label smoothing improves MU performance. We conducted extensive experiments on six datasets of various sizes and different modalities, demonstrating the effectiveness and robustness of our proposed method. The consistent improvement in MU performance is only at a marginal cost of additional computations. For instance, UGradSL improves over the gradient ascent MU baseline by 66% unlearning accuracy without sacrificing unlearning efficiency.

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. RULE: Reinforcement UnLEarning Achieves Forget-Retain Pareto Optimality

    cs.CL 2025-06 conditional novelty 6.0 of 10

    RULE trains LLMs to refuse forgotten knowledge and answer permissible queries by optimizing a refusal boundary with reinforcement learning, beating baselines on forget quality and response naturalness with far less data.

  2. GUARD: Generation-time LLM Unlearning via Adaptive Restriction and Detection

    cs.CL 2025-05 conditional novelty 6.0 of 10

    GUARD performs inference-time unlearning by classifying prompts, retrieving original answers, and penalizing token matches during beam search, preserving utility but with forget quality that collapses on larger TOFU f...

  3. Exploring Criteria of Loss Reweighting to Enhance LLM Unlearning

    cs.LG 2025-05 conditional novelty 5.0 of 10

    The authors propose SatImp, a product of a saturation weight and an importance weight, and show it improves the unlearn-retain trade-off on TOFU, WMDP, and MUSE.

  4. Analise de Desaprendizado de Maquina em Modelos de Classificacao de Imagens Medicas

    eess.IV 2025-08 conditional novelty 4.0 of 10

    SalUn unlearning on MedMNIST achieves near-retraining accuracy on BloodMNIST and OrganAMNIST but a roughly 8 to 10 point accuracy gap on PathMNIST, at a fraction of the runtime.

Pith tools