.png){kind=icon}
.png){kind=icon}
Return
Distributed Adaptive Gradient Algorithm With Gradient Tracking for Stochastic Nonconvex Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2024.3380710.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article considers a distributed stochastic nonconvex optimization problem, where the nodes in a network cooperatively minimize a sum of $L$-smooth local cost functions with sparse gradients. By adaptively adjusting the stepsizes according to the historical (possibly sparse) gradients, a distributed adaptive gradient algorithm is proposed, in which a gradient tracking estimator is used to handle the heterogeneity between different local cost functions. We establish an upper bound on the optimality gap, which indicates that our proposed algorithm can reach a first-order stationary solution dependent on the upper bound on the variance of the stochastic gradients. Finally, numerical examples are presented to illustrate the effectiveness of the algorithm.
Keywords:
Cost function
Vectors
Upper bound
Radio frequency
Convex functions
Sparse matrices
Robots
Adaptive gradient algorithm
distributed nonconvex optimization
gradient tracking (GT)
stochastic gradient
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W