arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.04705cs.LGcs.NI
收藏

带宽受限网络中基于覆盖网络的去中心化联邦学习

Overlay-based Decentralized Federated Learning in Bandwidth-limited Networks

Pennsylvania State University(宾夕法尼亚州立大学)

Yudi Huang, Tingyang Sun, Ting He

AI总结:

针对一般带宽受限网络中 DFL 邻近性假设失配的问题,本文借助网络层析成像联合优化覆盖网络通信需求与调度,并分解为可高效求解的优化问题以最小化训练时间。

摘要:

新兴的去中心化联邦学习(DFL)机器学习范式有望通过在分布式智能体之间直接学习而无需中心化协调,极大推动人工智能(AI)的部署。尽管在提升 DFL 通信效率方面已有大量努力,但现有大多数解决方案都基于一个过于简单的假设,即相邻智能体在底层通信网络中物理邻近;当在许多边缘网络中遇到的一般带宽受限网络上进行学习时,这无法准确刻画通信成本。在本工作中,我们利用网络层析成像的最新进展来弥补这一空白,在无需底层网络明确协作的情况下,为带宽受限网络中基于覆盖网络的 DFL 联合设计通信需求与通信调度。通过仔细分析问题结构,我们将其分解为一系列均可高效求解的优化问题,以共同最小化总训练时间。大量数据驱动的仿真表明,与最先进的设计相比,我们的解决方案能够显著加速 DFL。

英文摘要:

The emerging machine learning paradigm of decentralized federated learning (DFL) has the promise of greatly boosting the deployment of artificial intelligence (AI) by directly learning across distributed agents without centralized coordination. Despite significant efforts on improving the communication efficiency of DFL, most existing solutions were based on the simplistic assumption that neighboring agents are physically adjacent in the underlying communication network, which fails to correctly capture the communication cost when learning over a general bandwidth-limited network, as encountered in many edge networks. In this work, we address this gap by leveraging recent advances in network tomography to jointly design the communication demands and the communication schedule for overlay-based DFL in bandwidth-limited networks without requiring explicit cooperation from the underlying network. By carefully analyzing the structure of our problem, we decompose it into a series of optimization problems that can each be solved efficiently, to collectively minimize the total training time. Extensive data-driven simulations show that our solution can significantly accelerate DFL in comparison with state-of-the-art designs.

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

↑