mlsanityData to 7 Oct 2026

Local SGD With a Communication Overhead Depending Only on the Number of Workers

arXiv 2006.02582 ↗First posted 3 Jun 2020math.OC cs.LG stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

We consider speeding up stochastic gradient descent (SGD) by parallelizing it across multiple workers. We assume the same data set is shared among n workers, who can take SGD steps and coordinate with a central server. Unfortunately, this could require a lot of communication between the workers and the server, which can dramatically reduce the gains from parallelism. The Local SGD method, proposed and analyzed in the earlier literature, suggests machines should make many local steps between such communications. While the initial analysis of Local SGD showed it needs Omega ( √T ) communications for T local gradient steps in order for the error to scale proportionately to 1/(nT), this has been successively improved in a string of papers, with the state-of-the-art requiring Omega left( n left( mbox polynomial in log (T) right) right) communications. In this paper, we give a new analysis of Local SGD. A consequence of our analysis is that Local SGD can achieve an error that scales as 1/(nT) with only a fixed number of communications independent of T: specifically, only Omega(n) communications are required.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 2; 2023: 5; 2024: 1; 2025: 1.

13 papers.

Sort: