no code implementations • NeurIPS 2020 • Jiawei Zhang, Peijun Xiao, Ruoyu Sun, Zhi-Quan Luo
We prove that the stabilized GDA algorithm can achieve an $O(1/\epsilon^2)$ iteration complexity for minimizing the pointwise maximum of a finite collection of nonconvex functions.
no code implementations • 19 Jun 2020 • Tian Ye, Peijun Xiao, Ruoyu Sun
In the infrequent communication setting, DEED combined with Federated averaging requires a smaller total number of bits than Federated Averaging.
no code implementations • 10 Oct 2019 • Peijun Xiao, Zhisheng Xiao, Ruoyu Sun
Recently, Coordinate Descent (CD) with cyclic order was shown to be $O(n^2)$ times slower than randomized versions in the worst-case.