Optimal Client Selection of Federated Learning Based on Compressed Sensing

被引:0
作者
Li, Qing [1 ,2 ,3 ]
Lyu, Shanxiang [2 ]
Wen, Jinming [4 ]
机构
[1] Guangxi Univ Sci & Technol, Coll Comp Sci & Technol, Liuzhou 545006, Peoples R China
[2] Jinan Univ, Coll Cyber Secur, Guangzhou 510632, Peoples R China
[3] Guangxi Coll & Univ Key Lab Intelligent Comp & Dis, Liuzhou 545006, Peoples R China
[4] Jilin Univ, Dept Math, Changchun 130012, Peoples R China
基金
中国国家自然科学基金;
关键词
Convergence; Security; Matching pursuit algorithms; Protocols; Optimization; Data models; Computational modeling; Servers; Resilience; Federated learning; compressed sensing; optimal client selection; secure multi-party computation;
D O I
10.1109/TIFS.2025.3526050
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Federated learning faces challenges associated with privacy breaches, client communication efficiency, stragglers' effect, and heterogeneity. To address these challenges, this paper reformulates the optimal client selection problem as a sparse optimization task, proposes a secure and efficient optimal client selection method for federated learning, named secure orthogonal matching pursuit federated learning (SecOMPFL). Therein, we first introduce a method to identify correlations in the local model parameters of participating clients, addressing the issue of duplicated client contributions highlighted in recent literature. Next, we establish a secure variant of the OMP algorithm in compressed sensing using secure multiparty computation and propose a novel secure aggregation protocol. This protocol enhances the global model's convergence rate through sparse optimization techniques while maintaining privacy and security. It relies entirely on the local model parameters as inputs, minimizing client communication requirements. We also devise a client sampling strategy without requiring additional communication, resolving the bottleneck encountered by the optimal client selection policy. Finally, we introduce a strict yet inclusive straggler penalty strategy to minimize the impact of stragglers. Theoretical analysis confirms the security and convergence of SecOMPFL, highlighting its resilience to stragglers' effect and systematic/statistical heterogeneity with high client communication efficiency. Numerical experiments were conducted to compare the convergence rate and client communication efficiency of SecOMPFL with those of FedAvg, FOLB, and BN2. These experiments used natural and synthetic with statistical heterogeneity datasets, considering varying numbers of clients and client sampling scales. The results demonstrate that SecOMPFL achieves a competitive convergence rate, with communication overhead 39.96% lower than that of FOLB and 28.44% lower than that of BN2. Furthermore, SecOMPFL shows good resilience to statistical heterogeneity.
引用
收藏
页码:1679 / 1694
页数:16
相关论文
共 32 条
[31]   Homomorphic Encryption-Based Privacy-Preserving Federated Learning in IoT-Enabled Healthcare System [J].
Zhang, Li ;
Xu, Jianbo ;
Vijayakumar, Pandi ;
Sharma, Pradip Kumar ;
Ghosh, Uttam .
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2023, 10 (05) :2864-2880
[32]  
Zhu LG, 2019, ADV NEUR IN, V32