3 papers
math.OC2026
On the Linear Speedup of the Push-Pull Method for Decentralized Optimization over Digraphs
Liyuan Liang, Gan Luo, Kun Yuan
The linear speedup property is essential for demonstrating the advantage of distributed algorithms over their single-node counterparts. In this paper, we study the stochastic Push-…
math.OC2026
Decentralized Optimization over Time-Varying Row-Stochastic Digraphs
Liyuan Liang, Yilong Song, Kun Yuan
Decentralized optimization over directed graphs is essential for applications such as robotic swarms, sensor networks, and distributed learning. In many practical scenarios, the un…
math.OC2025
Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks
Liyuan Liang, Xinyi Chen, Gan Luo +1
A key challenge in decentralized optimization is determining the optimal convergence rate and designing algorithms to achieve it. While this problem has been extensively addressed…