atlas

Research map / Optimization / Distributed and compressed

Communication-efficient Distributed Learning for Large Batch Optimization

ICML 2022 · Optimization › Distributed and compressed · approach: Gradient quantization and sparsification

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
joint sparsification of gradient computation (skip computing dropped blocks) on top of communication sparsificationJointSpar-LARS · MNIST, SVHN, Fashion-MNIST, CIFAR10, CIFAR100wall-clock speedup to target accuracy vs baselines: close to 2x in most cases, up to 4x; as low as 1.1x for FullPrecision on SVHNHelped
bandit-based distribution learning for block selection (vs. full-gradient compression baselines)JointSpar-LARS · ImageNet AlexNet top-5 accuracy vs timeconvergence speed in wall-clock timeHelped
per-machine computation share under large batch: full-gradient compression keeps compute dominantTernGrad and GSPAR compression baselines · ImageNet AlexNet, 8 machinestcomp/tcomm per epoch: compute time 1205 and 1079 vs SGD 1021; comm reduced to 446 and 519 from 1156No 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