activity
20162023
most citedA Sharp Estimate on the Transient Time of Distributed Stochastic Gradient Descent

33 citations · 113 across the 20 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

math.OC2021

Distributed Random Reshuffling over Networks

Kun Huang, Xiao Li, Andre Milzarek +2

In this paper, we consider distributed optimization problems where agents, each possessing a local cost function, collaboratively minimize the average of the local cost functio…

math.OC2021★ 1 cited

Optimal Gradient Tracking for Decentralized Optimization

Zhuoqing Song, Lei Shi, Shi Pu +1

In this paper, we focus on solving the decentralized optimization problem of minimizing the sum of objective functions over a multi-agent network. The agents are embedded in an…

math.OC2021★ 2 cited

Provably Accelerated Decentralized Gradient Method Over Unbalanced Directed Graphs

Zhuoqing Song, Lei Shi, Shi Pu +1

We consider the decentralized optimization problem, where a network of agents aims to collaboratively minimize the average of their individual smooth and convex objective funct…

math.OC2021★ 28 cited

Compressed Gradient Tracking for Decentralized Optimization Over General Directed Networks

Zhuoqing Song, Lei Shi, Shi Pu +1

In this paper, we propose two communication efficient decentralized optimization algorithms over a general directed multi-agent network. The first algorithm, termed Compressed Push…

math.OC2021

Compressed Gradient Tracking Methods for Decentralized Optimization with Linear Convergence

Yiwei Liao, Zhuorui Li, Kun Huang +1

Communication compression techniques are of growing interests for solving the decentralized optimization problem under limited communication, where the global objective is to minim…