arXivDaily arXiv每日学术速递 周一至周五更新
看起来今天可以划水了
arXiv 2202.01545cs.LGcs.DCmath.OCstat.ML
收藏

通过 ClippedGossip 实现拜占庭鲁棒的去中心化学习

Byzantine-Robust Decentralized Learning via ClippedGossip

EPFL(洛桑联邦理工学院);UCB(加州大学伯克利分校)

Lie He, Sai Praneeth Karimireddy, Martin Jaggi

AI总结:

针对任意通信图上的拜占庭鲁棒去中心化训练,提出 ClippedGossip 算法,实现鲁棒共识与优化,并证明其在非凸目标下收敛至驻点邻域,且在多种攻击下表现良好。

摘要:

本文研究在任意通信图上进行拜占庭鲁棒去中心化训练这一具有挑战性的任务。不同于联邦学习中工作节点通过服务器通信,去中心化环境中的工作节点只能与其邻居通信,这使得达成共识并从协同训练中获益更加困难。为解决这些问题,我们提出用于拜占庭鲁棒共识与优化的 ClippedGossip 算法;在标准假设下,对于非凸目标函数,该算法首次被证明可收敛至驻点的一个 $O(δ_{\max}ζ^2/γ^2)$ 邻域。最后,我们展示了 ClippedGossip 在大量攻击下令人鼓舞的经验性能。

英文摘要:

In this paper, we study the challenging task of Byzantine-robust decentralized training on arbitrary communication graphs. Unlike federated learning where workers communicate through a server, workers in the decentralized environment can only talk to their neighbors, making it harder to reach consensus and benefit from collaborative training. To address these issues, we propose a ClippedGossip algorithm for Byzantine-robust consensus and optimization, which is the first to provably converge to a $O(δ_{\max}ζ^2/γ^2)$ neighborhood of the stationary point for non-convex objectives under standard assumptions. Finally, we demonstrate the encouraging empirical performance of ClippedGossip under a large number of attacks.

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

↑