mlsanityData to 7 Oct 2026

Gradient-Congruity Guided Federated Sparse Training

arXiv 2405.01189 ↗First posted 2 May 2024cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Edge computing allows artificial intelligence and machine learning models to be deployed on edge devices, where they can learn from local data and collaborate to form a global model. Federated learning (FL) is a distributed machine learning technique that facilitates this process while preserving data privacy. However, FL also faces challenges such as high computational and communication costs regarding resource-constrained devices, and poor generalization performance due to the heterogeneity of data across edge clients and the presence of out-of-distribution data. In this paper, we propose the Gradient-Congruity Guided Federated Sparse Training (FedSGC), a novel method that integrates dynamic sparse training and gradient congruity inspection into federated learning framework to address these issues. Our method leverages the idea that the neurons, in which the associated gradients with conflicting directions with respect to the global model contain irrelevant or less generalized information for other clients, and could be pruned during the sparse training process. Conversely, the neurons where the associated gradients with consistent directions could be grown in a higher priority. In this way, FedSGC can greatly reduce the local computation and communication overheads while, at the same time, enhancing the generalization abilities of FL. We evaluate our method on challenging non-i.i.d settings and show that it achieves competitive accuracy with state-of-the-art FL methods across various scenarios while minimizing computation and communication costs.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 31 references that are in the map. First posted on arXiv 2 May 2024.

Builds on

22 of 31 references.

References · 22

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2020Gradient Surgery for Multi-Task Learningcited by 1,210
  3. 2021Model-Contrastive Federated Learningcited by 762
  4. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  5. 2021Federated Learning Based on Dynamic Regularizationcited by 555
  6. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  7. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  8. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  9. 2019Model Pruning Enables Efficient Federated Learning on Edge Devicescited by 219
  10. 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
  11. 2021FedKD: Communication Efficient Federated Learning via Knowledge Distillationcited by 185
  12. 2022Tackling Data Heterogeneity in Federated Learning with Class Prototypescited by 66
10 more
  1. 2020LotteryFL: Personalized and Communication-Efficient Federated Learning with Lottery Ticket Hypothesis on Non-IID Datasetscited by 60
  2. 2021Domain Generalization via Gradient Surgerycited by 60
  3. 2021Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Bettercited by 54
  4. 2020SpaceNet: Make Free Space For Continual Learningcited by 53
  5. 2021Dynamic Sparse Training for Deep Reinforcement Learningcited by 49
  6. 2021Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsitycited by 44
  7. 2020Quick and Robust Feature Selection: the Strength of Energy-efficient Sparse Training for Autoencoderscited by 27
  8. 2019Federated Learning with Unbiased Gradient Aggregation and Controllable Meta Updatingcited by 22
  9. 2021Privacy-Preserving Constrained Domain Generalization via Gradient Alignmentcited by 8
  10. 2023FedSelect: Customized Selection of Parameters for Fine-Tuning during Personalized Federated Learningcited by 2

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.