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

On the Convergence of Heterogeneous Federated Learning with Arbitrary Adaptive Online Model Pruning

George Washington University(乔治华盛顿大学);Tsinghua-Berkeley Shenzhen Institute(清华-伯克利深圳学院)

Hanhan Zhou, Tian Lan, Guru Venkataramani, Wenbo Ding

英文摘要:

One of the biggest challenges in Federated Learning (FL) is that client devices often have drastically different computation and communication resources for local updates. To this end, recent research efforts have focused on training heterogeneous local models obtained by pruning a shared global model. Despite empirical success, theoretical guarantees on convergence remain an open question. In this paper, we present a unifying framework for heterogeneous FL algorithms with {\em arbitrary} adaptive online model pruning and provide a general convergence analysis. In particular, we prove that under certain sufficient conditions and on both IID and non-IID data, these algorithms converges to a stationary point of standard FL for general smooth cost functions, with a convergence rate of $O(\frac{1}{\sqrt{Q}})$. Moreover, we illuminate two key factors impacting convergence: pruning-induced noise and minimum coverage index, advocating a joint design of local pruning masks for efficient training.

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

↑