.png){kind=icon}
返回
S-DIGing: A Stochastic Gradient Tracking Algorithm for Distributed Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TETCI.2020.3017242.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we study convex optimization problems where agents of a network cooperatively minimize the global objective function which consists of multiple local objective functions. The intention of this work is to solve large-scale optimization problems where the local objective function is complicated, and numerous. Different from most of the existing works, the local objective function of each agent is presented as the average of finite instantaneous functions. Integrating the gradient tracking algorithm with stochastic averaging gradient technology, a distributed stochastic gradient tracking (termed as S-DIGing) algorithm is proposed. At each time instant, only one randomly selected gradient of an instantaneous function is computed, and applied to approximate the local batch gradient for each agent. Based on a novel primal-dual interpretation of the S-DIGing algorithm, it is shown that the S-DIGing algorithm linearly converges to the global optimal solution when step-size do not exceed an explicit upper bound, and the instantaneous functions are strongly convex with Lipschitz continuous gradients. Numerical experiments are presented to demonstrate the practicability of the S-DIGing algorithm, and correctness of the theoretical results.
Keyword:
Optimization
Convergence
Linear programming
Approximation algorithms
Stochastic processes
Machine learning algorithms
Convex functions
Distributed optimization
gradient tracking
stochastic averaging gradient
multi-agent systems
linear convergence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
6.5
论文数:
1.4K
被引数:
4.5K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容