arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.02596math.OCcs.LG
收藏

面向去中心化优化的时变图上加速梯度跟踪

Accelerated Gradient Tracking over Time-varying Graphs for Decentralized Optimization

Institute of Robotics and Automatic Information Systems, College of Artificial Intelligence, Nankai University(南开大学人工智能学院机器人与自动信息系统研究所);State Key Lab of General AI, School of Intelligence Science and Technology, Peking University(北京大学智能科学与技术学院通用人工智能省部共建国家重点实验室)

Huan Li, Zhouchen Lin

AI总结:

本文将单循环加速梯度跟踪扩展到时变图去中心化优化,给出非强凸与强凸情形的改进迭代复杂度,并通过多重一致性和 Chebyshev 加速使静态网络复杂度匹配下界。

摘要:

在现代机器学习中,随着海量数据存储于数百万移动设备上(例如联邦学习),基于时变图的去中心化优化已日益普遍。本文重新审视了被广泛使用的加速梯度跟踪方法,并将其扩展到时变图。我们证明,在时变图上,当问题分别为非强凸和强凸时,实用的单循环加速梯度跟踪达到 ε-最优解分别需要 $O((\fracγ{1-σ_γ})^2\sqrt{\frac{L}ε})$ 和 $O((\fracγ{1-σ_γ})^{1.5}\sqrt{\frac{L}μ}\log\frac{1}ε)$ 次迭代,其中 $γ$ 和 $σ_γ$ 是表征网络连通性的两个常用常数,$L$ 和 $μ$ 分别为平滑性常数和强凸性常数,一次迭代对应一次梯度预言机调用和一轮通信。我们的收敛速率显著优于 $O(\frac{1}{ε^{5/7}})$ 与 $O((\frac{L}μ)^{5/7}\frac{1}{(1-σ)^{1.5}}\log\frac{1}ε)$;这两个结果是在加速梯度跟踪的原始文献中仅针对静态图证明的,并且当网络时不变时,$\fracγ{1-σ_γ}$ 等于 $\frac{1}{1-σ}$。当与多重一致性子程序结合时,梯度预言机复杂度和通信轮复杂度对网络连通性常数的依赖可分别进一步改进至 $O(1)$ 和 $O(\fracγ{1-σ_γ})$。当网络为静态时,通过采用 Chebyshev 加速,对于非强凸和强凸问题,我们的复杂度都与下界精确匹配,且不隐藏任何多对数因子。

英文摘要:

Decentralized optimization over time-varying graphs has been increasingly common in modern machine learning with massive data stored on millions of mobile devices, such as in federated learning. This paper revisits the widely used accelerated gradient tracking and extends it to time-varying graphs. We prove that the practical single loop accelerated gradient tracking needs $O((\fracγ{1-σ_γ})^2\sqrt{\frac{L}ε})$ and $O((\fracγ{1-σ_γ})^{1.5}\sqrt{\frac{L}μ}\log\frac{1}ε)$ iterations to reach an $ε$-optimal solution over time-varying graphs when the problems are nonstrongly convex and strongly convex, respectively, where $γ$ and $σ_γ$ are two common constants charactering the network connectivity, $L$ and $μ$ are the smoothness and strong convexity constants, respectively, and one iteration corresponds to one gradient oracle call and one communication round. Our convergence rates improve significantly over the ones of $O(\frac{1}{ε^{5/7}})$ and $O((\frac{L}μ)^{5/7}\frac{1}{(1-σ)^{1.5}}\log\frac{1}ε)$, respectively, which were proved in the original literature of accelerated gradient tracking only for static graphs, where $\fracγ{1-σ_γ}$ equals $\frac{1}{1-σ}$ when the network is time-invariant. When combining with a multiple consensus subroutine, the dependence on the network connectivity constants can be further improved to $O(1)$ and $O(\fracγ{1-σ_γ})$ for the gradient oracle and communication round complexities, respectively. When the network is static, by employing the Chebyshev acceleration, our complexities exactly match the lower bounds without hiding any poly-logarithmic factor for both nonstrongly convex and strongly convex problems.

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

↑