mlsanityData to 14 Oct 2026

Multi-Source Collaborative Gradient Discrepancy Minimization for Federated Domain Generalization

arXiv 2401.10272 ↗First posted 5 Jan 2024cs.CV cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

Federated Domain Generalization aims to learn a domain-invariant model from multiple decentralized source domains for deployment on unseen target domain. Due to privacy concerns, the data from different source domains are kept isolated, which poses challenges in bridging the domain gap. To address this issue, we propose a Multi-source Collaborative Gradient Discrepancy Minimization (MCGDM) method for federated domain generalization. Specifically, we propose intra-domain gradient matching between the original images and augmented images to avoid overfitting the domain-specific information within isolated domains. Additionally, we propose inter-domain gradient matching with the collaboration of other domains, which can further reduce the domain shift across decentralized domains. Combining intra-domain and inter-domain gradient matching, our method enables the learned model to generalize well on unseen domains. Furthermore, our method can be extended to the federated domain adaptation task by fine-tuning the target model on the pseudo-labeled target domain. The extensive experiments on federated domain generalization and adaptation indicate that our method outperforms the state-of-the-art methods significantly.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 25 of its 43 references that are in the map. First posted on arXiv 5 Jan 2024.

Builds on

25 of 43 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. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,733
  4. 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,269
  5. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,331
  6. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
  7. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  8. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 848
  9. 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 766
  10. 2019Domain Generalization by Solving Jigsaw Puzzlescited by 450
  11. 2020Self-Challenging Improves Cross-Domain Generalizationcited by 426
  12. 2020Learning to Generate Novel Domains for Domain Generalizationcited by 296
13 more
  1. 2021A Fourier-based Framework for Domain Generalizationcited by 290
  2. 2021FedDG: Federated Domain Generalization on Medical Image Segmentation via Episodic Learning in Continuous Frequency Spacecited by 287
  3. 2015Domain Generalization for Object Recognition with Multi-task Autoencoderscited by 253
  4. 2020Deep Domain-Adversarial Image Generation for Domain Generalisationcited by 231
  5. 2018Deep Cocktail Network: Multi-source Unsupervised Domain Adaptation with Category Shiftcited by 109
  6. 2020Learning from Extrinsic and Intrinsic Supervisions for Domain Generalizationcited by 108
  7. 2023Federated Learning for Generalization, Robustness, Fairness: A Survey and Benchmarkcited by 99
  8. 2021Cross-Domain Gradient Discrepancy Minimization for Unsupervised Domain Adaptationcited by 67
  9. 2021Domain Generalization via Gradient Surgerycited by 60
  10. 2020KD3A: Unsupervised Multi-Source Decentralized Domain Adaptation via Knowledge Distillationcited by 50
  11. 2022Federated Domain Generalization for Image Recognition via Cross-Client Style Transfercited by 40
  12. 2023Generalizable Heterogeneous Federated Cross-Correlation and Instance Similarity Learningcited by 40
  13. 2021Collaborative Semantic Aggregation and Calibration for Federated Domain Generalizationcited by 16

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 7; 2026: 3.

12 papers.