.png){kind=icon}
Return
Distributed Stochastic Proximal Algorithm With Random Reshuffling for Nonsmooth Finite-Sum Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TNNLS.2022.3201711.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The nonsmooth finite-sum minimization is a fundamental problem in machine learning. This article develops a distributed stochastic proximal-gradient algorithm with random reshuffling to solve the finite-sum minimization over time-varying multiagent networks. The objective function is a sum of differentiable convex functions and nonsmooth regularization. Each agent in the network updates local variables by local information exchange and cooperates to seek an optimal solution. We prove that local variable estimates generated by the proposed algorithm achieve consensus and are attracted to a neighborhood of the optimal solution with an O((1/T)+(1/root T)) convergence rate, where T is the total number of iterations. Finally, some comparative simulations are provided to verify the convergence performance of the proposed algorithm.
Keywords:
Distributed optimization
proximal operator
random reshuffling (RR)
stochastic algorithm
time-varying graphs
Journal
IF:
8.9
Papers:
7.6K
Citations:
7.2W
Organization
View more organizations
Cited Papers
ShareSaveStability analysis of distributed convex optimization under persistent attacks: A hybrid systems approach.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAIShareSaveShareSaveShareSaveShareSaveConvergence analysis of distributed stochastic gradient descent with shufflingNEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAIShareSave View more