Pith. sign in

REVIEW 1 cited by

Bandwidth Reduction using Importance Weighted Pruning on Ring AllReduce

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 1901.01544 v1 pith:OSROFFLW submitted 2019-01-06 cs.LG cs.DCstat.ML

classification cs.LGcs.DCstat.ML
keywords gradientdifferentringbandwidthimportancetrainingaccuracyall-reduce
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

It is inevitable to train large deep learning models on a large-scale cluster equipped with accelerators system. Deep gradient compression would highly increase the bandwidth utilization and speed up the training process but hard to implement on ring structure. In this paper, we find that redundant gradient and gradient staleness has negative effect on training. We have observed that in different epoch and different steps, the neural networks focus on updating different layers and different parameters. In order to save more communication bandwidth and preserve the accuracy on ring structure, which break the restrict as the node increase, we propose a new algorithm to measure the importance of gradients on large-scale cluster implementing ring all-reduce based on the size of the ratio of parameter calculation gradient to parameter value. Our importance weighted pruning approach achieved 64X and 58.8X of gradient compression ratio on AlexNet and ResNet50 on ImageNet. Meanwhile, in order to maintain the sparseness of the gradient propagation, we randomly broadcast the index of important gradients on each node. While the remaining nodes are ready for the index gradient and perform all-reduce update. This would speed up the convergence of the model and preserve the training accuracy.

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. EnGN: A High-Throughput and Energy-Efficient Accelerator for Large Graph Neural Networks

    cs.DC 2019-08 conditional novelty 7.0 of 10

    EnGN, a simulated edge-centric GNN accelerator with ring-edge-reduce dataflow and degree-aware caching, claims 2.97x speedup and 6.2x energy efficiency over the HyGCN accelerator.

Pith tools