arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.04083cs.LGcs.DCmath.OC

提升去中心化联邦学习的模型一致性

Improving the Model Consistency of Decentralized Federated Learning

Tsinghua University(清华大学);JD Explore Academy(京东探索研究院);Hong Kong Polytechnic University(香港理工大学);The University of Sydney(悉尼大学)

Yifan Shi, Li Shen, Kang Wei, Yan Sun, Bo Yuan, Xueqian Wang, Dacheng Tao

AI总结:

针对去中心化联邦学习模型一致性差、性能弱于中心化方案的问题,提出结合SAM梯度扰动与多gossip步的两种算法,在非凸设置下取得更优收敛率,性能媲美中心化方法且优于现有去中心化方案。

摘要:

为缓解联邦学习(FL)的隐私泄露与通信负担问题,去中心化联邦学习(DFL)摒弃了中央服务器,每个客户端仅在去中心化通信网络中与其邻居节点通信。然而,现有DFL存在各客户端间模型一致性差的问题,会导致严重的分布偏移,且性能弱于中心化联邦学习(CFL),在数据异构或通信拓扑稀疏的场景下尤为明显。为解决该问题,本文提出两种DFL算法:DFedSAM与DFedSAM-MGS,以提升DFL性能。具体而言,DFedSAM利用梯度扰动,通过锐度感知最小化(SAM)生成局部平坦模型,SAM可搜寻损失值整体较低的模型。DFedSAM-MGS则采用多 gossip 步(MGS)进一步优化DFedSAM,以提升模型一致性,既加快了局部平坦模型的聚合速度,也能更好地平衡通信复杂度与泛化能力。理论上,本文推导了两种算法在非凸设置下的改进收敛速率:DFedSAM为$\tiny \mathcal{O}\big(\frac{1}{\sqrt{KT}}+\frac{1}{T}+\frac{1}{K^{1/2}T^{3/2}(1-\lambda)^2}\big)$,DFedSAM-MGS为$\tiny \mathcal{O}\big(\frac{1}{\sqrt{KT}}+\frac{1}{T}+\frac{\lambda^Q+1}{K^{1/2}T^{3/2}(1-\lambda^Q)^2}\big)$,其中$1-\lambda$为gossip矩阵的谱间隙,$Q$为MGS的步数。实验结果表明,本文方法性能可与CFL方法相媲美,且优于现有DFL方法。

英文摘要:

To mitigate the privacy leakages and communication burdens of Federated Learning (FL), decentralized FL (DFL) discards the central server and each client only communicates with its neighbors in a decentralized communication network. However, existing DFL suffers from high inconsistency among local clients, which results in severe distribution shift and inferior performance compared with centralized FL (CFL), especially on heterogeneous data or sparse communication topology. To alleviate this issue, we propose two DFL algorithms named DFedSAM and DFedSAM-MGS to improve the performance of DFL. Specifically, DFedSAM leverages gradient perturbation to generate local flat models via Sharpness Aware Minimization (SAM), which searches for models with uniformly low loss values. DFedSAM-MGS further boosts DFedSAM by adopting Multiple Gossip Steps (MGS) for better model consistency, which accelerates the aggregation of local flat models and better balances communication complexity and generalization. Theoretically, we present improved convergence rates $\small \mathcal{O}\big(\frac{1}{\sqrt{KT}}+\frac{1}{T}+\frac{1}{K^{1/2}T^{3/2}(1-λ)^2}\big)$ and $\small \mathcal{O}\big(\frac{1}{\sqrt{KT}}+\frac{1}{T}+\frac{λ^Q+1}{K^{1/2}T^{3/2}(1-λ^Q)^2}\big)$ in non-convex setting for DFedSAM and DFedSAM-MGS, respectively, where $1-λ$ is the spectral gap of gossip matrix and $Q$ is the number of MGS. Empirically, our methods can achieve competitive performance compared with CFL methods and outperform existing DFL methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