Error Compensated Loopless SVRG, Quartz, and SDCA for Distributed Optimization
arXiv:2109.10049
Abstract
The communication of gradients is a key bottleneck in distributed training of large scale machine learning models. In order to reduce the communication cost, gradient compression (e.g., sparsification and quantization) and error compensation techniques are often used. In this paper, we propose and study three new efficient methods in this space: error compensated loopless SVRG method (EC-LSVRG), error compensated Quartz (EC-Quartz), and error compensated SDCA (EC-SDCA). Our method is capable of working with any contraction compressor (e.g., TopK compressor), and we perform analysis for convex optimization problems in the composite case and smooth case for EC-LSVRG. We prove linear convergence rates for both cases and show that in the smooth case the rate has a better dependence on the parameter associated with the contraction compressor. Further, we show that in the smooth case, and under some certain conditions, error compensated loopless SVRG has the same convergence rate as the vanilla loopless SVRG method. Then we show that the convergence rates of EC-Quartz and EC-SDCA in the composite case are as good as EC-LSVRG in the smooth case. Finally, numerical experiments are presented to illustrate the efficiency of our methods.
arXiv comment63 pages, 76 figures
References in corpus (13)
- Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour
- HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
- QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding
- Sparsified SGD with Memory
- Communication Compression for Decentralized Training
- DoubleSqueeze: Parallel Stochastic Gradient Descent with Double-Pass Error-Compensated Compression
- Distributed Learning with Compressed Gradient Differences
- Stochastic Distributed Learning with Gradient Quantization and Variance Reduction
- The Error-Feedback Framework: Better Rates for SGD with Delayed Gradients and Compressed Communication
- Natural Compression for Distributed Deep Learning
- On Biased Compression for Distributed Learning
- Linearly Converging Error Compensated SGD
- L-SVRG and L-Katyusha with Arbitrary Sampling