FEDBUD:面向资源受限联邦学习的激励与隐私联合优化 / FEDBUD: Joint Incentive and Privacy Optimization for Resource-Constrained Federated Learning
1️⃣ 一句话总结
这篇论文提出了一个名为FEDBUD的新系统,它通过一种博弈论方法,在联邦学习中同时解决了如何激励参与者贡献数据、以及如何保护他们隐私这两个关键问题,并找到了双方都能接受的最优平衡点。
Federated learning has become a popular paradigm for privacy protection and edge-based machine learning. However, defending against differential attacks and devising incentive strategies remain significant bottlenecks in this field. Despite recent works on privacy-aware incentive mechanism design for federated learning, few of them consider both data volume and noise level. In this paper, we propose a novel federated learning system called FEDBUD, which combines privacy and economic concerns together by considering the joint influence of data volume and noise level on incentive strategy determination. In this system, the cloud server controls monetary payments to edge nodes, while edge nodes control data volume and noise level that potentially impact the model performance of the cloud server. To determine the mutually optimal strategies for both sides, we model FEDBUD as a two-stage Stackelberg Game and derive the Nash Equilibrium using the mean-field estimator and virtual queue. Experimental results on real-world datasets demonstrate the outstanding performance of FEDBUD.
FEDBUD:面向资源受限联邦学习的激励与隐私联合优化 / FEDBUD: Joint Incentive and Privacy Optimization for Resource-Constrained Federated Learning
这篇论文提出了一个名为FEDBUD的新系统,它通过一种博弈论方法,在联邦学习中同时解决了如何激励参与者贡献数据、以及如何保护他们隐私这两个关键问题,并找到了双方都能接受的最优平衡点。
源自 arXiv: 2604.10499