1 Introduction
Convolutional neural networks (CNN) such as VGG simonyan2014very and ResNet he2016deep can achieve unprecedented performance on many practical applications like speech recognition abdel2012applying ; abdel2014convolutional , text processing miao2016neural ; johnson2014effective , and image classification on very large datasets like CIFAR100 AlexCIFAR2009
and ImageNet
deng2009imagenet. Due to the large dataset size, CNN training is widely implemented using distributed methods such as dataparallel stochastic gradient descent (SGD)
mcdonald2009efficient ; zinkevich2010parallelized ; mcdonald2010distributed ; gemulla2011large ; zhuang2013fast ; MuLiOSDI2014 ; MuLiNIPS2014 ; IandolaCVPR2016 , where gradients computed by distributed nodes are summed after every iteration to update the CNN model of every node^{1}^{1}1 We focus on synchronized training. Our compression technique could be applied to asynchronous systems where the model at different nodes may be updated differently langford2009slow ; recht2011hogwild ; agarwal2011distributed ; dean2012large ; SSP ; ADPSGD . However, this gradient aggregation can dramatically hinder the expansion of such systems, for it incurs significant communication costs, and will become the system bottleneck when communication is slow.To improve gradient aggregation efficiency, two main approaches have been proposed in the literature, namely gradient compression and parallel aggregation. Gradient compression aims at reducing the number of bits used to describe the gradients. Popular methods include gradient scalar quantization (lossy) seide20141 ; alistarh2016qsgd ; dryden2016communication ; wen2017terngrad ; zhou2016dorefa and sparsity coding (lossless) alistarh2016qsgd ; lin2017deep . Parallel aggregation, on the other hand, aims at minimizing communication congestion by shifting from centralized aggregation at a parameter server to distributed methods such as ring allreduce (RAR) patarasuk2009bandwidth ; ThakurRG05 ; goyal2017accurate ; baidu_research . As demonstrated in Fig. 1, RAR places all nodes in a logical ring, and then circulates different segments of the gradient vector through the nodes simultaneously. Upon the reception of a segment, a node will add to it the same segment of its own, and then send the sum to the next node in the ring. Once a segment has been circulated through all nodes, it becomes a fully aggregated gradient vector. Then, another round of circulation will make it available at all nodes.
Due to the complementary nature of the above two approaches, one may naturally aim at combining them to unleash their gains simultaneously. However, there lies a critical problem: the compressed gradients cannot be directly summed without first decompressing them. For example, summing two scalar quantized gradients will incur overflow due to limited quantization levels. And, summing two sparsity coded descriptions is an undefined operation. An additional problem for sparsity based compression is that the gradient density may increase rapidly during RAR lin2017deep , which may incur exploding communication costs.
The inability to directly aggregate compressed gradients could incur hefty compressionrelated overheads. In every step of RAR, every node will have to decompress the downloaded gradient segment before adding its own corresponding uncompressed gradient segment. The nodes will then compress the sum and communicate it to the next node in the ring. Consequently, download and compression processes cannot be parallelized (as illustrated in Fig. 2(a)). Moreover, the same gradients will be repeatedly compressed/decompressed at every single node.
In order to leverage both gradient compression and parallel aggregation, the compression function should be commutable with the gradient aggregation. Mathematically, let be the compression function on gradient vector of each node, then the following equality must hold:
(1) 
where is the number of nodes. The LHS of (1) enables compressed domain gradient aggregation, namely, direct summation of compressed gradients. Such a compression function will allow the parallelization of compression and RAR communications, so that compression time can be masked by communication time (as illustrated in Fig. 2(b)). The RHS of (1) indicates that decompression is only needed once  after the compressed gradients are fully aggregated.
Contributions We propose GradiVeQ (Gradient Vector Quantizer), a novel gradient compression technique that can significantly reduce the communication load in distributed CNN training. GradiVeQ is the first method that leverages both gradient compression and parallel aggregation by employing a vector compression technique that commutes with gradient aggregation (i.e., satisfies (1)), hence enabling compressed domain gradient aggregation.
Intuition and Motivational Data: At the core of GradiVeQ is a linear compressor that uses principal component analysis (PCA) to exploit the linear correlation between the gradients for gradient dimension reduction. Our development of GradiVeQ is rooted from the following experimental observations on the strong linear correlation between gradients in CNN:

