Incentive and Dynamic Client Selection for Federated Unlearning
Yijing Lin, Zhipeng Gao, Hongyang Du, Dusit Niyato, Jiawen Kang, Xiaoyuan Liu
Abstract
With the development of AI-Generated Content (AIGC), data is becoming increasingly important, while the right of data to be forgotten, which is defined in the General Data Protection Regulation (GDPR) and permits data owners to remove information from AIGC models, is also arising. To protect this right in a distributed manner corresponding to federated learning, federated unlearning is employed to eliminate history model updates and unlearn the global model to mitigate data effects from the targeted clients intending to withdraw from training tasks. To diminish centralization failures, the hierarchical federated framework that is distributed and collaborative can be integrated into the unlearning process, wherein each cluster can support multiple AIGC tasks. However, two issues remain unexplored in current federated unlearning solutions: 1) getting remaining clients, those not withdraw from the task, to join the unlearning process, which demands additional resources and notably has fewer benefits than federated learning, particularly in achieving the original performance via alternative unlearning processes and 2) exploring mechanisms for dynamic unlearning in the selection of remaining clients possessing unbalanced data to avoid starting the unlearning from scratch. We initially consider a two-level incentive and unlearning mechanism to address the aforementioned challenges. At the lower level, we utilize evolutionary game theory to model the dynamic participation process, aiming to attract remaining clients to participate in retraining tasks. At the upper level, we integrate deep reinforcement learning into federated unlearning to dynamically select remaining clients to join the unlearning process to mitigate the bias introduced by the unbalanced data distribution among clients. Experimental results demonstrate that the proposed mechanisms outperform comparative methods, enhancing utilities and improving accuracy.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get b0b0da99-29dc-4e44-b7a8-9a8d6584b9b5Cited by top-tier papers3
- TAPE: Tailored Posterior Difference for Auditing of Machine UnlearningWeiqi Wang, Zhiyi Tian, An Liu, Shui YuWWW 2025 · 9 citations
- Unlearning’s Blind Spots: Over‑Unlearning and Prototypical Relearning AttackSeungBum Ha, Saerom Park, Sung Whan YoonICML 2026 · 2 citations
- Dual-Phase Federated Deep Unlearning via Weight-Aware Rollback and ReconstructionChangjun Zhou, Jintao Zheng, Leyou Yang, Pengfei WangINFOCOM 2026
Related papers
- FORGET ME: Federated Unlearning for Face Generation ModelsFan Qi, Ao Liu, Zixin Zhang, Changsheng XuACM MM 2025 · 1 citation
- The Right to be Forgotten in Federated Learning: An Efficient Realization with Rapid RetrainingYi Liu, Lei Xu, Xingliang Yuan, Cong Wang et al.INFOCOM 2022 · 189 citations
- REMISVFU: Vertical Federated Unlearning via Representation Misdirection for Intermediate Output FeatureWenhan Wu, Zhili He, Huanghuang Liang, Yili Gong et al.AAAI 2026
- Strategic Data Revocation in Federated UnlearningNingning Ding, Ermin Wei, Randall BerryINFOCOM 2024 · 10 citations
- Amnesiac Machine LearningLaura Graves, Vineel Nagisetty, Vijay GaneshAAAI 2021 · 416 citations
