atlas

Research map / Optimization / Distributed and compressed

Local SGD Converges Fast and Communicates Little

ICLR 2019 · Optimization › Distributed and compressed · approach: Local and asynchronous SGD · 208 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use local SGD with synchronization interval H=O(√(T/(Kb))) instead of synchronizing every iterationLocal SGD · Strongly convex finite-sum optimizationconvergence rate: O(1/(KTb))No clear effect
Use local SGD with synchronization interval H=O(√(T/(Kb))) instead of synchronizing every iterationLocal SGD · Strongly convex finite-sum optimizationcommunication rounds: O(√(T/(Kb)))Helped
Increase the number of workers KLocal SGD · Strongly convex finite-sum optimizationconvergence rate: O(1/(KTb))Helped
Increase the local mini-batch size bLocal SGD · Strongly convex finite-sum optimizationconvergence rate: O(1/(KTb))Helped
Set the synchronization interval to H=T (one-shot averaging)Local SGD · Strongly convex finite-sum optimizationconvergence rateHurt
Allow asynchronous synchronization with delay τ and H+τ=O(√(T/K))Asynchronous local SGD · Strongly convex finite-sum optimizationconvergence rate: O(G^2/(KT))No clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy