Pith. sign in

REVIEW 3 cited by

Exploring Federated Unlearning: Review, Comparison, and Insights

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 2310.19218 v5 pith:GNO4ZNWM submitted 2023-10-30 cs.LG

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

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The increasing demand for privacy-preserving machine learning has spurred interest in federated unlearning, which enables the selective removal of data from models trained in federated systems. However, developing federated unlearning methods presents challenges, particularly in balancing three often conflicting objectives: privacy, accuracy, and efficiency. This paper provides a comprehensive analysis of existing federated unlearning approaches, examining their algorithmic efficiency, impact on model accuracy, and effectiveness in preserving privacy. We discuss key trade-offs among these dimensions and highlight their implications for practical applications across various domains. Additionally, we propose the OpenFederatedUnlearning framework, a unified benchmark for evaluating federated unlearning methods, incorporating classic baselines and diverse performance metrics. Our findings aim to guide practitioners in navigating the complex interplay of these objectives, offering insights to achieve effective and efficient federated unlearning. Finally, we outline directions for future research to further advance the state of federated unlearning techniques.

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. Federated Unlearning Over Wireless Networks

    cs.IT 2026-08 conditional novelty 6.0 of 10

    A nested bisection and golden-section search over bandwidth, power, CPU frequency, and local accuracy minimizes the completion time of federated unlearning under wireless channel uncertainty.

  2. Federated Unlearning with Gradient Descent and Conflict Mitigation

    cs.LG 2024-12 conditional novelty 5.0 of 10

    FedOSD uses a bounded unlearning loss, an orthogonal steepest descent direction, and gradient projection in post-training to unlearn a federated learning client with little utility loss.

  3. MUNBa: Machine Unlearning via Nash Bargaining

    cs.CV 2024-11 conditional novelty 5.0 of 10

    MUNBa is a machine unlearning method that uses Nash bargaining to balance forgetting and preservation gradients, improving unlearning quality, generalization, and robustness in image classification and generation.

Pith tools