Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization

Understand

We consider the task of decentralized minimization of the sum of smooth strongly convex functions stored across the nodes of a network.

• For this problem, lower bounds on the number of gradient computations and the number of communication rounds required to achieve $\varepsilon$ accuracy have recently been proven.
• We propose two new algorithms for this decentralized optimization problem and equip them with complexity guarantees.
• We show that our first method is optimal both in terms of the number of communication rounds and in terms of the number of gradient computations.