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

联邦学习中的循环模型更新:梯度子空间是低秩的吗?

Recycling Model Updates in Federated Learning: Are Gradient Subspaces Low-Rank?

Purdue University(普渡大学)

Sheikh Shams Azam, Seyyedali Hosseinalipour, Qiang Qiu, Christopher Brinton

摘要:

在本文中,我们质疑在联邦学习过程中通过分布式系统传播大量参数的基本原理。我们首先检查由跨时期的梯度所跨越的子空间的秩特性(即,梯度空间),并观察到该梯度空间通常由占解释方差的绝大多数(95-99%)的几个主要主成分组成。受此启发,我们提出了“回望梯度乘法器”(LBGM)算法,该算法利用这种低秩属性,使梯度循环之间的模型更新轮的联邦学习,减少大参数的传输到单个标量的聚合。我们分析了LBGM的收敛行为,揭示了通信节省和模型性能之间的权衡的性质。我们随后的实验结果表明,与传统的联邦学习相比,LBGM在多个数据集和深度学习模型上的通信开销有所改善。此外,我们表明,LBGM是一个通用的即插即用算法,可以单独使用或堆叠在现有的稀疏化技术的分布式模型训练。

英文摘要:

In this paper, we question the rationale behind propagating large numbers of parameters through a distributed system during federated learning. We start by examining the rank characteristics of the subspace spanned by gradients across epochs (i.e., the gradient-space) in centralized model training, and observe that this gradient-space often consists of a few leading principal components accounting for an overwhelming majority (95-99%) of the explained variance. Motivated by this, we propose the "Look-back Gradient Multiplier" (LBGM) algorithm, which exploits this low-rank property to enable gradient recycling between model update rounds of federated learning, reducing transmissions of large parameters to single scalars for aggregation. We analytically characterize the convergence behavior of LBGM, revealing the nature of the trade-off between communication savings and model performance. Our subsequent experimental results demonstrate the improvement LBGM obtains in communication overhead compared to conventional federated learning on several datasets and deep learning models. Additionally, we show that LBGM is a general plug-and-play algorithm that can be used standalone or stacked on top of existing sparsification techniques for distributed model training.

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

↑