AI Paper Atlas

Research map / Optimization / Distributed and compressed

Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descent

NeurIPS 2017 · Optimization › Distributed and compressed · approach: Local and asynchronous SGD · 422 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
Replace centralized parameter-server communication with neighbor communicationPSGD · Theoretical complexitycommunication complexity on the busiest node: O(n) -> O (Deg(network))Helped
Use decentralized neighbor averaging rather than centralized mini-batch aggregationPSGD · Theoretical complexitycomputational complexity: O( n/ϵ + 1/ϵ² ) -> O( n/ϵ + 1/ϵ² )No clear effect
Use D-PSGD instead of centralized SGD on a low-bandwidth or high-latency networkResNet-20 training · CIFAR-10wall-clock speed: up to 10× fasterHelped
Scale D-PSGD from one GPU to multiple GPUsD-PSGD · ResNet-20, 7 GPUsspeedup: up to 5× speed upHelped

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