Dataset Condensation Atlas

Application · Distribution and feature matching

DeSA

Overcoming Data and Model Heterogeneities in Decentralized Federated Learning via Synthetic Anchors

Chun-Yin Huang, Kartik Srinivas, Xin Zhang, Xiaoxiao Li

ICML 2024 · first public 2024-05-19 · arXiv 2405.11525

paper ↗code ↗notable✓ abstract read

In one paragraph

In serverless decentralized federated learning, DeSA synthesizes global anchor data from each client's raw data distribution and uses it for two local regularizers: aligning each client's latent embeddings to the anchors, and a knowledge-distillation loss that lets clients learn from one another, grounded in domain-adaptation and KD theory. Reports improved inter- and intra-domain accuracy across clients with diverse data and model heterogeneity.

Where it sits

Abstract (verbatim from arXiv)

Conventional Federated Learning (FL) involves collaborative training of a global model while maintaining user data privacy. One of its branches, decentralized FL, is a serverless network that allows clients to own and optimize different local models separately, which results in saving management and communication resources. Despite the promising advancements in decentralized FL, it may reduce model generalizability due to lacking a global model. In this scenario, managing data and model heterogeneity among clients becomes a crucial problem, which poses a unique challenge that must be overcome: How can every client's local model learn generalizable representation in a decentralized manner? To address this challenge, we propose a novel Decentralized FL technique by introducing Synthetic Anchors, dubbed as DeSA. Based on the theory of domain adaptation and Knowledge Distillation (KD), we theoretically and empirically show that synthesizing global anchors based on raw data distribution facilitates mutual knowledge transfer. We further design two effective regularization terms for local training: 1) REG loss that regularizes the distribution of the client's latent embedding with the anchors and 2) KD loss that enables clients to learn from others. Through extensive experiments on diverse client data distributions, we showcase the effectiveness of DeSA in enhancing both inter- and intra-domain accuracy of each client.

BibTeX (generated; prefer the venue's official entry)
@article{huang2024overcoming,
  title   = {Overcoming Data and Model Heterogeneities in Decentralized Federated Learning via Synthetic Anchors},
  author  = {Chun-Yin Huang and Kartik Srinivas and Xin Zhang and Xiaoxiao Li},
  journal = {ICML 2024},
  year    = {2024}
}

Nearby in Distribution and feature matching

2026-06

RAHA — Rank-Aware Hyperbolic Alignment for Vision-Language Dataset Distillation

Jongoh Jeong, Sun-Kyung Lee, Kuk-Jin Yoon · ECCV 2026notableVision–languagepaper ↗code ↗

2026-05

MDM — Multimodal Distribution Matching for Vision-Language Dataset Distillation

Jongoh Jeong, Hoyong Kwon, Minseok Kim et al. · CVPR 2026notableVision–languagepaper ↗code ↗

2026-03

Sneakdoor — SNEAKDOOR: Stealthy Backdoor Attacks against Distribution Matching-based Dataset Condensation

He Yang, Dongyi Lv, Song Ma et al. · NeurIPS 2025notablepaper ↗code ↗

2026-03

Harmonic Dataset Distillation for Time Series Forecasting

Seungha Hong, Sanghwan Jang, Wonbin Kweon et al. · AAAI 2026notableTime seriespaper ↗

2025-11

Algorithmic Guarantees for Distilling Supervised and Offline RL Datasets

Aaryan Gupta, Rishi Saket, Aravindan Raghuveer · ICLR 2026notableOther datapaper ↗