arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2309.00520math.OCcs.LGcs.MAcs.SYeess.SY
收藏

网络上的鲁棒在线学习

Robust Online Learning over Networks

Digital Futures(数字未来机构);DIEE, University of Cagliari(卡利亚里大学 DIEE 学院)

Nicola Bastianello, Diego Deplano, Mauro Franceschelli, Karl H. Johansson

AI总结:

针对分布式学习中在线训练、异步计算、通信受限不可靠及本地计算不精确等挑战,提出基于ADMM的DOT-ADMM方法,证明其度量次正则下的线性收敛性,验证了其鲁棒性优势。

摘要:

近期多智能体网络的部署使得学习问题的分布式求解成为可能,智能体无需共享本地私有数据即可协作训练全局模型。本工作专门针对分布式学习固有的若干普遍挑战:(i)在线训练,即本地数据随时间变化;(ii)智能体异步计算;(iii)不可靠且受限的通信;(iv)不精确的本地计算。为应对这些挑战,我们采用交替方向乘子法(ADMM)的分布式算子理论(Distributed Operator Theoretical, DOT)版本,将其称为“DOT-ADMM”。我们证明,若DOT-ADMM算子满足度量次正则性,则对于一大类(不一定是强凸的)凸学习问题,它会以线性速率收敛到时变最优解的有界邻域,并刻画了该邻域如何依赖于上述(i)至(iv)项因素。我们首先推导了一个易于验证的条件以确保算子的度量次正则性,随后给出了线性回归与逻辑回归问题的教学示例。我们通过数值模拟验证了理论分析,将DOT-ADMM与其他现有最优算法进行对比,结果表明只有所提出的算法对(i)至(iv)项挑战表现出鲁棒性。

英文摘要:

The recent deployment of multi-agent networks has enabled the distributed solution of learning problems, where agents cooperate to train a global model without sharing their local, private data. This work specifically targets some prevalent challenges inherent to distributed learning: (i) online training, i.e., the local data change over time; (ii) asynchronous agent computations; (iii) unreliable and limited communications; and (iv) inexact local computations. To tackle these challenges, we apply the Distributed Operator Theoretical (DOT) version of the Alternating Direction Method of Multipliers (ADMM), which we call "DOT-ADMM". We prove that if the DOT-ADMM operator is metric subregular, then it converges with a linear rate for a large class of (not necessarily strongly) convex learning problems toward a bounded neighborhood of the optimal time-varying solution, and characterize how such neighborhood depends on (i)-(iv). We first derive an easy-to-verify condition for ensuring the metric subregularity of an operator, followed by tutorial examples on linear and logistic regression problems. We corroborate the theoretical analysis with numerical simulations comparing DOT-ADMM with other state-of-the-art algorithms, showing that only the proposed algorithm exhibits robustness to (i)-(iv).

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

↑