Linear correlation: We flatten the gradients to a vector representation in a special way such that adjacent gradients could have linear correlation. As shown in Fig. 3(a), we place together the gradients located at identical coordinates across all the filters of the same convolutional layer. One of the foundational intuitions behind such a gradient vector representation is that these gradient elements are generated from the same input datum, such as a pixel value in an image, or an output from the last layer. Hence the aggregated gradients could show strong linear correlation across training iterations. This linear correlation will allow us to use PCA to compute a linear compressor for each gradient vector.
For example, we record the value of the first 3 gradients of layer1 of ResNet32 for 150 iterations during CiFAR100 training, and plot them as the 150 blue points in Fig. 4(a). As described in the figure caption, a strong linear correlation can be observed between the 3 gradients, which allows us to compress them into 2 gradients with negligible loss.

Spatial domain consistency: Another interesting observation is that, within a () convolutional layer, the large gradient vector can be sliced at the granularity of multiples and these slices show strong similarity in their linear correlation. This correlation is best demonstrated by the low compression loss of using the compressor of one slice to compress the other slices. For example, Fig. 5 shows that, in a ()CNN layer, the compression loss (, where is the decompressed gradient vector) drops dramatically at slice sizes of 256, 512 and so on (multiple of = 256). Thus, it is possible to just perform PCA on one gradient slice and then apply the compressor to other slices, which will make PCA overhead negligible.

