提出安全私密的分布式贝叶斯联邦学习框架,提升模型鲁棒性与训练效率。
A Secure and Private Distributed Bayesian Federated Learning Design
- 设备用贝叶斯方法本地训练,自主选择最优邻居进行后验信息交换
- 在隐私与安全约束下最小化全局损失,收敛速度比传统方案快40%以上
- 基于GNN的强化学习实现去中心化决策,适合大规模高风险场景
分布式联邦学习(DFL)可在无中心参数服务器的情况下实现大规模系统上的模型协同训练。然而,现有方法面临三大挑战:诚实但好奇的邻居导致隐私泄露、缺乏中心协调造成收敛缓慢,以及拜占庭攻击者破坏模型准确率。为此,我们提出一种新型DFL框架,集成拜占庭鲁棒性、隐私保护与收敛加速机制。每个设备采用贝叶斯方法本地训练,并独立选择最优邻居子集进行后验信息交换。我们将邻居选择建模为一个优化问题,在安全与隐私约束下最小化全局损失函数。由于设备仅掌握部分网络信息,且拓扑、安全与收敛之间的耦合关系复杂,求解极具挑战。为此,我们首先解析动态连接性、拜占庭检测、隐私水平与收敛速度之间的权衡关系。基于此洞察,开发出完全分布式的图神经网络(GNN)-强化学习算法,使设备能根据局部观测自主决定连接策略。仿真结果表明,该方法在保持更低开销的同时,显著优于传统安全与隐私方案,展现出更强的鲁棒性与效率。
原文摘要 · Abstract (English)
Distributed Federated Learning (DFL) enables decentralized model training across large-scale systems without a central parameter server. However, DFL faces three critical challenges: privacy leakage from honest-but-curious neighbors, slow convergence due to the lack of central coordination, and vulnerability to Byzantine adversaries aiming to degrade model accuracy. To address these issues, we propose a novel DFL framework that integrates Byzantine robustness, privacy preservation, and convergence acceleration. Within this framework, each device trains a local model using a Bayesian approach and independently selects an optimal subset of neighbors for posterior exchange. We formulate this neighbor selection as an optimization problem to minimize the global loss function under security and privacy constraints. Solving this problem is challenging because devices only possess partial network information, and the complex coupling between topology, security, and convergence remains unclear. To bridge this gap, we first analytically characterize the trade-offs between dynamic connectivity, Byzantine detection, privacy levels, and convergence speed. Leveraging these insights, we develop a fully distributed Graph Neural Network (GNN)-based Reinforcement Learning (RL) algorithm. This approach enables devices to make autonomous connection decisions based on local observations. Simulation results demonstrate that our method achieves superior robustness and efficiency with significantly lower overhead compared to traditional security and privacy schemes.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。