mlsanityData to 14 Oct 2026

Gradient Projection onto Historical Descent Directions for Communication-Efficient Federated Learning

arXiv 2511.05593 ↗First posted 5 Nov 2025cs.LG cs.NE math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

Federated Learning (FL) enables decentralized model training across multiple clients while optionally preserving data privacy. However, communication efficiency remains a critical bottleneck, particularly for large-scale models. In this work, we introduce two complementary algorithms: ProjFL, designed for unbiased compressors, and ProjFL+EF, tailored for biased compressors through an Error Feedback mechanism. Both methods rely on projecting local gradients onto a shared client-server subspace spanned by historical descent directions, enabling efficient information exchange with minimal communication overhead. We establish convergence guarantees for both algorithms under strongly convex, convex, and non-convex settings. Empirical evaluations on standard FL classification benchmarks with deep neural networks show that ProjFL and ProjFL+EF achieve accuracy comparable to existing baselines while substantially reducing communication costs.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 37 references that are in the map. First posted on arXiv 5 Nov 2025.

Builds on

25 of 37 references.

References · 25

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2019Advances and Open Problems in Federated Learningcited by 3,046
  4. 2018Sparsified SGD with Memorycited by 376
  5. 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 310
  6. 2017Sparse Communication for Distributed Gradient Descentcited by 249
  7. 2018The Convergence of Sparsified Gradient Methodscited by 229
  8. 2020On Biased Compression for Distributed Learningcited by 140
  9. 2021EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedbackcited by 133
  10. 2019Distributed Learning with Compressed Gradient Differencescited by 112
  11. 2019DoubleSqueeze: Parallel Stochastic Gradient Descent with Double-Pass Error-Compensated Compressioncited by 99
  12. 2020Acceleration for Compressed Gradient Descent in Distributed and Federated Optimizationcited by 90
13 more
  1. 2019A Unified Theory of SGD: Variance Reduction, Sampling, Quantization and Coordinate Descentcited by 84
  2. 20158-Bit Approximations for Parallelism in Deep Learningcited by 56
  3. 2018Distributed learning with compressed gradientscited by 55
  4. 2020Uncertainty Principle for Communication Compression in Distributed and Federated Learning and the Search for an Optimal Compressorcited by 45
  5. 2019On the Discrepancy between the Theoretical Analysis and Practical Implementations of Compressed Communication for Distributed Deep Learningcited by 32
  6. 2023Momentum Provably Improves Error Feedback!cited by 31
  7. 2022EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compressioncited by 28
  8. 2021FedPAGE: A Fast Local Stochastic Gradient Method for Communication-Efficient Federated Learningcited by 20
  9. 2022Adaptive Compression for Communication-Efficient Distributed Trainingcited by 16
  10. 2021MURANA: A Generic Framework for Stochastic Variance-Reduced Optimizationcited by 14
  11. 2023Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?cited by 14
  12. 2021EF21 with Bells & Whistles: Six Algorithmic Extensions of Modern Error Feedbackcited by 8
  13. 2023Compressed and distributed least-squares regression: convergence rates with applications to Federated Learningcited by 2

Built on by

Not cited yet.