Time domain invariance: Finally, we also note that the observed linear correlation evolves slowly over iterations, which is likely due to the steady gradient directions and step size under reasonable learning rates. Hence, we can invest a fraction of the compute resource during a set of training iterations on uncompressed aggregations to perform PCA, and use the resulting PCA compressors to compress the successor iterations.
3D scatter plot of the value of 3 adjacent gradients from 150 iterations (the 150 blue points in (a)), and projections to different 2D planes. A strong linear correlation is observed. After proper centralization and rotation, most of the variance/information is captured by the value of gradient
and (the 2D green points at the bottom plane of (b)), indicating a compression ratio of 3/2=1.5.Built upon these observations, we develop a practical implementation of GradiVeQ, where gradient compression and RAR communications are fully parallelized. Experiments on ResNet with CIFAR100 show that GradiVeQ can compress the gradient by 8 times, and reduce the wallclock gradient aggregation time by over , which translates to a 46% reduction on the endtoend training time in a system where communication contributes to 60% of the time. We also note that under the same compression ratio of 8, scalar quantizers such as 4bit QSGD alistarh2016qsgd , while effective over baseline RAR, does not achieve the same level of performance. QSGD has the requirement that compressed gradient vectors must first be uncompressed and aggregated thereby preventing compressed domain aggregation, which in turn prevents compression and communication parallelization.
2 Description of GradiVeQ
In this section, we describe the core compression and aggregation techniques applied in GradiVeQ. The next section presents the details of system implementation, including system parameter selection.
We consider a distributed system that uses nodes and a certain dataset (e.g., CIFAR100 AlexCIFAR2009 or ImageNet deng2009imagenet ) to train a CNN model that has parameters in its convolutional layers. We use to represent their weights. ^{2}^{2}2GradiVeQ is not applied to the gradient of other parameters such as those from fully connected layers.. In the th () training iteration, each node () trains a different subset of the dataset to compute a length gradient vector . These gradient vectors are aggregated into:
(2) 
which updates the model of every node as , where is the learning rate.
During the training phase, each convolutional layer uses the same set of filters repeatedly on sliding window over the training data. This motivates us to pack gradients into a vector format carefully to unleash linear correlation between adjacent gradients in . As explained in the previous section, for a convolutional layer with filters, every collocated gradients of the filters are placed together in . This group assignment is first applied to gradients along the filter depth, then width, and finally height (Fig. 3(a)).
GradiVeQ aims to compress every slice of adjacent gradients in separately, where is called the slice size. Let be the th () slice, GradiVeQ will compress it into using a function as follows:
(3) 
where is a linear compressor with , and is a length whitening vector. After compression, the dimension of the slice is reduced to , indicating a compression ratio of .
The compressed slices from different nodes can then be directly aggregated into:
(4) 
which indicates that GradiVeQ compression is commutable with aggregation. According to (4), a single decompression operation is applied to to obtain a lossy version of :
(5) 
which will be used to update the corresponding model parameters.
In this work we rely on PCA to compute the compressor and the whitening vector . More specifically, for each slice, all nodes periodically invest the same out of CNN training iterations on uncompressed gradient aggregation. After this, every node will have samples of slice, say, . The whitening vector is simply the average of these samples. Every node then computes the covariance matrix of the gradients using these
samples, and applies singular value decomposition (SVD) to obtain the eigen matrix
and eigen vector of . The compressor is simply the first columns of , corresponding to the most significant eigen values in the eigen vector . The obtained and are then used to compress of every node in the next training iterations.Due to the commutability, GradiVeQ gradient compression can be parallelized with RAR as shown in Algorithm 1, so that compression time can be hidden behind communication time. We place all the nodes in a logical ring, where each node can only send data to its immediate successor. We also partition every gradient vector into equal segments, each containing several gradient slices. The aggregation consists of two rounds: a compression round and a decompression round. To initiate, each node will only compress the gradient slices in the th segment, and then send the compressed segment to its successor. Then, in every step of the compression round, every node will simultaneously 1) download a compressed segment from its predecessor, and 2) compress the same segment of its own. Once both are completed, it will sum the two compressed segments and send the result to its successor. After steps, the compression round is completed, and every node will have a different completely aggregated compressed segment. Then in each step of the decompression round, every node will simultaneously 1) download a new compressed segment from its predecessor, and 2) decompress its last downloaded compressed segment. Note that after decompression, the compressed segment must be kept for the successor to download. The original (i.e., uncompressed) RAR is a special case of Algorithm 1, where compression and decompression operations are skipped.
3 Implementation Details of GradiVeQ
System Overview: At the beginning of the training, we will first apply a short warmup phase to stabilize the model, which is common in the literature (see, e.g., lin2017deep ). Then, we will iterate between iterations of uncompressed aggregations and iterations of compressed aggregations for every gradient slice. Recall that PCA needs some initial gradient data to compute the values for the linear compressor. Hence, the iterations of uncompressed data is used to generate the compressor which is then followed by iterations of compressed aggregation. Since the linear correlation drifts slowly, the compression error is curtailed by periodically regenerating the updated values for the linear compressor. Hence, the interspersion of an uncompressed aggregation with compressed aggregation GradiVeQ minimizes any compression related losses.
Computing from a large gradient vector is a computationally intensive task. To minimize the PCA computation overhead, GradiVeQ exploits the spatial domain consistency of gradient correlation. For every consecutive (called the compressor reuse factor) slices in the same convolutional layer, GradiVeQ computes a single PCA compressor (with the slice index omitted) using the first slice, and then uses the resulting to compress the remaining slices. We note that, although computing does not require the values from the remaining slices, they should still be aggregated in an uncompressed way as the first slice, so that the parameters associated with all slices can evolve in the same way. The composition of training iterations is demonstrated in Fig. 6.
In order to reduce the bandwidth inefficiency brought by the iterations that are not GradiVeQ compressed, we will apply a scalar quantization technique such as QSGD alistarh2016qsgd to these iterations, and communicate the quantized gradients.
Parameter Selection: We briefly describe how the various parameters used in GradiVeQ are chosen. Slice size : We set to be a multiple of for a convolutional layer that has filters with a depth of , as the compression loss is minimized at this granularity as demonstrated in Fig. 5. In addition, should be selected to balance the compression ratio and PCA complexity. Increasing to higher multiples of may capture more linear correlations for higher compression ratio, but will increase the computational and storage costs, as SVD is applied to a covariance matrix. For example, for a convolutional layer, a good choice of would be .
Compressor reuse factor : A larger implies that the PCA compressor computed from a single slice of size is reused across many consecutive slices of the gradient vector, but with a potentially higher compression loss. We experimented with different values of and found that the accuracy degradation of using (i.e., one compressor per layer) is less than 1% compared to the original uncompressed benchmark. Therefore, finding the compressor for a single slice in a convolutional layer is sufficient.
Compressor dimension : the value of is determined by the maximum compression loss we can afford. This loss can be easily projected using the eigen vector . Let be a loss threshold, we find the minimum such that:
(6) 
The corresponding will guarantee a compression loss of at most to the sample slices of size in each layer and, based on our spatial correlation observation the from one slice also works well for other slices in the gradient vector.
Number of iterations with uncompressed aggregation : This value could either be tuned as a hyperparameter, or be determined with uncompressed RAR: namely perform PCA on the collected sample slices of the gradients to find out how many samples will be needed to get a stable value of . We used the later approach and determined that samples are sufficient, hence of 100 iterations is used.
Number of compressed iterations : This value could also be tuned as a hyperparameter, or be determined in the runtime by letting nodes to perform local decompression to monitor the local compression loss, which is defined as:
(7) 
When the majority of nodes experience large loss, we stop compression, and resume training with uncompressed aggregations to compute new compressors. Again, we currently use the latter approach and determine to be 400 iterations.
Computation Complexity: GradiVeQ has two main operations for each gradient slice: (a) one SVD over samples of the aggregated slice for every iterations, and (b) two lowdimensional matrix multiplications per iteration per node to compress/decompress the slice. Our gradient flattening and slicing (Figure 3) allows the compressor calculated from one slice to be reused by all the slices in the same layer, offering drastically amortized SVD complexity. On the other hand, the operations associated with (b) are of lowcomplexity, and can be completely hidden behind the RAR communication time (Figure 2) due to GradiVeQ’s linearity. Thus, GradiVeQ will not increase the training time.
4 Experiments
We apply GradiVeQ to train an image classifier using ResNet32 from the data set CIFAR100 under a 6node distributed computing system. The system is implemented under both a CPU cluster (local) and a GPU cluster (Google cloud). The purpose is to evaluate the gain of GradiVeQ under different levels of communication bottleneck. In the local CPU cluster, each node is equipped with 2 TenCore Intel Xeon Processor (E52630 v4), which is equivalent to 40 hardware threads. We observe that without applying any gradient compression techniques, gradient communication and aggregation overheads account for
of the endtoend training time, which is consistent with prior works alistarh2016qsgd . In the GPU setup, each node has an NVIDIA Tesla K80 GPU. The increased compute capability from the GPUs magnifies the communication and aggregation overheads, which occupies of the endtoend training time when no compression techniques are used.We choose as our loss threshold. We set for each convolutional layer, which means that we only compute and use one compressor for each layer, so that the PCA overhead is minimized. Our experimental results indicate that yields no compression loss. We spend the first iterations on warmup, and then periodically invest iterations for PCA sampling, followed by iterations of GradiVeQcompressed gradient aggregations. With these parameter selection, we observe an average compression ratio of . The performance metrics we are interested in include wallclock endtoend training time and test accuracy. We compare the performance of GradiVeQ with uncompressed baseline RAR. In addition, to fairly compare GradiVeQ with scalar quantization techniques under the same compression ratio (i.e., 8), we also integrate 4bitQSGD with RAR. We note that for CNNs, 4bit is the minimum quantization level that allows QSGD to gracefully converge alistarh2016qsgd . One of the advantage of QSGD is that unlike GradiVeQ it does not need any PCA before applying the compression. GradiVeQ exploits this property of QSGD to minimize bandwidthinefficiency during the iterations that are not GradiVeQcompressed. Furthermore this approach demonstrates the compatibility of GradiVeQ with scalar quantization. We apply 4bitSGD to these iterations and use the quantized gradients for PCA.
4.1 Model Convergence
We analyze the model convergence of the three different systems for a given training accuracy. All the 3 systems converge after iterations, indicating that GradiVeQ does not incur extra iterations. However, as plotted in 7(a), both compression approaches reduce the model convergence wallclock time significantly, with GradiVeQ slashing it even more due to its further reduction in gradient aggregation time – in our CPU setup, uncompressed RAR takes about seconds for the model to converge, 4bitQSGD takes seconds to converge, whereas GradiVeQ takes only seconds to converge. For our GPU setup in Google Cloud, these numbers are reduced to (uncompressed), (4bitQSGD), and (GradiVeQ), respectively. In terms of test accuracy, uncompressed RAR’s top1 accuracy is 0.676, while 4bitQSGD RAR’s top1 accuracy is 0.667, and GradiVeQ RAR’s top1 accuracy is 0.666, indicating only marginal accuracy loss due to quantization.
4.2 EndtoEnd Training Time Reduction Breakdown
The endtoend training time consists of computation time and gradient aggregation time. The computation time includes the time it takes to compute the gradient vector through backward propagation, and to update the model parameters. The gradient aggregation time is the time it takes to aggregate the gradient vectors computed by the worker nodes. Both GradiVeQ and 4bitQSGD share the same computation time as the uncompressed system, as they do not alter the computations. The number is about 650 seconds per 500 () iterations under our CPU setup. In terms of gradient aggregation time, the uncompressed system needs 850 seconds per 500 iterations, which constitutes of the endtoend training time. On the other hand, GradiVeQ substantially reduces this time by 5.25x to only 162 seconds thanks to both its gradient compression and parallelization with RAR. As a result, GradiVeQ is able to slash the endtoend training time by . In contrast, although 4bitQSGD can offer the same compression ratio, its incompatibility to be parallelized with RAR makes its gradient aggregation time almost double that of GradiVeQ. The gain of GradiVeQ becomes more significant under our GPU setup. GPUs can boost the computation speed by 6 times, which makes the communication time a more substantial bottleneck: being 88% of the endtoend training time without compression. Thus, by slashing the gradient aggregation time, GradiVeQ achieves a higher endtoend training time reduction of 4X over the uncompressed method and 1.40 times over 4bitQSGD.
5 Conclusion
In this paper we have proposed GradiVeQ, a novel vector quantization technique for CNN gradient compression. GradiVeQ enables direct aggregation of compressed gradients, so that when paired with decentralized aggregation protocols such as ring allreduce (RAR), GradiVeQ compression can be parallelized with gradient communication. Experiments show that GradiVeQ can significantly reduce the wallclock gradient aggregation time of RAR, and achieves better speedup than scalar quantization techniques such as QSGD.
In the future, we will adapt GradiVeQ to other types of neural networks. We are also interested in understanding the implications of the linear correlation between gradients we have discovered, such as its usage in model reduction.
Acknowledgement
This material is based upon work supported by Defense Advanced Research Projects Agency (DARPA) under Contract No. HR001117C0053. The views, opinions, and/or findings expressed are those of the author(s) and should not be interpreted as representing the official views or policies of the Department of Defense or the U.S. Government. This work is also supported by NSF Grants CCF1763673, CCF1703575, CNS1705047, CNS1557244, SHF1719074.
References
 (1) K. Simonyan and A. Zisserman, “Very deep convolutional networks for largescale image recognition,” in ICLR, 2015.

