mlsanityData to 7 Oct 2026

Gradient Compression May Hurt Generalization: A Remedy by Synthetic Data Guided Sharpness Aware Minimization

arXiv 2602.11584 ↗First posted 12 Feb 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

It is commonly believed that gradient compression in federated learning (FL) enjoys significant improvement in communication efficiency with negligible performance degradation. In this paper, we find that gradient compression induces sharper loss landscapes in federated learning, particularly under non-IID data distributions, which suggests hindered generalization capability. The recently emerging Sharpness Aware Minimization (SAM) effectively searches for a flat minima by incorporating a gradient ascent step (i.e., perturbing the model with gradients) before the celebrated stochastic gradient descent. Nonetheless, the direct application of SAM in FL suffers from inaccurate estimation of the global perturbation due to data heterogeneity. Existing approaches propose to utilize the model update from the previous communication round as a rough estimate. However, its effectiveness is hindered when model update compression is incorporated. In this paper, we propose FedSynSAM, which leverages the global model trajectory to construct synthetic data and facilitates an accurate estimation of the global perturbation. The convergence of the proposed algorithm is established, and extensive experiments are conducted to validate its effectiveness.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 33 of its 46 references that are in the map. First posted on arXiv 12 Feb 2026.

Builds on

33 of 46 references.

References · 33

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  4. 2018Federated Optimization in Heterogeneous Networkscited by 2,971
  5. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  6. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  7. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,220
  8. 2018Federated Learning with Non-IID Datacited by 1,099
  9. 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 836
  10. 2021Federated Learning on Non-IID Data Silos: An Experimental Studycited by 566
  11. 2021Federated Learning Based on Dynamic Regularizationcited by 555
  12. 2019Fantastic Generalization Measures and Where to Find Themcited by 507
21 more
  1. 2022Dataset Distillation by Matching Training Trajectoriescited by 437
  2. 2021Dataset Condensation with Distribution Matchingcited by 362
  3. 2019FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantizationcited by 349
  4. 2018The Convergence of Sparsified Gradient Methodscited by 228
  5. 2021Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learningcited by 192
  6. 2022Generalized Federated Learning via Sharpness Aware Minimizationcited by 144
  7. 2020On Biased Compression for Distributed Learningcited by 140
  8. 2021EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedbackcited by 131
  9. 2023Generalizing Dataset Distillation via Deep Generative Priorcited by 125
  10. 2019Communication-Efficient Federated Deep Learning with Asynchronous Model Update and Temporally Weighted Aggregationcited by 99
  11. 2022Improving Generalization in Federated Learning by Seeking Flat Minimacited by 98
  12. 2020Acceleration for Compressed Gradient Descent in Distributed and Federated Optimizationcited by 90
  13. 2022FedDM: Iterative Distribution Matching for Communication-Efficient Federated Learningcited by 65
  14. 2019Scaling Distributed Machine Learning with In-Network Aggregationcited by 62
  15. 2020Ternary Compression for Communication-Efficient Federated Learningcited by 57
  16. 2023Dynamic Regularized Sharpness Aware Minimization in Federated Learning: Approaching Global Consistency and Smooth Landscapecited by 46
  17. 2024Locally Estimated Global Perturbations are Better than Local Perturbations for Federated Sharpness-aware Minimizationcited by 28
  18. 2022DYNAFED: Tackling Client Data Heterogeneity with Global Dynamicscited by 22
  19. 2023Unlocking the Potential of Federated Learning: The Symphony of Dataset Distillation via Deep Generative Latentscited by 16
  20. 2024LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compressioncited by 11
  21. 2018signSGD with Majority Vote is Communication Efficient And Fault Tolerantcited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.