FedShard: Federated Unlearning with Efficiency Fairness and Performance Fairness

TL;DR

FedShard is a novel federated unlearning algorithm that ensures efficiency and performance fairness among clients, effectively balancing unlearning speed, fairness, and robustness against attacks.

Contribution

Introduces FedShard, the first federated unlearning method to simultaneously guarantee efficiency fairness and performance fairness among decentralized clients.

Findings

FedShard accelerates unlearning 1.3-6.2 times faster than retraining from scratch.

It outperforms existing methods by 4.9 times in unlearning speed.

FedShard mitigates unfairness risks like cascaded leaving and poisoning attacks.

Abstract

To protect clients' right to be forgotten in federated learning, federated unlearning aims to remove the data contribution of leaving clients from the global learned model. While current studies mainly focused on enhancing unlearning efficiency and effectiveness, the crucial aspects of efficiency fairness and performance fairness among decentralized clients during unlearning have remained largely unexplored. In this study, we introduce FedShard, the first federated unlearning algorithm designed to concurrently guarantee both efficiency fairness and performance fairness. FedShard adaptively addresses the challenges introduced by dilemmas among convergence, unlearning efficiency, and unlearning fairness. Furthermore, we propose two novel metrics to quantitatively assess the fairness of unlearning algorithms, which we prove to satisfy well-known properties in other existing fairness measurements. Our theoretical analysis and numerical evaluation validate FedShard's fairness in terms of both unlearning performance and efficiency. We demonstrate that FedShard mitigates unfairness risks such as cascaded leaving and poisoning attacks and realizes more balanced unlearning costs among clients. Experimental results indicate that FedShard accelerates the data unlearning process 1.3-6.2 times faster than retraining from scratch and 4.9 times faster than the state-of-the-art exact unlearning methods.