mlsanityData to 7 Oct 2026

Scalable Federated Unlearning via Isolated and Coded Sharding

arXiv 2401.15957 ↗First posted 29 Jan 2024cs.LG cs.AI cs.CRcited by 6

On the map: LLM safety and security → Federated unlearning and poisoning

Abstract (arXiv)

Federated unlearning has emerged as a promising paradigm to erase the client-level data effect without affecting the performance of collaborative learning models. However, the federated unlearning process often introduces extensive storage overhead and consumes substantial computational resources, thus hindering its implementation in practice. To address this issue, this paper proposes a scalable federated unlearning framework based on isolated sharding and coded computing. We first divide distributed clients into multiple isolated shards across stages to reduce the number of clients being affected. Then, to reduce the storage overhead of the central server, we develop a coded computing mechanism by compressing the model parameters across different shards. In addition, we provide the theoretical analysis of time efficiency and storage effectiveness for the isolated and coded sharding. Finally, extensive experiments on two typical learning tasks, i.e., classification and generation, demonstrate that our proposed framework can achieve better performance than three state-of-the-art frameworks in terms of accuracy, retraining time, storage overhead, and F1 scores for resisting membership inference attacks.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in Federated unlearning and poisoning, one of 12 directions in LLM safety and security. Builds on 11 of its 25 references that are in the map. First posted on arXiv 29 Jan 2024.

Builds on

11 of 25 references.

Closest ancestors · 2

Same direction, newest first

  1. 2022The Right to be Forgotten in Federated Learning: An Efficient Realization with Rapid Retraining14 Mar
  2. 2021Federated Unlearning via Class-Discriminative Pruning22 Oct

Other references · 9

  1. 2017Attention Is All You Needcited by 59,932
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  4. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
  5. 2019Machine Unlearningcited by 1,020
  6. 2022Knowledge Unlearning for Mitigating Privacy Risks in Language Modelscited by 424
  7. 2023Towards Unbounded Machine Unlearningcited by 261
  8. 2023Unlearn What You Want to Forget: Efficient Unlearning for LLMscited by 211
  9. 2018PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneouslycited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 2; 2026: 2.

6 papers.