Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 22 min ago
PreprintarXiv licencearXiv

The Dynamics of Collapse and Recovery in Clustered Federated Learning

Abstract

Clustered federated learning (CFL) can suffer from cluster collapse. In particular, under unfavorable initialization, early client assignments concentrate heterogeneous groups on one cluster model, which is then trained toward a pooled compromise, while another model receives no updates. Since the current models determine client routing and routing determines subsequent model updates, we formulate clustered federated learning as control of an unknown dynamical system, with cluster models as the evolving state, client routing patterns as the control input, and routing interventions as state dependent controllers. In a two group linear model, we identify an initialization region in which greedy routing makes collapse self reinforcing. We then derive finite horizon error dynamics showing how routing interventions can reverse collapse by repeatedly training the starved model, primarily with updates from its compatible group. Motivated by this condition, each client uses blocked EXP3 to choose between greedy routing and interventions that redirect updates toward unused models. Experiments show that with simpler predictors and faster specialist formation, autonomous controller selection recovers usable specialists from unfavorable starts that trap standard CFL baselines. In transformed FEMNIST, the synchronized-entry configuration with persistent commitment recovers usable specialists in settings where the autonomous controller configuration often does not. Code and scripts for reproducing the experiments and figures are available at https://github.com/prsinha1/FedRecover.

Related

  1. PA-CFL: Privacy-Preserving Adaptive Clustered Federated Learning Under Heterogeneous Data
    Taihao Zhang, Wenting Shen, Hanlin Zhang +1
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  2. Conflict-Free Color-Clustered Sequential Belief-Propagation Decoding of Quantum LDPC Codes via Reinforcement Learning
    Mohsen Moradi, Taejoon Kim, Remi A. Chou
    arXivPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsarXiv
  3. Grouped Validation and Conformal Calibration for Clustered Cross-National Data with an Application to Harmonized Learning Outcomes
    Jeza Allohibi
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  4. On the Gradient Heterogeneity Dynamics of Adversarially Robust Federated Regression
    Leonardo F. Toso, James Anderson, Nirupam Gupta +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Progressive-Resolution Secure Aggregation for Federated Learning
    Seyed Mohammad Azimi-Abarghouyi
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@misc{sinha2026dynamics,
  title = {{The Dynamics of Collapse and Recovery in Clustered Federated Learning}},
  author = {Priyanka Sinha and Snigdhansu Chatterjee},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.28565},
  eprint = {2610.28565},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.28565},
}
RIS
TY  - UNPB
TI  - The Dynamics of Collapse and Recovery in Clustered Federated Learning
AU  - Priyanka Sinha
AU  - Snigdhansu Chatterjee
PY  - 2026
DA  - 2026/10/20
PB  - arXiv
DO  - 10.48550/arxiv.2610.28565
UR  - https://arxiv.org/abs/2610.28565
AB  - Clustered federated learning (CFL) can suffer from cluster collapse. In particular, under unfavorable initialization, early client assignments concentrate heterogeneous groups on one cluster model, which is then trained toward a pooled compromise, while another model receives no updates. Since the current models determine client routing and routing determines subsequent model updates, we formulate clustered federated learning as control of an unknown dynamical system, with cluster models as the evolving state, client routing patterns as the control input, and routing interventions as state dependent controllers. In a two group linear model, we identify an initialization region in which greedy routing makes collapse self reinforcing. We then derive finite horizon error dynamics showing how routing interventions can reverse collapse by repeatedly training the starved model, primarily with updates from its compatible group. Motivated by this condition, each client uses blocked EXP3 to choose between greedy routing and interventions that redirect updates toward unused models. Experiments show that with simpler predictors and faster specialist formation, autonomous controller selection recovers usable specialists from unfavorable starts that trap standard CFL baselines. In transformed FEMNIST, the synchronized-entry configuration with persistent commitment recovers usable specialists in settings where the autonomous controller configuration often does not. Code and scripts for reproducing the experiments and figures are available at https://github.com/prsinha1/FedRecover.
ER  -