(2)
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image
recognition,” in
Proc. IEEE conf. Computer Vision and Pattern Recognition (CVPR)
, 2016, pp. 770–778.  (3) O. AbdelHamid, A.r. Mohamed, H. Jiang, and G. Penn, “Applying convolutional neural networks concepts to hybrid nnhmm model for speech recognition,” in ICASSP. IEEE, 2012, pp. 4277–4280.
 (4) O. AbdelHamid, A.r. Mohamed, H. Jiang, L. Deng, G. Penn, and D. Yu, “Convolutional neural networks for speech recognition,” IEEE/ACM Transactions on audio, speech, and language processing, vol. 22, no. 10, pp. 1533–1545, 2014.

(5)
Y. Miao, L. Yu, and P. Blunsom, “Neural variational inference for text
processing,” in
International Conference on Machine Learning
, 2016, pp. 1727–1736.  (6) R. Johnson and T. Zhang, “Effective use of word order for text categorization with convolutional neural networks,” arXiv preprint arXiv:1412.1058, 2014.
 (7) A. Krizhevsky, V. Nair, and G. Hinton, “The CIFAR10 and CIFAR100 dataset,” 2009. [Online]. Available: https://www.cs.toronto.edu/~kriz/cifar.html
 (8) J. Deng, W. Dong, R. Socher, L.J. Li, K. Li, and L. FeiFei, “Imagenet: A largescale hierarchical image database,” in Proc. IEEE conf. Computer Vision and Pattern Recognition (CVPR), 2009, pp. 248–255.
 (9) R. Mcdonald, M. Mohri, N. Silberman, D. Walker, and G. S. Mann, “Efficient largescale distributed training of conditional maximum entropy models,” in NIPS, 2009, pp. 1231–1239.
 (10) M. Zinkevich, M. Weimer, L. Li, and A. J. Smola, “Parallelized stochastic gradient descent,” in NIPS, 2010, pp. 2595–2603.

