Communication-Efficient Variance-Reduced Decentralized Stochastic Optimization Over Time-Varying Directed Graphs

In this article, we consider the problem of decentralized optimization over time-varying directed networks. The network nodes can access only their local objectives, and aim to collaboratively minimize a global function by exchanging messages with their neighbors. Leveraging sparsification, gradient tracking, and variance reduction, we propose a novel communication-efficient decentralized optimization scheme that is suitable for resource-constrained time-varying directed networks. We prove that in the case of smooth and strongly convex objective functions, the proposed scheme achieves an accelerated linear convergence rate. To our knowledge, this is the first decentralized optimization framework for time-varying directed networks that achieves such a convergence rate and applies to settings requiring sparsified communication. Experimental results on both synthetic and real datasets verify the theoretical results and demonstrate the efficacy of the proposed scheme.

Automated summary

In this article, a communication-efficient decentralized optimization scheme is proposed for time-varying directed networks using sparsification, gradient tracking, and variance reduction. The scheme achieves an accelerated linear convergence rate for smooth and strongly convex objective functions, making it the first of its kind for time-varying directed networks. Experimental results on synthetic and real datasets demonstrate the efficacy of the proposed scheme.