arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.07682cs.LGstat.ML
收藏

FetchSGD:使用草图的高效沟通联邦学习

FetchSGD: Communication-Efficient Federated Learning with Sketching

University of California, Berkeley(加利福尼亚大学伯克利分校);Johns Hopkins University(约翰斯·霍普金斯大学);Amazon(亚马逊)

Daniel Rothchild, Ashwinee Panda, Enayat Ullah, Nikita Ivkin, Ion Stoica, Vladimir Braverman, Joseph Gonzalez, Raman Arora

摘要:

现有的联邦学习方法存在通信瓶颈以及由于稀疏的客户端参与而导致的收敛问题。在本文中,我们介绍了一种新的算法,称为FetchSGD,以克服这些挑战。FetchSGD使用Count Sketch压缩模型更新,然后利用草图的可合并性来合并来自许多工作者的模型更新。FetchSGD设计中的一个关键见解是,由于Count Sketch是线性的,因此动量和误差累积都可以在Sketch内进行。这使得该算法能够将动量和误差积累从客户端转移到中央聚合器,克服稀疏客户端参与的挑战,同时仍然实现高压缩率和良好的收敛性。我们证明了FetchSGD具有良好的收敛保证,并通过训练两个残差网络和一个Transformer模型证明了其经验有效性。

英文摘要:

Existing approaches to federated learning suffer from a communication bottleneck as well as convergence issues due to sparse client participation. In this paper we introduce a novel algorithm, called FetchSGD, to overcome these challenges. FetchSGD compresses model updates using a Count Sketch, and then takes advantage of the mergeability of sketches to combine model updates from many workers. A key insight in the design of FetchSGD is that, because the Count Sketch is linear, momentum and error accumulation can both be carried out within the sketch. This allows the algorithm to move momentum and error accumulation from clients to the central aggregator, overcoming the challenges of sparse client participation while still achieving high compression rates and good convergence. We prove that FetchSGD has favorable convergence guarantees, and we demonstrate its empirical effectiveness by training two residual networks and a transformer model.

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

↑