(11)
R. McDonald, K. Hall, and G. Mann, “Distributed training strategies for the structured perceptron,” in
NAACL. Association for Computational Linguistics, 2010, pp. 456–464.  (12) R. Gemulla, E. Nijkamp, P. J. Haas, and Y. Sismanis, “Largescale matrix factorization with distributed stochastic gradient descent,” in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2011, pp. 69–77.
 (13) Y. Zhuang, W.S. Chin, Y.C. Juan, and C.J. Lin, “A fast parallel sgd for matrix factorization in shared memory systems,” in Proceedings of the 7th ACM conference on Recommender systems. ACM, 2013, pp. 249–256.
 (14) M. Li, D. G. Andersen, J. W. Park, A. J. Smola, A. Ahmed, V. Josifovski, J. Long, E. J. Shekita, and B.Y. Su, “Scaling distributed machine learning with the parameter server,” in OSDI, 2014.
 (15) M. Li, D. G. Andersen, A. J. Smola, and K. Yu, “Communication efficient distributed machine learning with the parameter server,” in NIPS, 2014.
 (16) F. N. Iandola, K. Ashraf, M. W. Moskewicz, and K. Keutzer, “Firecaffe: nearlinear acceleration of deep neural network training on compute clusters,” in CVPR, 2016.
 (17) J. Langford, A. J. Smola, and M. Zinkevich, “Slow learners are fast,” in Proc. Advances in Neural Information Processing Systems (NIPS), 2009, pp. 2331–2339.
 (18) B. Recht, C. Re, S. Wright, and F. Niu, “Hogwild: A lockfree approach to parallelizing stochastic gradient descent,” in Proc. Advances in Neural Information Processing Systems (NIPS), 2011, pp. 693–701.
 (19) A. Agarwal and J. C. Duchi, “Distributed delayed stochastic optimization,” in NIPS, 2011, pp. 873–881.
 (20) J. Dean, G. Corrado, R. Monga, K. Chen, M. Devin, M. Mao, A. Senior, P. Tucker, K. Yang, Q. V. Le et al., “Large scale distributed deep networks,” in NIPS, 2012, pp. 1223–1231.
 (21) Q. Ho, J. Cipar, H. Cui, S. Lee, J. K. Kim, P. B. Gibbons, G. A. Gibson, G. R. Ganger, and E. P. Xing, “More effective distributed ml via a stale synchronous parallel parameter server.” in NIPS, 2013, pp. 1223–1231.
 (22) X. Lian, W. Zhang, C. Zhang, and J. Liu, “Asynchronous decentralized parallel stochastic gradient descent,” 2018, cite arxiv:1710.06952. [Online]. Available: https://arxiv.org/abs/1710.06952
 (23) F. Seide, H. Fu, J. Droppo, G. Li, and D. Yu, “1bit stochastic gradient descent and its application to dataparallel distributed training of speech dnns,” in Fifteenth Annual Conference of the International Speech Communication Association, 2014.
 (24) D. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnovic, “QSGD: Communicationefficient SGD via gradient quantization and encoding,” in Proc. Advances in Neural Information Processing Systems (NIPS), 2017, pp. 1707–1718.
 (25) N. Dryden, T. Moon, S. A. Jacobs, and B. Van Essen, “Communication quantization for dataparallel training of deep neural networks,” in Workshop on Machine Learning in HPC Environments (MLHPC). IEEE, 2016, pp. 1–8.

