Metraipolis › archive › dc_36d2aafbdcae

Connectivity-Aware Client Selection in Decentralized Federated Learning — arXiv:2610.41570

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41570
License (as archived)
CC0-1.0
Archived
2026-11-02T07:39:28.328Z
SHA-256 of the archived text
8229b8aa9cca91316edcec6f6f7713efb57549e6c4b5a003b46b220651c1303c
Stable URL of this page
https://metraipolis.com/documento/dc_36d2aafbdcae

How to cite

Connectivity-Aware Client Selection in Decentralized Federated Learning — arXiv:2610.41570 — arXiv (en), https://arxiv.org/abs/2610.41570 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_36d2aafbdcae (Metraipolis archive dc_36d2aafbdcae, sha256 8229b8aa9cca91316edcec6f6f7713efb57549e6c4b5a003b46b220651c1303c)
BibTeX
@misc{dc36d2aafbdcae,
  title = {Connectivity-Aware Client Selection in Decentralized Federated Learning — arXiv:2610.41570},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41570},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_36d2aafbdcae; sha256 8229b8aa9cca91316edcec6f6f7713efb57549e6c4b5a003b46b220651c1303c},
  year = {2026}
}

Archived text

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

Decentralized federated learning (DFL) has emerged as a scalable alternative to centralized federated learning, removing the single point of failure and communication bottleneck at the server. However, most existing decentralized approaches rely on full-neighborhood broadcasting, where each client transmits its model update to all of its neighbors in each communication round. While effective, this results in significant communication overhead and high energy consumption. This paper applies spectral graph tools as lightweight client selection methods that leverage the graph topology by analyzing the spectral properties of the graph Laplacian over a fixed communication graph. Specifically, we exploit eigenvector embeddings and heat/diffusion kernel similarities to guide each client in selecting only a subset of structurally relevant neighbors, i.e., those that are most beneficial for the convergence of the federation process. This topology aware randomization matches or outperforms uniform neighborhood subsampling and approaches the accuracy of full broadcasting. The largest gains, about $3$ percentage points, emerge under strong data heterogeneity on larger, structurally rich graphs, while the total number of transmitted messages is reduced by $50\%$ compared to naive broadcasting.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2610.41570 — 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-11-02T07:37:00.493Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).