atlas

Research map / Optimization / Distributed and compressed

Gradient Sparsification for Communication-Efficient Distributed Optimization

NeurIPS 2018 · Optimization › Distributed and compressed · approach: Communication complexity theory · 205 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 magnitude-proportional gradient sparsification instead of uniform coordinate sampling at matched sparsityDistributed SGD · Synthetic ℓ2-regularized logistic regressionobjective suboptimality versus data passesHelped
Use magnitude-proportional gradient sparsification instead of uniform coordinate sampling at matched sparsityDistributed SVRG · Synthetic ℓ2-regularized logistic regressionobjective suboptimality versus data passesHelped
Use gradient sparsification instead of QSGDDistributed SGD · Synthetic ℓ2-regularized logistic regressionobjective suboptimality versus communication costMixed
Sparsify gradients with κ = 0.004ADAM with CNN · CIFAR-10objective function versus communication costHelped
Use gradient sparsification in place of dense updatesAsynchronous multi-thread SGD · Synthetic SVMtraining speedHelped

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