(26)
W. Wen, C. Xu, F. Yan, C. Wu, Y. Wang, Y. Chen, and H. Li, “Terngrad: Ternary gradients to reduce communication in distributed deep learning,”
NIPS, pp. 1508–1518, 2017.  (27) S. Zhou, Y. Wu, Z. Ni, X. Zhou, H. Wen, and Y. Zou, “Dorefanet: Training low bitwidth convolutional neural networks with low bitwidth gradients,” arXiv preprint arXiv:1606.06160, 2016.
 (28) Y. Lin, S. Han, H. Mao, Y. Wang, and W. J. Dally, “Deep gradient compression: Reducing the communication bandwidth for distributed training,” in ICLR, 2018.
 (29) P. Patarasuk and X. Yuan, “Bandwidth optimal allreduce algorithms for clusters of workstations,” Journal of Parallel and Distributed Computing, vol. 69, no. 2, pp. 117–124, 2009.
 (30) R. Thakur, R. Rabenseifner, and W. Gropp, “Optimization of collective communication operations in mpich.” IJHPCA, vol. 19, pp. 49–66, 2005.
 (31) P. Goyal, P. Dollár, R. Girshick, P. Noordhuis, L. Wesolowski, A. Kyrola, A. Tulloch, Y. Jia, and K. He, “Accurate, large minibatch sgd: training imagenet in 1 hour,” arXiv preprint arXiv:1706.02677, 2018.
 (32) A. Gibiansky, “Bringing HPC Techniques to Deep Learning,” http://research.baidu.com/bringinghpctechniquesdeeplearning/, 2017, [Online; accessed August 24, 2019].
Comments
There are no comments yet.