Pith. sign in

REVIEW 2 cited by

Class-wise Federated Unlearning: Harnessing Active Forgetting with Teacher-Student Memory Generation

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 2307.03363 v2 pith:6YN5QJTW submitted 2023-07-07 cs.LG

classification cs.LG
keywords unlearningfederateddataforgettinglearningactiveaddressclass-wise
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Privacy concerns associated with machine learning models have driven research into machine unlearning, which aims to erase the memory of specific target training data from already trained models. This issue also arises in federated learning, creating the need to address the federated unlearning problem. However, federated unlearning remains a challenging task. On the one hand, current research primarily focuses on unlearning all data from a client, overlooking more fine-grained unlearning targets, e.g., class-wise and sample-wise removal. On the other hand, existing methods suffer from imprecise estimation of data influence and impose significant computational or storage burden. To address these issues, we propose a neuro-inspired federated unlearning framework based on active forgetting, which is independent of model architectures and suitable for fine-grained unlearning targets. Our framework distinguishes itself from existing methods by utilizing new memories to overwrite old ones. These new memories are generated through teacher-student learning. We further utilize refined elastic weight consolidation to mitigate catastrophic forgetting of non-target data. Extensive experiments on benchmark datasets demonstrate the efficiency and effectiveness of our method, achieving satisfactory unlearning completeness against backdoor attacks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Streamlined Federated Unlearning: Unite as One to Be Highly Efficient

    cs.LG 2024-11 conditional novelty 5.0 of 10

    SFU replaces the two usual federated unlearning steps with a single multi-teacher distillation objective that erases target classes in one or two rounds while keeping retained-data accuracy.

  2. FedUHB: Accelerating Federated Unlearning via Polyak Heavy Ball Method

    cs.LG 2024-11 conditional novelty 4.0 of 10

    FedUHB accelerates exact federated unlearning by retraining with Polyak heavy ball momentum and a dynamic stopping criterion.

Pith tools