Metraipolis › archive › dc_91cf42ca2ed5

Adaptive Client Clustering and Coordination for Federated Learning Workflow Management in Edge Networks — arXiv:2609.33544

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33544
License (as archived)
CC0-1.0
Archived
2026-10-07T22:12:07.790Z
SHA-256 of the archived text
2cd30ee43a67cbe3cde1e60b2d24beb4693f03b26aac8e221c19f0b4ec21ddb3
Stable URL of this page
https://metraipolis.com/documento/dc_91cf42ca2ed5

How to cite

Adaptive Client Clustering and Coordination for Federated Learning Workflow Management in Edge Networks — arXiv:2609.33544 — arXiv (en), https://arxiv.org/abs/2609.33544 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_91cf42ca2ed5 (Metraipolis archive dc_91cf42ca2ed5, sha256 2cd30ee43a67cbe3cde1e60b2d24beb4693f03b26aac8e221c19f0b4ec21ddb3)
BibTeX
@misc{dc91cf42ca2ed5,
  title = {Adaptive Client Clustering and Coordination for Federated Learning Workflow Management in Edge Networks — arXiv:2609.33544},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33544},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_91cf42ca2ed5; sha256 2cd30ee43a67cbe3cde1e60b2d24beb4693f03b26aac8e221c19f0b4ec21ddb3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33544. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Federated learning (FL) is increasingly deployed as a managed learning service rather than as a set of isolated training jobs. In networked edge environments, dependent FL service flows must coordinate heterogeneous clients, non-IID data, fluctuating communication latency, and precedence-constrained tasks under service-level completion requirements. These coupled factors make participant management central to both time-totarget performance and learning stability. This paper proposes A-CoDa, an adaptive clustered coordination framework for managing dependent FL flows. A-CoDa first uses label-distribution divergence (LDD)-based greedy-balanced clustering to construct statistically coherent and size-aware client groups, which serve as a scalable management abstraction. Building on this structure, we design FedMIX, an uncertainty-aware intra-/inter-cluster participation mechanism that ranks clients by a loss-latency-uncertainty utility and adaptively controls cross-cluster probing according to training progress and latency conditions. A dependency-aware DAG scheduler then orchestrates layer-wise task execution so that parallelism and precedence constraints are jointly respected. We further provide a convergence analysis that frames the result as a sufficient loss-domain design bound, explicitly relating the attainable error floor and sufficient communication rounds to LDDinduced sampling mismatch, residual distribution shift, local-SGD drift, stochastic variance, and adaptive probing budgets. Experiments on handwriting, wearable-sensing, product-image, and medical-imaging tasks evaluate A-CoDa under dependent FL workflows and demonstrate its effectiveness in reducing end-toend completion time while maintaining competitive accuracy.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-29 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2609.33544 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T21:53:13.683Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).