FedUHB: Accelerating Federated Unlearning via Polyak Heavy Ball Method
On the map: LLM safety and security → Federated unlearning and poisoning
Abstract (arXiv)
Federated learning facilitates collaborative machine learning, enabling multiple participants to collectively develop a shared model while preserving the privacy of individual data. The growing importance of the "right to be forgotten" calls for effective mechanisms to facilitate data removal upon request. In response, federated unlearning (FU) has been developed to efficiently eliminate the influence of specific data from the model. Current FU methods primarily rely on approximate unlearning strategies, which seek to balance data removal efficacy with computational and communication costs, but often fail to completely erase data influence. To address these limitations, we propose FedUHB, a novel exact unlearning approach that leverages the Polyak heavy ball optimization technique, a first-order method, to achieve rapid retraining. In addition, we introduce a dynamic stopping mechanism to optimize the termination of the unlearning process. Our extensive experiments show that FedUHB not only enhances unlearning efficiency but also preserves robust model performance after unlearning. Furthermore, the dynamic stopping mechanism effectively reduces the number of unlearning iterations, conserving both computational and communication resources. FedUHB can be proved as an effective and efficient solution for exact data removal in federated learning settings.
Key facts. Cited by 3 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 18 of its 35 references that are in the map. First posted on arXiv 17 Nov 2024.
Builds on
18 of 35 references.
Closest ancestors · 3
Same direction, newest first
- 2023A Survey on Federated Unlearning: Challenges, Methods, and Future Directions31 Oct
- 2023Class-wise Federated Unlearning: Harnessing Active Forgetting with Teacher-Student Memory Generation7 Jul
- 2022Federated Unlearning with Knowledge Distillation24 Jan
Other references · 15
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2021Convex optimizationcited by 2,479
- 2016Membership Inference Attacks against Machine Learning Modelscited by 2,221
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
- 2020Reflection Backdoor: A Natural Backdoor Attack on Deep Neural Networkscited by 341
- 2019Accelerating Federated Learning via Momentum Gradient Descentcited by 75
- 2014Global convergence of the Heavy-ball method for convex optimizationcited by 60
- 2021Decentralized Federated Learning: Balancing Communication and Computing Costscited by 54
- 2022FedRecover: Recovering from Poisoning Attacks in Federated Learning using Historical Informationcited by 53
- 2024Threats, Attacks, and Defenses in Machine Unlearning: A Surveycited by 34
- 2022Privacy-Preserving Aggregation in Federated Learning: A Surveycited by 25
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2025Are We Truly Forgetting? A Critical Re-examination of Machine Unlearning Evaluation Protocolscited by 16
- 2025Certifying the Right to Be Forgotten: Primal-Dual Optimization for Sample and Label Unlearning in Vertical Federated Learningcited by 1
- 2026Machine Unlearning for Gibbs Supervised Learning Algorithmscited by 0
- 2026Machine Unlearning for Gibbs Supervised Learning Algorithms24 Sep 2026
- 2025Certifying the Right to Be Forgotten: Primal-Dual Optimization for Sample and Label Unlearning in Vertical Federated Learning29 Dec 2025
- 2025Are We Truly Forgetting? A Critical Re-examination of Machine Unlearning Evaluation Protocols10 Mar 2025