EUVIMEDEUVIMED entdecken
Crossref

Asymmetrically Decentralized Federated Learning

Qinglun Li, Miao Zhang, Nan Yin, Quanjun Yin, Li Shen, Xiaochun Cao

IEEE Transactions on Computers · 2025-08 · 74 (8) · 2745-2756

DOI: 10.1109/tc.2025.3569185 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Computers, 2025-08. Verfasst von Qinglun Li und 5 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 50 Literaturangaben. Gefördert von: National Key R&D Program of China, Shenzhen Basic Research Project (Natural Science Foundation) Basic Research Key Project, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

To address the communication burden and privacy concerns associated with the centralized server in Federated Learning (FL), Decentralized Federated Learning (DFL) has emerged, which discards the server with a peer-to-peer (P2P) communication framework, significantly expanding the application scenarios of FL. However, most existing DFL algorithms are based on symmetric topologies, such as ring and grid topology, which can easily lead to deadlocks and are susceptible to the impact of network link quality in practice. To address these issues, we propose DFedSGPSM, a transitional framework that converts symmetric DFL optimizers into asymmetric variants. By adopting the Push-Sum protocol in asymmetric network topologies, our framework successfully circumvents the deadlock and link-quality issues prevalent in symmetric configurations. To further validate the effectiveness of our algorithm framework, we integrate the local momentum (in DFedAvgM) and SAM (in DFedSAM) from existing symmetric DFL optimizer into DFedSGPSM to accelerate training and pursue smooth local minimum, which enables existing symmetric DFL optimizers to be seamlessly integrated into asymmetric DFL. Theoretical analysis proves that DFedSGPSM achieves a linear speedup rate of $ \mathcal{O}\left(\frac{1}{\sqrt{nT}}\right)$ O ( 1 n T ) in the non-convex setting. This analysis also reveals crucial issues such as tighter upper bounds achieved with improved topological connectivity. Empirically, extensive experiments conducted on the MNIST, CIFAR10&100 datasets demonstrate the superior performance of our proposed algorithm compared to several existing SOTA optimizers in terms of generalization.

Förderung

  • National Key R&D Program of China
  • Shenzhen Basic Research Project (Natural Science Foundation) Basic Research Key Project
  • National Natural Science Foundation of China

Zitieren

APA

Li, Q., Zhang, M., Yin, N., Yin, Q., Shen, L., & Cao, X. (2025). Asymmetrically Decentralized Federated Learning. IEEE Transactions on Computers, 74(8), 2745-2756. https://doi.org/10.1109/tc.2025.3569185

Vancouver

Li Q, Zhang M, Yin N, Yin Q, Shen L, Cao X. Asymmetrically Decentralized Federated Learning. IEEE Transactions on Computers. 2025;74(8):2745-2756. doi:10.1109/tc.2025.3569185

BibTeX
@article{Li2025,
  author = {Li, Qinglun and Zhang, Miao and Yin, Nan and Yin, Quanjun and Shen, Li and Cao, Xiaochun},
  title = {Asymmetrically Decentralized Federated Learning},
  journal = {IEEE Transactions on Computers},
  year = {2025},
  volume = {74},
  number = {8},
  pages = {2745--2756},
  doi = {10.1109/tc.2025.3569185}
}
Kostenlos starten →