FedPhD: Federated Pruning with Hierarchical Learning of Diffusion Models

Qianyu Long, Qiyuan Wang, Christos Anagnostopoulos, Daning Bi
7/8/2025
cs.LGcs.AIcs.DC

No confident code implementation found for this paper.

Abstract

Federated Learning (FL), as a distributed learning paradigm, trains models over distributed clients' data. FL is particularly beneficial for distributed training of Diffusion Models (DMs), which are high-quality image generators that require diverse data. However, challenges such as high communication costs and data heterogeneity persist in training DMs similar to training Transformers and Convolutional Neural Networks. Limited research has addressed these issues in FL environments. To address this gap and challenges, we introduce a novel approach, FedPhD, designed to efficiently train DMs in FL environments. FedPhD leverages Hierarchical FL with homogeneity-aware model aggregation and selection policy to tackle data heterogeneity while reducing communication costs. The distributed structured pruning of FedPhD enhances computational efficiency and reduces model storage requirements in clients. Our experiments across multiple datasets demonstrate that FedPhD achieves high model performance regarding Fréchet Inception Distance (FID) scores while reducing communication costs by up to $88\%$. FedPhD outperforms baseline methods achieving at least a $34\%$ improvement in FID, while utilizing only $56\%$ of the total computation and communication resources.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{long2025fedphd,
  title  = {FedPhD: Federated Pruning with Hierarchical Learning of Diffusion Models},
  author = {Qianyu Long and Qiyuan Wang and Christos Anagnostopoulos and Daning Bi},
  year   = {2025},
  eprint = {2507.06449},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.06449v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.06449.svg)](https://codeofpaper.com/paper/2507.06449)

Discussion