.png){kind=icon}
Return
A Primal-Dual SGD Algorithm for Distributed Nonconvex Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/JAS.2022.105554.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of n local cost functions by using local information exchange is considered. This problem is an important component of many machine learning techniques with data parallelism, such as deep learning and federated learning. We propose a distributed primal-dual stochastic gradient descent (SGD) algorithm, suitable for arbitrarily connected communication networks and any smooth (possibly nonconvex) cost functions. We show that the proposed algorithm achieves the linear speedup convergence rate O(1/root nT) for general nonconvex cost functions and the linear speedup convergence rate O(1/nT)) when the global cost function satisfies the Polyak-Lojasiewicz (P-L) condition, where T is the total number of iterations. We also show that the output of the proposed algorithm with constant parameters linearly converges to a neighborhood of a global optimum. We demonstrate through numerical experiments the efficiency of our algorithm in comparison with the baseline centralized SGD and recently proposed distributed SGD algorithms.
Keywords:
Distributed nonconvex optimization
linear speedup
Polyak-Lojasiewicz (P-L) condition
primal-dual algorithm
stochastic gradient descent
Journal
I
IF:
19.2
Papers:
1.4K
Citations:
1.1W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSavePhosphine-catalyzed dimerization of activated alkenes under ambient and high pressure conditions
PREAI
ShareSaveShareSaveShareSaveChallenges and opportunities at the crossroads of Environmental Sustainability and Economy research
PREAI
ShareSave View more