EventGraD: Event-Triggered Communication in Parallel Machine Learning
Not on the map. Why?
Abstract (arXiv)
Communication in parallel systems imposes significant overhead which often turns out to be a bottleneck in parallel machine learning. To relieve some of this overhead, in this paper, we present EventGraD - an algorithm with event-triggered communication for stochastic gradient descent in parallel machine learning. The main idea of this algorithm is to modify the requirement of communication at every iteration in standard implementations of stochastic gradient descent in parallel machine learning to communicating only when necessary at certain iterations. We provide theoretical analysis of convergence of our proposed algorithm. We also implement the proposed algorithm for data-parallel training of a popular residual neural network used for training the CIFAR-10 dataset and show that EventGraD can reduce the communication load by up to 60% while retaining the same level of accuracy. In addition, EventGraD can be combined with other approaches such as Top-K sparsification to decrease communication further while maintaining accuracy.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 56 references that are in the map. First posted on arXiv 12 Mar 2021.
Builds on
23 of 56 references.
References · 23
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2017Mixed Precision Trainingcited by 1,135
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 496
- 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
- 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 415
- 2015Deep Learning with Limited Numerical Precisioncited by 368
- 2018The Convergence of Sparsified Gradient Methodscited by 228
- 2019Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computationscited by 179
- 2013On the Convergence of Decentralized Gradient Descentcited by 158
- 2018Demystifying Parallel and Distributed Deep Learning: An In-Depth Concurrency Analysiscited by 154
- 2015Asynchronous Parallel Stochastic Gradient for Nonconvex Optimizationcited by 115
11 more
- 2019Communication-Efficient Federated Deep Learning with Asynchronous Model Update and Temporally Weighted Aggregationcited by 99
- 2014Deep learning with Elastic Averaging SGDcited by 90
- 2020Ternary Compression for Communication-Efficient Federated Learningcited by 57
- 2018SparCML: High-Performance Sparse Communication for Machine Learningcited by 34
- 2016Gossip training for deep learningcited by 33
- 2018Pipe-SGD: A Decentralized Pipelined SGD Framework for Distributed Deep Net Trainingcited by 28
- 2018GossipGraD: Scalable Deep Learning using Gossip Communication based Asynchronous Gradient Descentcited by 19
- 2016How to scale distributed deep learning?cited by 16
- 2017Event-Triggered Communication and Control of Networked Systems for Multi-Agent Consensuscited by 5
- 2019Distributed Deep Learning with Event-Triggered Communicationcited by 5
- 2014Distributed linear programming with event-triggered communicationcited by 1
Built on by
Citing papers per year: 2022: 1.
1 paper.