Communication-Efficient Federated Learning with Adaptive Number of Participants
Sergey Skorik, Vladislav Dorofeev, Gleb Molodtsov, Aram Avetisyan, Dmitry Bylinkin, Daniil Medyakov, Aleksandr Beznosikov

TL;DR
This paper proposes an adaptive participant selection mechanism in federated learning to improve communication efficiency, demonstrating up to 30% savings without accuracy loss across various applications.
Contribution
It introduces ISP, a novel adaptive method for dynamically choosing the number of clients per round in federated learning, addressing a largely unexplored problem.
Findings
Achieves up to 30% communication savings
Maintains model accuracy with fewer clients
Effective across diverse real-world applications
Abstract
Rapid scaling of deep learning models has enabled performance gains across domains, yet it introduced several challenges. Federated Learning (FL) has emerged as a promising framework to address these concerns by enabling decentralized training. Nevertheless, communication efficiency remains a key bottleneck in FL, particularly under heterogeneous and dynamic client participation. Existing methods, such as FedAvg and FedProx, or other approaches, including client selection strategies, attempt to mitigate communication costs. However, the problem of choosing the number of clients in a training round remains extremely underexplored. We introduce Intelligent Selection of Participants (ISP), an adaptive mechanism that dynamically determines the optimal number of clients per round to enhance communication efficiency without compromising model accuracy. We validate the effectiveness of ISP…
Peer Reviews
Decision·Submitted to ICLR 2026
- **S1:** Clearly motivated and easy to integrate into existing FL systems. - **S2:** Consistent gains in communication efficiency across tasks and datasets. - **S3:** Works with client selection and compression methods. - **S4:** Thorough experimental coverage, including a large ECG setup.
- **W1:** Requires synchronized or full-client intermediate rounds, which limit scalability. - **W2:** No theoretical analysis of convergence or stability. - **W3:** ISP highlights a neglected dimension of FL optimization: dynamically adjusting client count to balance efficiency and performance. While conceptually straightforward, it’s practical and general, requiring no client-side changes. The contribution is incremental but relevant to real-world FL deployments. - **W4:** Modest conceptual n
1. ISP formalizes the round-wise choice of the number of participants as a constrained problem, selecting the smallest value that achieves expected loss decrease. 2. The framework is compatible with popular FL algorithms and requires no changes to client optimizers, enabling easy integration with standard FL pipelines.
--Unmitigated ISP overhead restricts edge use. The Monte-Carlo approach in ISP introduces heavy computational overhead, which is not fully mitigated and may limit applicability in resource-constrained edge environments. --No comprehensive analysis of ISP hyperparameter impact. ISP relies on multiple hyperparameters (e.g., window Δ, momentum β, resolution ω), but the paper lacks a comprehensive analysis of how these parameters affect performance across different FL scenarios. --Limited Theoreti
- This paper proposed the approach to determine the optimal number of participating clients per round. This adaptive viewpoint expands the optimization scope of FL and directly addresses communication bottlenecks. - Extensive experiments on both standard benchmarks (CIFAR-10, Tiny-ImageNet) and a large-scale, real-world ECG dataset substantiate ISP’s practical relevance. The reported 30% communication reduction with comparable or better accuracy is a outcome. - The authors include detailed ablat
- The proposed intermediate full-client communication step (Algorithm 2) contradicts the goal of communication efficiency, especially for large-scale networks. Though amortized over delta rounds, it still introduces a potential scalability concern. - ISP partially mitigates communication costs, but its performance still depends on user-defined parameters, which may affect the results of dynamic selection.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Wireless Communication Security Techniques · Cooperative Communication and Network Coding
