返回
A Distributed Stochastic Proximal-Gradient Algorithm for Composite Optimization
DOI:10.1109/TCNS.2021.3065653.png)
摘要
En 中文
In this article, we consider distributed composite optimization problems involving a common non-smooth regularization term over an undirected and connected network. Inspired by vast applications of this kind of problem in large-scale machine learning, the local cost function of each node is further set as an average of a certain amount of local cost subfunctions. For this scenario, most existing solutions based on the proximal method tend to ignore the cost of gradient evaluations, which results in degraded performance. We instead develop a distributed stochastic proximal-gradient algorithm to tackle the problems by employing the local unbiased stochastic averaging gradient method. At each iteration, only a single local cost subfunction is demanded by each node to evaluate the gradient, then the average of the latest stochastic gradients serves as the approximation of the true local gradient. An explicit linear convergence rate of the proposed algorithm is established with constant dual step-sizes for strongly convex local cost subfunctions with Lipschitz-continuous gradients. Furthermore, it is shown that, in the smooth cases, our simplified analysis technique can be extended to some notable primal-dual domain algorithms, such as DSA, EXTRA, and DIGing. Numerical experiments are presented to confirm the theoretical findings.
Keyword:
Linear convergence
linear convergence distributed composite optimization
machine learning
proximal-gradient method
stochastic averaging gradient (SAG)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5
论文数:
1.7K
被引数:
5.8K
机构
引用论文
Effect of ω-3 fatty acids on rectal mucosal cell proliferation in subjects at risk for colon cancerΩ-3脂肪酸对结肠癌高危人群直肠黏膜细胞增殖的影响

