S-VOTE: Similarity-based Voting for Client Selection in Decentralized Federated Learning
Not on the map. Why?
Abstract (arXiv)
Decentralized Federated Learning (DFL) enables collaborative, privacy-preserving model training without relying on a central server. This decentralized approach reduces bottlenecks and eliminates single points of failure, enhancing scalability and resilience. However, DFL also introduces challenges such as suboptimal models with non-IID data distributions, increased communication overhead, and resource usage. Thus, this work proposes S-VOTE, a voting-based client selection mechanism that optimizes resource usage and enhances model performance in federations with non-IID data conditions. S-VOTE considers an adaptive strategy for spontaneous local training that addresses participation imbalance, allowing underutilized clients to contribute without significantly increasing resource costs. Extensive experiments on benchmark datasets demonstrate the S-VOTE effectiveness. More in detail, it achieves lower communication costs by up to 21%, 4-6% faster convergence, and improves local performance by 9-17% compared to baseline methods in some configurations, all while achieving a 14-24% energy consumption reduction. These results highlight the potential of S-VOTE to address DFL challenges in heterogeneous environments.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 23 references that are in the map. First posted on arXiv 31 Jan 2025.
Builds on
14 of 23 references.
References · 14
- 2019Advances and Open Problems in Federated Learningcited by 3,021
- 2019The Non-IID Data Quagmire of Decentralized Machine Learningcited by 303
- 2022Decentralized Federated Learning: Fundamentals, State of the Art, Frameworks, Trends, and Challengescited by 137
- 2022Client Selection in Federated Learning: Principles, Challenges, and Opportunitiescited by 62
- 2021Decentralized Federated Learning: Balancing Communication and Computing Costscited by 54
- 2023Fedstellar: A Platform for Decentralized Federated Learningcited by 14
- 2021Decentralized Personalized Federated Learning: Lower Bounds and Optimal Algorithm for All Personalization Modescited by 13
- 2022Find Your Friends: Personalized Federated Learning with the Right Collaboratorscited by 10
- 2023A Comprehensive Survey On Client Selections in Federated Learningcited by 6
- 2024DART: A Solution for Decentralized Federated Learning Model Robustness Analysiscited by 5
- 2024Decentralized Personalized Federated Learning based on a Conditional Sparse-to-Sparser Schemecited by 3
- 2024Smart Sampling: Helping from Friendly Neighbors for Decentralized Federated Learningcited by 2
Built on by
Not cited yet.