arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.03092math.OC
收藏

面向拜占庭联邦学习的弹性双时间尺度局部随机梯度下降

Resilient Two-Time-Scale Local Stochastic Gradient Descent for Byzantine Federated Learning

Amit Dutta, Thinh T. Doan

AI总结:

针对拜占庭联邦学习中局部 SGD 只能近似求解的问题,提出双时间尺度弹性新变体,证明其在强凸与非凸情形下均精确收敛且达到 $\mathcal{O}(1/k)$ 最优速率。

摘要:

我们研究局部随机梯度下降方法,用于在由多个智能体组成、并通过中心化协调器间接通信的网络上求解联邦优化问题。我们关注拜占庭设定,其中存在一个由 $f$ 个恶意智能体组成的子集,这些智能体能够观察整个网络,并向协调器发送任意数值,以破坏其他非故障智能体的性能。非故障智能体的目标是在拜占庭智能体存在的情况下,协同计算其各自局部函数的优化器。在这一设定下,已有工作表明,由于拜占庭智能体的影响,局部随机梯度下降方法只能返回期望解的近似值。该方法能否找到精确解仍是一个开放问题。本文中,我们将通过提出局部随机梯度下降方法的一种新变体来解决这一开放问题。在现有工作所考虑的类似条件下,我们将证明所提出的方法能够精确收敛到期望解。我们将提供理论结果来刻画该方法的收敛性质,特别是,在强凸和非凸设定下,所提出的方法均以最优速率 $\mathcal{O}(1/k)$ 收敛,其中 $k$ 为迭代次数。最后,我们将给出若干仿真结果,以说明我们的理论结论。

英文摘要:

We study local stochastic gradient descent methods for solving federated optimization over a network of agents communicating indirectly through a centralized coordinator. We are interested in the Byzantine setting where there is a subset of $f$ malicious agents that could observe the entire network and send arbitrary values to the coordinator to disrupt the performance of other non-faulty agents. The objective of the non-faulty agents is to collaboratively compute the optimizer of their respective local functions under the presence of Byzantine agents. In this setting, prior works show that the local stochastic gradient descent method can only return an approximate of the desired solutions due to the impacts of Byzantine agents. Whether this method can find an exact solution remains an open question. In this paper, we will address this open question by proposing a new variant of the local stochastic gradient descent method. Under similar conditions that are considered in the existing works, we will show that the proposed method converges exactly to the desired solutions. We will provide theoretical results to characterize the convergence properties of our method, in particular, the proposed method convergences at an optimal rate $\mathcal{O}(1/k)$ in both strongly convex and non-convex settings, where $k$ is the number of iterations. Finally, we will present a number of simulations to illustrate our theoretical results.

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

↑