Distributed learning with compressed gradients
Not on the map. Why?
Abstract (arXiv)
Asynchronous computation and gradient compression have emerged as two key techniques for achieving scalability in distributed optimization for large-scale machine learning. This paper presents a unified analysis framework for distributed gradient methods operating with staled and compressed gradients. Non-asymptotic bounds on convergence rates and information exchange are derived for several optimization algorithms. These bounds give explicit expressions for step-sizes and characterize how the amount of asynchrony and the compression accuracy affect iteration and communication complexity guarantees. Numerical results highlight convergence properties of different gradient compression algorithms and confirm that fast convergence under limited information exchange is indeed possible.
Key facts. Cited by 53 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 11; 2022: 13; 2023: 13; 2024: 8; 2025: 7; 2026: 1.
53 papers.
Sort:
- 2021EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedbackcited by 131
- 2021Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradientscited by 122
- 2021FedNL: Making Newton-Type Methods Applicable to Federated Learningcited by 50
- 2022BEER: Fast O(1/T) Rate for Decentralized Nonconvex Optimization with Communication Compressioncited by 41
- 2023A Guide Through the Zoo of Biased SGDcited by 39
- 2022SoteriaFL: A Unified Framework for Private Federated Learning with Communication Compressioncited by 34
- 2022Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learningcited by 33
- 20223PC: Three Point Compressors for Communication-Efficient Distributed Training and a Better Theory for Lazy Aggregationcited by 27
- 2022Finite-Sum Coupled Compositional Stochastic Optimization: Theory and Applicationscited by 27
- 2021Distributed Second Order Methods with Fast Rates and Compressed Communicationcited by 25
- 2021CANITA: Faster Rates for Distributed Convex Optimization with Communication Compressioncited by 23
- 2022FedNew: A Communication-Efficient and Privacy-Preserving Newton-Type Method for Federated Learningcited by 23
38 more
- 2021Smoothness Matrices Beat Smoothness Constants: Better Communication Compression Techniques for Distributed Optimizationcited by 21
- 2022Federated Optimization Algorithms with Random Reshuffling and Gradient Compressioncited by 18
- 2023AsGrad: A Sharp Unified Analysis of Asynchronous-SGD Algorithmscited by 16
- 2021Faster Rates for Compressed Federated Learning with Client-Variance Reductioncited by 14
- 2022Adaptive Compression for Communication-Efficient Distributed Trainingcited by 14
- 2023Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?cited by 14
- 2023EControl: Fast Distributed Optimization with Compression and Error Controlcited by 14
- 2023Temporal Difference Learning with Compressed Updates: Error-Feedback meets Reinforcement Learningcited by 12
- 2023Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Ratescited by 12
- 2022FL_PyTorch: optimization research simulator for federated learningcited by 10
- 2024DARE the Extreme: Revisiting Delta-Parameter Pruning For Fine-Tuned Modelscited by 10
- 2021Theoretically Better and Numerically Faster Distributed Optimization with Smoothness-Aware Quantization Techniquescited by 9
- 2022Linear Stochastic Bandits over a Bit-Constrained Channelcited by 9
- 2021IntSGD: Adaptive Floatless Compression of Stochastic Gradientscited by 8
- 2023Improving Accelerated Federated Learning with Compression and Importance Samplingcited by 7
- 2021EF21 with Bells & Whistles: Six Algorithmic Extensions of Modern Error Feedbackcited by 6
- 2022Shifted Compression Framework: Generalizations and Improvementscited by 6
- 2022Personalized Federated Learning with Communication Compressioncited by 6
- 2023Towards a Better Theoretical Understanding of Independent Subnetwork Trainingcited by 6
- 2023Byzantine Robustness and Partial Participation Can Be Achieved at Once: Just Clip Gradient Differencescited by 5
- 2024Rendering Wireless Environments Useful for Gradient Estimators: A Zero-Order Stochastic Federated Learning Methodcited by 4
- 2025Unbiased and Sign Compression in Distributed Learning: Comparing Noise Resilience via SDEscited by 4
- 2025Theoretical Analysis on how Learning Rate Warmup Accelerates Convergencecited by 4
- 2024On the Convergence of FedProx with Extrapolation and Inexact Proxcited by 3
- 2024Problem-dependent convergence bounds for randomized linear gradient compressioncited by 3
- 2025The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applicationscited by 3
- 2025Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participationcited by 3
- 2021Comfetch: Federated Learning of Large Networks on Constrained Clients via Sketchingcited by 2
- 2023Convergence of Sign-based Random Reshuffling Algorithms for Nonconvex Optimizationcited by 2
- 2023Federated Learning is Better with Non-Homomorphic Encryptioncited by 2
- 2024Temporal Predictive Coding for Gradient Compression in Distributed Learningcited by 2
- 2024Accelerated Methods with Compressed Communications for Distributed Optimization Problems under Data Similaritycited by 2
- 2023CORE: Common Random Reconstruction for Distributed Optimization with Provable Low Communication Complexitycited by 1
- 2024Communication and Energy Efficient Federated Learning using Zero-Order Optimization Techniquecited by 1
- 2025Tight analyses of first-order methods with error feedbackcited by 1
- 2025Communication-Efficient Zero-Order and First-Order Federated Learning Methods over Wireless Networkscited by 1
- 2022Better Methods and Theory for Federated Learning: Compression, Client Selection and Heterogeneitycited by 0
- 2023Unified analysis of SGD-type methodscited by 0
50 most cited of 53 All 53 (JSON)
- 2026ERIS: Enhancing Privacy and Scalability in Federated Learning via Federated Shard Aggregation9 Feb 2026
- 2025Gradient Projection onto Historical Descent Directions for Communication-Efficient Federated Learning5 Nov 2025
- 2025Theoretical Analysis on how Learning Rate Warmup Accelerates Convergence9 Sep 2025
- 2025Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation3 Sep 2025
- 2025Communication-Efficient Zero-Order and First-Order Federated Learning Methods over Wireless Networks11 Aug 2025
- 2025Tight analyses of first-order methods with error feedback5 Jun 2025
- 2025Unbiased and Sign Compression in Distributed Learning: Comparing Noise Resilience via SDEs24 Feb 2025
- 2025The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications4 Feb 2025
- 2024MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes22 Dec 2024
- 2024Accelerated Methods with Compressed Communications for Distributed Optimization Problems under Data Similarity21 Dec 2024
- 2024Problem-dependent convergence bounds for randomized linear gradient compression19 Nov 2024
- 2024DARE the Extreme: Revisiting Delta-Parameter Pruning For Fine-Tuned Models12 Oct 2024
38 more
- 2024Temporal Predictive Coding for Gradient Compression in Distributed Learning3 Oct 2024
- 2024On the Convergence of FedProx with Extrapolation and Inexact Prox2 Oct 2024
- 2024Communication and Energy Efficient Federated Learning using Zero-Order Optimization Technique24 Sep 2024
- 2024Rendering Wireless Environments Useful for Gradient Estimators: A Zero-Order Stochastic Federated Learning Method30 Jan 2024
- 2023Federated Learning is Better with Non-Homomorphic Encryption4 Dec 2023
- 2023Byzantine Robustness and Partial Participation Can Be Achieved at Once: Just Clip Gradient Differences23 Nov 2023
- 2023EControl: Fast Distributed Optimization with Compression and Error Control6 Nov 2023
- 2023AsGrad: A Sharp Unified Analysis of Asynchronous-SGD Algorithms31 Oct 2023
- 2023Convergence of Sign-based Random Reshuffling Algorithms for Nonconvex Optimization24 Oct 2023
- 2023Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates15 Oct 2023
- 2023CORE: Common Random Reconstruction for Distributed Optimization with Provable Low Communication Complexity23 Sep 2023
- 2023Towards a Better Theoretical Understanding of Independent Subnetwork Training28 Jun 2023
- 2023Improving Accelerated Federated Learning with Compression and Importance Sampling5 Jun 2023
- 2023Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?25 May 2023
- 2023A Guide Through the Zoo of Biased SGD25 May 2023
- 2023Unified analysis of SGD-type methods29 Mar 2023
- 2023Temporal Difference Learning with Compressed Updates: Error-Feedback meets Reinforcement Learning3 Jan 2023
- 2022Adaptive Compression for Communication-Efficient Distributed Training31 Oct 2022
- 2022Personalized Federated Learning with Communication Compression12 Sep 2022
- 2022Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learning9 Jul 2022
- 2022Better Methods and Theory for Federated Learning: Compression, Client Selection and Heterogeneity1 Jul 2022
- 2022Shifted Compression Framework: Generalizations and Improvements21 Jun 2022
- 2022SoteriaFL: A Unified Framework for Private Federated Learning with Communication Compression20 Jun 2022
- 2022FedNew: A Communication-Efficient and Privacy-Preserving Newton-Type Method for Federated Learning17 Jun 2022
- 2022Federated Optimization Algorithms with Random Reshuffling and Gradient Compression14 Jun 2022
- 2022Linear Stochastic Bandits over a Bit-Constrained Channel2 Mar 2022
- 2022Finite-Sum Coupled Compositional Stochastic Optimization: Theory and Applications24 Feb 2022
- 2022FL_PyTorch: optimization research simulator for federated learning7 Feb 2022
- 20223PC: Three Point Compressors for Communication-Efficient Distributed Training and a Better Theory for Lazy Aggregation2 Feb 2022
- 2022BEER: Fast O(1/T) Rate for Decentralized Nonconvex Optimization with Communication Compression31 Jan 2022
- 2021Faster Rates for Compressed Federated Learning with Client-Variance Reduction24 Dec 2021
- 2021EF21 with Bells & Whistles: Six Algorithmic Extensions of Modern Error Feedback7 Oct 2021
- 2021Comfetch: Federated Learning of Large Networks on Constrained Clients via Sketching17 Sep 2021
- 2021CANITA: Faster Rates for Distributed Convex Optimization with Communication Compression20 Jul 2021
- 2021EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedback9 Jun 2021
- 2021Theoretically Better and Numerically Faster Distributed Optimization with Smoothness-Aware Quantization Techniques7 Jun 2021
- 2021FedNL: Making Newton-Type Methods Applicable to Federated Learning5 Jun 2021
- 2021IntSGD: Adaptive Floatless Compression of Stochastic Gradients16 Feb 2021
50 newest of 53 All 53 (JSON)
- 2021EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedbackcited by 131
- 2021Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradientscited by 122
- 2021FedNL: Making Newton-Type Methods Applicable to Federated Learningcited by 50
- 2022BEER: Fast O(1/T) Rate for Decentralized Nonconvex Optimization with Communication Compressioncited by 41
- 2023A Guide Through the Zoo of Biased SGDcited by 39
- 2022SoteriaFL: A Unified Framework for Private Federated Learning with Communication Compressioncited by 34
- 2022Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learningcited by 33
- 20223PC: Three Point Compressors for Communication-Efficient Distributed Training and a Better Theory for Lazy Aggregationcited by 27
- 2022Finite-Sum Coupled Compositional Stochastic Optimization: Theory and Applicationscited by 27
- 2021Distributed Second Order Methods with Fast Rates and Compressed Communicationcited by 25
- 2021CANITA: Faster Rates for Distributed Convex Optimization with Communication Compressioncited by 23
- 2022FedNew: A Communication-Efficient and Privacy-Preserving Newton-Type Method for Federated Learningcited by 23
12 most cited of 53 All 53 (JSON)
- 2026ERIS: Enhancing Privacy and Scalability in Federated Learning via Federated Shard Aggregation9 Feb 2026
- 2025Gradient Projection onto Historical Descent Directions for Communication-Efficient Federated Learning5 Nov 2025
- 2025Theoretical Analysis on how Learning Rate Warmup Accelerates Convergence9 Sep 2025
- 2025Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation3 Sep 2025
- 2025Communication-Efficient Zero-Order and First-Order Federated Learning Methods over Wireless Networks11 Aug 2025
- 2025Tight analyses of first-order methods with error feedback5 Jun 2025
- 2025Unbiased and Sign Compression in Distributed Learning: Comparing Noise Resilience via SDEs24 Feb 2025
- 2025The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications4 Feb 2025
- 2024MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes22 Dec 2024
- 2024Accelerated Methods with Compressed Communications for Distributed Optimization Problems under Data Similarity21 Dec 2024
- 2024Problem-dependent convergence bounds for randomized linear gradient compression19 Nov 2024
- 2024DARE the Extreme: Revisiting Delta-Parameter Pruning For Fine-Tuned Models12 Oct 2024
12 newest of 53 All 53 (JSON)