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

基于个性化事件触发的资源受限去中心化联邦学习

Resource-Constrained Decentralized Federated Learning via Personalized Event-Triggering

Elmore Family School of Electrical and Computer Engineering, Purdue University(电气与计算机工程学院,普渡大学);Department of Electrical Engineering, University at Buffalo–SUNY(电气工程系,布法罗大学–SUNY)

Shahryar Zehtabi, Seyyedali Hosseinalipour, Christopher G. Brinton

AI总结:

针对无中心服务器的资源异构去中心化联邦学习场景,提出带个性化触发条件的异步事件触发通信方法,理论证明其收敛性,实验验证该方法可提升收敛速度、降低通信开销。

摘要:

联邦学习(FL)是一类可在多台边缘设备间分布式开展机器学习(ML)任务的主流技术。本文研究完全去中心化FL场景:设备除在本地执行训练外,还通过设备到设备(D2D)网络上的协作共识形成机制完成模型聚合。针对无法接入中央服务器的场景,我们在设备间引入异步事件触发通信机制。为解决FL中固有的资源异构与统计多样性挑战,我们为每台设备定义了个性化通信触发条件,该条件会权衡本地模型参数变化量与本地可用网络资源。在本文方法的设定下,我们从理论上证明其可达到去中心化梯度下降(DGD)方法收敛至全局最优模型的$O(\ln{k} / \sqrt{k})$收敛速率。相较于现有研究,我们在更宽松的图连通性与数据异构假设下,为模型的最后迭代结果提供了收敛性保证。为此,我们证明了时变D2D图中存在零星通信时的$B$连通信息流保证。后续数值评估表明,与现有去中心化FL基线方法相比,本文方法在收敛速度和/或通信开销节省方面取得了显著提升。

英文摘要:

Federated learning (FL) is a popular technique for distributing machine learning (ML) across a set of edge devices. In this paper, we study fully decentralized FL, where in addition to devices conducting training locally, they carry out model aggregations via cooperative consensus formation over device-to-device (D2D) networks. We introduce asynchronous, event-triggered communications among the devices to handle settings where access to a central server is not feasible. To account for the inherent resource heterogeneity and statistical diversity challenges in FL, we define personalized communication triggering conditions at each device that weigh the change in local model parameters against the available local network resources. We theoretically recover the $O(\ln{k} / \sqrt{k})$ convergence rate to the globally optimal model of decentralized gradient descent (DGD) methods in the setup of our methodology. We provide our convergence guarantees for the last iterates of models, under relaxed graph connectivity and data heterogeneity assumptions compared with the existing literature. To do so, we demonstrate a $B$-connected information flow guarantee in the presence of sporadic communications over the time-varying D2D graph. Our subsequent numerical evaluations demonstrate that our methodology obtains substantial improvements in convergence speed and/or communication savings compared to existing decentralized FL baselines.

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

↑