mlsanityData to 7 Oct 2026

textttDeepSqueeze: Decentralization Meets Error-Compensated Compression

arXiv 1907.07346 ↗First posted 17 Jul 2019cs.DC cs.LG stat.MLcited by 21

Not on the map. Why?

Abstract (arXiv)

Communication is a key bottleneck in distributed training. Recently, an error-compensated compression technology was particularly designed for the centralized learning and receives huge successes, by showing significant advantages over state-of-the-art compression based methods in saving the communication cost. Since the decentralized training has been witnessed to be superior to the traditional centralized training in the communication restricted scenario, therefore a natural question to ask is "how to apply the error-compensated technology to the decentralized learning to further reduce the communication cost." However, a trivial extension of compression based centralized training algorithms does not exist for the decentralized scenario. key difference between centralized and decentralized training makes this extension extremely non-trivial. In this paper, we propose an elegant algorithmic design to employ error-compensated stochastic gradient descent for the decentralized scenario, named textttDeepSqueeze. Both the theoretical analysis and the empirical study are provided to show the proposed textttDeepSqueeze algorithm outperforms the existing compression based decentralized learning algorithms. To the best of our knowledge, this is the first time to apply the error-compensated compression to the decentralized learning.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Jul 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 6; 2022: 4; 2023: 4; 2024: 4; 2025: 2; 2026: 1.

21 papers.

Sort:

  1. 2022An Improved Analysis of Gradient Tracking for Decentralized Machine Learningcited by 68
  2. 2022BEER: Fast O(1/T) Rate for Decentralized Nonconvex Optimization with Communication Compressioncited by 41
  3. 2021Decentralized Local Stochastic Extra-Gradient for Variational Inequalitiescited by 25
  4. 2022On the Convergence of Distributed Stochastic Bilevel Optimization Algorithms over a Networkcited by 14
  5. 2021Compressed Gradient Tracking for Decentralized Optimization Over General Directed Networkscited by 10
  6. 2023CEDAS: A Compressed Decentralized Stochastic Gradient Method with Improved Convergencecited by 9
  7. 2023Convergence and Privacy of Decentralized Nonconvex Optimization with Gradient Clipping and Communication Compressioncited by 9
  8. 2021Decentralized Composite Optimization with Compressioncited by 7
  9. 2021Sparse-Push: Communication- & Energy-Efficient Decentralized Distributed Learning over Directed & Time-Varying Graphs with non-IID Datasetscited by 6
  10. 2021CFedAvg: Achieving Efficient Communication and Fast Convergence in Non-IID Federated Learningcited by 6
  11. 2022Neighborhood Gradient Clustering: An Efficient Decentralized Learning Method for Non-IID Data Distributionscited by 5
  12. 2023Near-Optimal Decentralized Momentum Method for Nonconvex-PL Minimax Problemscited by 4
9 more
  1. 2024Towards Faster Decentralized Stochastic Optimization with Communication Compressioncited by 4
  2. 2024Differential error feedback for communication-efficient decentralized learningcited by 3
  3. 2021Low Precision Decentralized Distributed Training over IID and non-IID Datacited by 2
  4. 2025Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimizationcited by 2
  5. 2024Averaging Rate Scheduler for Decentralized Learning on Heterogeneous Datacited by 1
  6. 2024AdaGossip: Adaptive Consensus Step-size for Decentralized Deep Learning with Communication Compressioncited by 1
  7. 2023Achieving Linear Speedup in Decentralized Stochastic Compositional Minimax Optimizationcited by 0
  8. 2025Improved Convergence in Parameter-Agnostic Error Feedback through Momentumcited by 0
  9. 2026SeedFlood: A Step Toward Scalable Decentralized Fine-Tuning of LLMscited by 0