Pith. sign in

REVIEW 10 cited by

Machine Unlearning of Features and Labels

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 2108.11577 v4 pith:LVXQ46IK submitted 2021-08-26 cs.LG cs.CR

Machine Unlearning of Features and Labels

classification cs.LG cs.CR
keywords unlearningdatafeatureslabelsmodellearningmachineeffective
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Removing information from a machine learning model is a non-trivial task that requires to partially revert the training process. This task is unavoidable when sensitive data, such as credit card numbers or passwords, accidentally enter the model and need to be removed afterwards. Recently, different concepts for machine unlearning have been proposed to address this problem. While these approaches are effective in removing individual data points, they do not scale to scenarios where larger groups of features and labels need to be reverted. In this paper, we propose the first method for unlearning features and labels. Our approach builds on the concept of influence functions and realizes unlearning through closed-form updates of model parameters. It enables to adapt the influence of training data on a learning model retrospectively, thereby correcting data leaks and privacy issues. For learning models with strongly convex loss functions, our method provides certified unlearning with theoretical guarantees. For models with non-convex losses, we empirically show that unlearning features and labels is effective and significantly faster than other strategies.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 10 Pith papers

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

  1. Initialization is Half the Battle: Generating Diverse Images from a Guidance Potential Posterior

    cs.CV 2026-06 unverdicted novelty 7.0

    DivIn samples initial noise from a guidance potential posterior via Langevin dynamics to improve diversity in class-to-image and text-to-image generation.

  2. Efficient Unlearning through Maximizing Relearning Convergence Delay

    cs.LG 2026-04 unverdicted novelty 7.0

    The Influence Eliminating Unlearning framework maximizes relearning convergence delay via weight decay and noise injection to remove the influence of a forgetting set while preserving accuracy on retained data.

  3. Multi-Objective Reference-Aligned Machine Unlearning

    cs.LG 2026-05 unverdicted novelty 6.0

    RAUL is a multi-objective unlearning framework using bounded KL alignment to a reference distribution and Jacobian descent that reports closer performance to full retraining than single-objective baselines.

  4. Does Machine Unlearning Preserve Clinical Safety? A Risk Analysis for Medical Image Classification

    cs.AI 2026-04 unverdicted novelty 6.0

    Standard unlearning raises false-negative rates and clinical risk in medical image models, but a modified SalUn-CRA variant using entropy-based forgetting for malignant samples matches full retraining risk while still...

  5. Representation-Guided Parameter-Efficient LLM Unlearning

    cs.CL 2026-04 unverdicted novelty 6.0

    REGLU guides LoRA-based unlearning via representation subspaces and orthogonal regularization to outperform prior methods on forget-retain trade-off in LLM benchmarks.

  6. Exploring Nonlinear Pathway in Parameter Space for Machine Unlearning

    cs.AI 2025-05 unverdicted novelty 6.0

    MCU applies mode connectivity to trace nonlinear unlearning pathways in parameter space, adds a parameter mask and adaptive penalty, and produces a range of unlearning models that plug into existing methods.

  7. SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation

    cs.LG 2023-10 conditional novelty 6.0

    SalUn uses gradient-based weight saliency to achieve effective machine unlearning of data, classes, or concepts in image classification and generation, narrowing the gap to exact retraining.

  8. BARRIER: Bounded Activation Regions for Robust Information Erasure

    cs.CV 2026-05 unverdicted novelty 5.0

    BARRIER applies interval arithmetic to SVD-based activation projections to create bounded forget regions that enable aggressive unlearning while providing formal protection for retain distributions via tail bounds on ...

  9. Unbiased Rectification for Sequential Recommender Systems Under Fake Orders

    cs.IR 2026-01 unverdicted novelty 5.0

    DITaR identifies suspicious fake orders via collaborative and semantic representations, filters to the truly harmful subset, and performs selective rectification to remove bias while preserving data volume and sequenc...

  10. Machine Unlearning on Pre-trained Models by Residual Feature Alignment Using LoRA

    cs.LG 2024-11 unverdicted novelty 5.0

    A LoRA-based residual feature alignment method for efficient machine unlearning on pre-trained models by targeting zero residuals on retained data and shifted residuals on unlearned data.