Pith. sign in

REVIEW 1 cited by

Variance-based Gradient Compression for Efficient Distributed Deep Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1802.06058 v2 pith:SZQIXLNZ submitted 2018-02-16 cs.LG

classification cs.LG
keywords deepdistributedgradientcommunicationcompressioncostefficientlearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Due to the substantial computational cost, training state-of-the-art deep neural networks for large-scale datasets often requires distributed training using multiple computation workers. However, by nature, workers need to frequently communicate gradients, causing severe bottlenecks, especially on lower bandwidth connections. A few methods have been proposed to compress gradient for efficient communication, but they either suffer a low compression ratio or significantly harm the resulting model accuracy, particularly when applied to convolutional neural networks. To address these issues, we propose a method to reduce the communication overhead of distributed deep learning. Our key observation is that gradient updates can be delayed until an unambiguous (high amplitude, low variance) gradient has been calculated. We also present an efficient algorithm to compute the variance with negligible additional cost. We experimentally show that our method can achieve very high compression ratio while maintaining the result model accuracy. We also analyze the efficiency using computation and communication cost models and provide the evidence that this method enables distributed deep learning for many scenarios with commodity environments.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Lossy Compression for Sparse Aggregation

    cs.IT 2026-06 unverdicted novelty 6.0 of 10

    A covering-plus-sketching scheme plus f-divergence lower bound characterizes the communication-accuracy tradeoff for sparse aggregation, tight on binary alphabets but with a gap on general alphabets.

Pith tools