
In traditional centralized machine learning frameworks, the consolidation of all data in a central data center for processing poses significant concerns related to data privacy breaches and data sharing complexities. In contrast, federated learning presents a privacy-preserving paradigm by training models on local devices, thus circumventing the need for data transfer. However, in the case of non-IID (non-independent and identically distributed) data distribution, the performance of federated learning will drop. Addressing this predicament, this study introduces the FedSC algorithm as a remedy. The FedSC algorithm initially partitions clients into clusters based on the distribution of their data types. Within each cluster, clients exhibit comparable local optimal solutions, thus facilitating the aggregation of a superior global model. Moreover, the global model trained by the previous cluster serves as the initial model parameter for subsequent clusters, enabling the incorporation of data contributions from each cluster to foster the development of an enhanced global model. Experimental results corroborate the superiority of the FedSC algorithm over alternative federated learning approaches, particularly in non-IID data distributions, thereby establishing its capacity to achieve heightened accuracy.
Citation: Zhuang Wang, Renting Liu, Jie Xu, Yusheng Fu. FedSC: A federated learning algorithm based on client-side clustering[J]. Electronic Research Archive, 2023, 31(9): 5226-5249. doi: 10.3934/era.2023266
[1] | Honglei Wang, Wenliang Zeng, Xiaoling Huang, Zhaoyang Liu, Yanjing Sun, Lin Zhang . MTTLm6A: A multi-task transfer learning approach for base-resolution mRNA m6A site prediction based on an improved transformer. Mathematical Biosciences and Engineering, 2024, 21(1): 272-299. doi: 10.3934/mbe.2024013 |
[2] | Shanzheng Wang, Xinhui Xie, Chao Li, Jun Jia, Changhong Chen . Integrative network analysis of N6 methylation-related genes reveal potential therapeutic targets for spinal cord injury. Mathematical Biosciences and Engineering, 2021, 18(6): 8174-8187. doi: 10.3934/mbe.2021405 |
[3] | Pingping Sun, Yongbing Chen, Bo Liu, Yanxin Gao, Ye Han, Fei He, Jinchao Ji . DeepMRMP: A new predictor for multiple types of RNA modification sites using deep learning. Mathematical Biosciences and Engineering, 2019, 16(6): 6231-6241. doi: 10.3934/mbe.2019310 |
[4] | Yong Zhu, Zhipeng Jiang, Xiaohui Mo, Bo Zhang, Abdullah Al-Dhelaan, Fahad Al-Dhelaan . A study on the design methodology of TAC3 for edge computing. Mathematical Biosciences and Engineering, 2020, 17(5): 4406-4421. doi: 10.3934/mbe.2020243 |
[5] | Atefeh Afsar, Filipe Martins, Bruno M. P. M. Oliveira, Alberto A. Pinto . A fit of CD4+ T cell immune response to an infection by lymphocytic choriomeningitis virus. Mathematical Biosciences and Engineering, 2019, 16(6): 7009-7021. doi: 10.3934/mbe.2019352 |
[6] | Tamás Tekeli, Attila Dénes, Gergely Röst . Adaptive group testing in a compartmental model of COVID-19*. Mathematical Biosciences and Engineering, 2022, 19(11): 11018-11033. doi: 10.3934/mbe.2022513 |
[7] | Wenli Cheng, Jiajia Jiao . An adversarially consensus model of augmented unlabeled data for cardiac image segmentation (CAU+). Mathematical Biosciences and Engineering, 2023, 20(8): 13521-13541. doi: 10.3934/mbe.2023603 |
[8] | Tongmeng Jiang, Pan Jin, Guoxiu Huang, Shi-Cheng Li . The function of guanylate binding protein 3 (GBP3) in human cancers by pan-cancer bioinformatics. Mathematical Biosciences and Engineering, 2023, 20(5): 9511-9529. doi: 10.3934/mbe.2023418 |
[9] | Xin Yu, Jun Liu, Ruiwen Xie, Mengling Chang, Bichun Xu, Yangqing Zhu, Yuancai Xie, Shengli Yang . Construction of a prognostic model for lung squamous cell carcinoma based on seven N6-methylandenosine-related autophagy genes. Mathematical Biosciences and Engineering, 2021, 18(5): 6709-6723. doi: 10.3934/mbe.2021333 |
[10] | Tahir Rasheed, Faran Nabeel, Muhammad Bilal, Yuping Zhao, Muhammad Adeel, Hafiz. M. N. Iqbal . Aqueous monitoring of toxic mercury through a rhodamine-based fluorescent sensor. Mathematical Biosciences and Engineering, 2019, 16(4): 1861-1873. doi: 10.3934/mbe.2019090 |
In traditional centralized machine learning frameworks, the consolidation of all data in a central data center for processing poses significant concerns related to data privacy breaches and data sharing complexities. In contrast, federated learning presents a privacy-preserving paradigm by training models on local devices, thus circumventing the need for data transfer. However, in the case of non-IID (non-independent and identically distributed) data distribution, the performance of federated learning will drop. Addressing this predicament, this study introduces the FedSC algorithm as a remedy. The FedSC algorithm initially partitions clients into clusters based on the distribution of their data types. Within each cluster, clients exhibit comparable local optimal solutions, thus facilitating the aggregation of a superior global model. Moreover, the global model trained by the previous cluster serves as the initial model parameter for subsequent clusters, enabling the incorporation of data contributions from each cluster to foster the development of an enhanced global model. Experimental results corroborate the superiority of the FedSC algorithm over alternative federated learning approaches, particularly in non-IID data distributions, thereby establishing its capacity to achieve heightened accuracy.
The constituent members in a system mainly found in nature can be interacting with each other through cooperation and competition. Demonstrations for such systems involve biological species, countries, businesses, and many more. It's very much intriguing to investigate in a comprehensive manner numerous social as well as biological interactions existent in dissimilar species/entities utilizing mathematical modeling. The predation and the competition species are the most famous interactions among all such types of interactions. Importantly, Lotka [1] and Volterra [2] in the 1920s have announced individually the classic equations portraying population dynamics. Such illustrious equations are notably described as predator-prey (PP) equations or Lotka-Volterra (LV) equations. In this structure, PP/LV model represents the most influential model for interacting populations. The interplay between prey and predator together with additional factors has been a prominent topic in mathematical ecology for a long period. Arneodo et al. [3] have established in 1980 that a generalized Lotka-Volterra biological system (GLVBS) would depict chaos phenomena in an ecosystem for some explicitly selected system parameters and initial conditions. Additionally, Samardzija and Greller [4] demonstrated in 1988 that GLVBS would procure chaotic reign from the stabled state via rising fractal torus. LV model was initially developed as a biological concept, yet it is utilized in enormous diversified branches for research [5,6,7,8]. Synchronization essentially is a methodology of having different chaotic systems (non-identical or identical) following exactly a similar trajectory, i.e., the dynamical attributes of the slave system are locked finally into the master system. Specifically, synchronization and control have a wide spectrum for applications in engineering and science, namely, secure communication [9], encryption [10,11], ecological model [12], robotics [13], neural network [14], etc. Recently, numerous types of secure communication approaches have been explored [15,16,17,18] such as chaos modulation [18,19,20,21], chaos shift keying [22,23] and chaos masking [9,17,20,24]. In chaos communication schemes, the typical key idea for transmitting a message through chaotic/hyperchaotic models is that a message signal is nested in the transmitter system/model which originates a chaotic/ disturbed signal. Afterwards, this disturbed signal has been emitted to the receiver through a universal channel. The message signal would finally be recovered by the receiver. A chaotic model has been intrinsically employed both as receiver and transmitter. Consequently, this area of chaotic synchronization & control has sought remarkable considerations among differential research fields.
Most prominently, synchronization theory has been in existence for over 30 years due to the phenomenal research of Pecora and Carroll [25] established in 1990 using drive-response/master-slave/leader-follower configuration. Consequently, many authors and researchers have started introducing and studying numerous control and synchronization methods [9,26,27,28,29,30,31,32,33,34,35,36] etc. to achieve stabilized chaotic systems for possessing stability. In [37], researchers discussed optimal synchronization issues in similar GLVBSs via optimal control methodology. In [38,39], the researchers studied the adaptive control method (ACM) to synchronize chaotic GLVBSs. Also, researchers [40] introduced a combination difference anti-synchronization scheme in similar chaotic GLVBSs via ACM. In addition, authors [41] investigated a combination synchronization scheme to control chaos existing in GLVBSs using active control strategy (ACS). Bai and Lonngren [42] first proposed ACS in 1997 for synchronizing and controlling chaos found in nonlinear dynamical systems. Furthermore, compound synchronization using ACS was first advocated by Sun et al. [43] in 2013. In [44], authors discussed compound difference anti-synchronization scheme in four chaotic systems out of which two chaotic systems are considered as GLVBSs using ACS and ACM along with applications in secure communications of chaos masking type in 2019. Some further research works [45,46] based on ACS have been reported in this direction. The considered chaotic GLVBS offers a generalization that allows higher-order biological terms. As a result, it may be of interest in cases where biological systems experience cataclysmic changes. Unfortunately, some species will be under competitive pressure in the coming years and decades. This work may be comprised as a step toward preserving as many currently living species as possible by using the proposed synchronization approach which is based on master-slave configuration and Lyapunov stability analysis.
In consideration of the aforementioned discussions and observations, our primary focus here is to develop a systematic approach for investigating compound difference anti-synchronization (CDAS) approach in 4 similar chaotic GLVBSs via ACS. The considered ACS is a very efficient yet theoretically rigorous approach for controlling chaos found in GLVBSs. Additionally, in view of widely known Lyapunov stability analysis (LSA) [47], we discuss actively designed biological control law & convergence for synchronization errors to attain CDAS synchronized states.
The major attributes for our proposed research in the present manuscript are:
● The proposed CDAS methodology considers four chaotic GLVBSs.
● It outlines a robust CDAS approach based active controller to achieve compound difference anti-synchronization in discussed GLVBSs & conducts oscillation in synchronization errors along with extremely fast convergence.
● The construction of the active control inputs has been executed in a much simplified fashion utilizing LSA & master-salve/ drive-response configuration.
● The proposed CDAS approach in four identical chaotic GLVBSs of integer order utilizing ACS has not yet been analyzed up to now. This depicts the novelty of our proposed research work.
This manuscript is outlined as follows: Section 2 presents the problem formulation of the CDAS scheme. Section 3 designs comprehensively the CDAS scheme using ACS. Section 4 consists of a few structural characteristics of considered GLVBS on which CDAS is investigated. Furthermore, the proper active controllers having nonlinear terms are designed to achieve the proposed CDAS strategy. Moreover, in view of Lyapunov's stability analysis (LSA), we have examined comprehensively the biological controlling laws for achieving global asymptotical stability of the error dynamics for the discussed model. In Section 5, numerical simulations through MATLAB are performed for the illustration of the efficacy and superiority of the given scheme. Lastly, we also have presented some conclusions and the future prospects of the discussed research work in Section 6.
We here formulate a methodology to examine compound difference anti-synchronization (CDAS) scheme viewing master-slave framework in four chaotic systems which would be utilized in the coming up sections.
Let the scaling master system be
˙wm1= f1(wm1), | (2.1) |
and the base second master systems be
˙wm2= f2(wm2), | (2.2) |
˙wm3= f3(wm3). | (2.3) |
Corresponding to the aforementioned master systems, let the slave system be
˙ws4= f4(ws4)+U(wm1,wm2,wm3,ws4), | (2.4) |
where wm1=(wm11,wm12,...,wm1n)T∈Rn, wm2=(wm21,wm22,...,wm2n)T∈Rn, wm3=(wm31,wm32,...,wm3n)T∈Rn, ws4=(ws41,ws42,...,ws4n)T∈Rn are the state variables of the respective chaotic systems (2.1)–(2.4), f1,f2,f3,f4:Rn→Rn are four continuous vector functions, U=(U1,U2,...,Un)T:Rn×Rn×Rn×Rn→Rn are appropriately constructed active controllers.
Compound difference anti-synchronization error (CDAS) is defined as
E=Sws4+Pwm1(Rwm3−Qwm2), |
where P=diag(p1,p2,.....,pn),Q=diag(q1,q2,.....,qn),R=diag(r1,r2,.....,rn),S=diag(s1,s2,.....,sn) and S≠0.
Definition: The master chaotic systems (2.1)–(2.3) are said to achieve CDAS with slave chaotic system (2.4) if
limt→∞‖E(t)‖=limt→∞‖Sws4(t)+Pwm1(t)(Rwm3(t)−Qwm2(t))‖=0. |
We now present our proposed CDAS approach in three master systems (2.1)–(2.3) and one slave system (2.4). We next construct the controllers based on CDAS approach by
Ui= ηisi−(f4)i−KiEisi, | (3.1) |
where ηi=pi(f1)i(riwm3i−qiwm2i)+piwm1i(ri(f3)i−qi(f2)i), for i=1,2,...,n.
Theorem: The systems (2.1)–(2.4) will attain the investigated CDAS approach globally and asymptotically if the active control functions are constructed in accordance with (3.1).
Proof. Considering the error as
Ei= siws4i+piwm1i(riwm3i−qiwm2i),fori=1,2,3,.....,n. |
Error dynamical system takes the form
˙Ei= si˙ws4i+pi˙wm1i(riwm3i−qiwm2i)+piwm1i(ri˙wm3i−qi˙wm2i)= si((f4)i+Ui)+pi(f1)i(riwm3i−qiwm2i)+piwm1i(ri(f3)i−qi(f2)i)= si((f4)i+Ui)+ηi, |
where ηi=pi(f1)i(riwm3i−qiwm2i)+piwm1i(ri(f3)i−qi(f2)i), i=1,2,3,....,n. This implies that
˙Ei= si((f4)i−ηisi−(f4)i−KiEisi)+ηi= −KiEi | (3.2) |
The classic Lyapunov function V(E(t)) is described by
V(E(t))= 12ETE= 12ΣE2i |
Differentiation of V(E(t)) gives
˙V(E(t))=ΣEi˙Ei |
Using Eq (3.2), one finds that
˙V(E(t))=ΣEi(−KiEi)= −ΣKiE2i). | (3.3) |
An appropriate selection of (K1,K1,.......,Kn) makes ˙V(E(t)) of eq (3.3), a negative definite. Consequently, by LSA [47], we obtain
limt→∞Ei(t)=0,(i=1,2,3). |
Hence, the master systems (2.1)–(2.3) and slave system (2.4) have attained desired CDAS strategy.
We now describe GLVBS as the scaling master system:
{˙wm11=wm11−wm11wm12+b3w2m11−b1w2m11wm13,˙wm12=−wm12+wm11wm12,˙wm13=b2wm13+b1w2m11wm13, | (4.1) |
where (wm11,wm12,wm13)T∈R3 is state vector of (4.1). Also, wm11 represents the prey population and wm12, wm13 denote the predator populations. For parameters b1=2.9851, b2=3, b3=2 and initial conditions (27.5,23.1,11.4), scaling master GLVBS displays chaotic/disturbed behaviour as depicted in Figure 1(a).
The base master systems are the identical chaotic GLVBSs prescribed respectively as:
{˙wm21=wm21−wm21wm22+b3w2m21−b1w2m21wm23,˙wm22=−wm22+wm21wm22,˙wm23=b2wm23+b1w2m21wm23, | (4.2) |
where (wm21,wm22,wm23)T∈R3 is state vector of (4.2). For parameter values b1=2.9851, b2=3, b3=2, this base master GLVBS shows chaotic/disturbed behaviour for initial conditions (1.2,1.2,1.2) as displayed in Figure 1(b).
{˙wm31=wm31−wm31wm32+b3w2m31−b1w2m31wm33,˙wm32=−wm32+wm31wm32,˙wm33=b2wm33+b1w2m31wm33, | (4.3) |
where (wm31,wm32,wm33)T∈R3 is state vector of (4.3). For parameters b1=2.9851, b2=3, b3=2, this second base master GLVBS displays chaotic/disturbed behaviour for initial conditions (2.9,12.8,20.3) as shown in Figure 1(c).
The slave system, represented by similar GLVBS, is presented by
{˙ws41=ws41−ws41ws42+b3w2s41−b1w2s41ws43+U1,˙ws42=−ws42+ws41ws42+U2,˙ws43=b2ws43+b1w2s41ws43+U3, | (4.4) |
where (ws41,ws42,ws43)T∈R3 is state vector of (4.4). For parameter values, b1=2.9851, b2=3, b3=2 and initial conditions (5.1,7.4,20.8), the slave GLVBS exhibits chaotic/disturbed behaviour as mentioned in Figure 1(d).
Moreover, the detailed theoretical study for (4.1)–(4.4) can be found in [4]. Further, U1, U2 and U3 are controllers to be determined.
Next, the CDAS technique has been discussed for synchronizing the states of chaotic GLVBS. Also, LSA-based ACS is explored & the necessary stability criterion is established.
Here, we assume P=diag(p1,p2,p3), Q=diag(q1,q2,q3), R=diag(r1,r2,r3), S=diag(s1,s2,s3). The scaling factors pi,qi,ri,si for i=1,2,3 are selected as required and can assume the same or different values.
The error functions (E1,E2,E3) are defined as:
{E1=s1ws41+p1wm11(r1wm31−q1wm21),E2=s2ws42+p2wm12(r2wm32−q2wm22),E3=s3ws43+p3wm13(r3wm33−q3wm23). | (4.5) |
The major objective of the given work is the designing of active control functions Ui,(i=1,2,3) ensuring that the error functions represented in (4.5) must satisfy
limt→∞Ei(t)=0for(i=1,2,3). |
Therefore, subsequent error dynamics become
{˙E1=s1˙ws41+p1˙wm11(r1wm31−q1wm21)+p1wm11(r1˙wm31−q1˙wm21),˙E2=s2˙ws42+p2˙wm12(r2wm32−q2wm22)+p2wm12(r2˙wm32−q2˙wm22),˙E3=s3˙ws43+p3˙wm13(r3wm33−q3wm23)+p3wm13(r3˙wm33−q3˙wm23). | (4.6) |
Using (4.1), (4.2), (4.3), and (4.5) in (4.6), the error dynamics simplifies to
{˙E1=s1(ws41−ws41ws42+b3w2s41−b1w2s41ws43+U1)+p1(wm11−wm11wm12+b3w2m11−b1w2m11wm13)(r1wm31−q1wm21)+p1wm11(r1(wm31−wm31wm32+b3w2m31−b1w2m31wm33)−q1(wm21−wm21wm22+b3w2m21−b1w2m21wm23),˙E2=s2(−ws42+ws41ws42+U2)+p2(−wm12+wm11wm12)(r2wm32−q2wm22)+p2wm12(r2(−wm32+wm31wm32)−q2(−wm22+wm21wm22)),˙E3=s3(b2ws43+b1w2s41ws43+U3)+p3(b2wm13+b1w2m11wm13)(r3wm33−q3wm23)+p3wm13(r3(b2wm33+b1w2m31wm33)−q3(b2wm23+b1w2m21wm23)). | (4.7) |
Let us now choose the active controllers:
U1= η1s1−(f4)1−K1E1s1, | (4.8) |
where η1=p1(f1)1(r1wm31−q1wm21)+p1wm11(r1(f3)1−q1(f2)1), as described in (3.1).
U2= η2s2−(f4)2−K2E2s2, | (4.9) |
where η2=p2(f1)2(r2wm32−q2wm22)+p2wm12(r2(f3)2−q2(f2)2).
U3= η3s3−(f4)3−K3E3s3, | (4.10) |
where η3=p3(f1)3(r3wm33−q3wm23)+p3wm13(r3(f3)3−q3(f2)3) and K1>0,K2>0,K3>0 are gaining constants.
By substituting the controllers (4.8), (4.9) and (4.10) in (4.7), we obtain
{˙E1=−K1E1,˙E2=−K2E2,˙E3=−K3E3. | (4.11) |
Lyapunov function V(E(t)) is now described by
V(E(t))= 12[E21+E22+E23]. | (4.12) |
Obviously, the Lyapunov function V(E(t)) is +ve definite in R3. Therefore, the derivative of V(E(t)) as given in (4.12) can be formulated as:
˙V(E(t))= E1˙E1+E2˙E2+E3˙E3. | (4.13) |
Using (4.11) in (4.13), one finds that
˙V(E(t))= −K1E21−K2E22−K3E23<0, |
which displays that ˙V(E(t)) is -ve definite.
In view of LSA [47], we, therefore, understand that CDAS error dynamics is globally as well as asymptotically stable, i.e., CDAS error E(t)→0 asymptotically for t→∞ to each initial value E(0)∈R3.
This section conducts a few simulation results for illustrating the efficacy of the investigated CDAS scheme in identical chaotic GLVBSs using ACS. We use 4th order Runge-Kutta algorithm for solving the considered ordinary differential equations. Initial conditions for three master systems (4.1)–(4.3) and slave system (4.4) are (27.5,23.1,11.4), (1.2,1.2,1.2), (2.9,12.8,20.3) and (14.5,3.4,10.1) respectively. We attain the CDAS technique among three masters (4.1)–(4.3) and corresponding one slave system (4.4) by taking pi=qi=ri=si=1, which implies that the slave system would be entirely anti-synchronized with the compound of three master models for i=1,2,3. In addition, the control gains (K1,K2,K3) are taken as 2. Also, Figure 2(a)–(c) indicates the CDAS synchronized trajectories of three master (4.1)–(4.3) & one slave system (4.4) respectively. Moreover, synchronization error functions (E1,E2,E3)=(51.85,275.36,238.54) approach 0 as t tends to infinity which is exhibited via Figure 2(d). Hence, the proposed CDAS strategy in three masters and one slave models/systems has been demonstrated computationally.
In this work, the investigated CDAS approach in similar four chaotic GLVBSs using ACS has been analyzed. Lyapunov's stability analysis has been used to construct proper active nonlinear controllers. The considered error system, on the evolution of time, converges to zero globally & asymptotically via our appropriately designed simple active controllers. Additionally, numerical simulations via MATLAB suggest that the newly described nonlinear control functions are immensely efficient in synchronizing the chaotic regime found in GLVBSs to fitting set points which exhibit the efficacy and supremacy of our proposed CDAS strategy. Exceptionally, both analytic theory and computational results are in complete agreement. Our proposed approach is simple yet analytically precise. The control and synchronization among the complex GLVBSs with the complex dynamical network would be an open research problem. Also, in this direction, we may extend the considered CDAS technique on chaotic systems that interfered with model uncertainties as well as external disturbances.
The authors gratefully acknowledge Qassim University, represented by the Deanship of Scientific Research, on the financial support for this research under the number 10163-qec-2020-1-3-I during the academic year 1441 AH/2020 AD.
The authors declare there is no conflict of interest.
[1] |
K. Bayoumy, M. Gaber, A. Elshafeey, O. Mhaimeed, M. B. Elshazly, F. A. Marvel, et al., Smart wearable devices in cardiovascular care: where we are and how to move forward, Nat. Rev. Cardiol., 18 (2021), 581–599. https://doi.org/10.1038/s41569-021-00522-7 doi: 10.1038/s41569-021-00522-7
![]() |
[2] |
M. Y. Jeng, T. M. Yeh, F. Y. Pai, Analyzing older adults' perceived values of using smart bracelets by means–end chain, Healthcare, 8 (2020), 494. https://doi.org/10.3390/healthcare8040494 doi: 10.3390/healthcare8040494
![]() |
[3] |
Z. Lv, L. Qiao, M. S. Hossain, B. J. Choi, Analysis of using blockchain to protect the privacy of drone big data, IEEE Network, 35 (2021), 44–49. https://doi.org/10.1109/MNET.011.2000154 doi: 10.1109/MNET.011.2000154
![]() |
[4] |
M. Amiri-Zarandi, R. A. Dara, E. Fraser, A survey of machine learning-based solutions to protect privacy in the internet of things, Comput. Secur., 96 (2020), 101921. https://doi.org/10.1016/j.cose.2020.101921 doi: 10.1016/j.cose.2020.101921
![]() |
[5] | Q. Li, Y. Diao, Q. Chen, B. He, Federated learning on non-IID data silos: an experimental study, in 2022 IEEE 38th International Conference on Data Engineering (ICDE), (2022), 965–978. https://doi.org/10.1109/ICDE53745.2022.00077 |
[6] | B. Mcmahan, E. Moore, D. Ramage, S. Hampson, B. Arcas, Communication-efficient learning of deep networks from decentralized data, in Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 54 (2017), 1273–1282. Available from: https://proceedings.mlr.press/v54/mcmahan17a.html. |
[7] |
C. Zhang, Y. Xie, H. Bai, B. Yu, W. Li, Y. Gao, A survey on federated learning, Knowledge-Based Syst., 216 (2021), 106775. https://doi.org/10.1016/j.knosys.2021.106775 doi: 10.1016/j.knosys.2021.106775
![]() |
[8] | S. Truex, N. Baracaldo, A. Anwar, T. Steinke, H. Ludwig, R. Zhang, et al., A hybrid approach to privacy-preserving federated learning, in Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security, (2019), 1–11. https://doi.org/10.1145/3338501.3357370 |
[9] |
B. Yu, W. Mao, Y. Lv, C. Zhang, Y. Xie, A survey on federated learning in data mining, Wiley Interdiscip. Rev.: Data Min. Knowl. Discovery, 12 (2022), e1443. https://doi.org/10.1002/widm.1443 doi: 10.1002/widm.1443
![]() |
[10] | S. Aich, N. K. Sinai, S. Kumar, M. Ali, H. C. Kim, M. Joo, et al., Protecting personal healthcare record using blockchain & federated learning technologies, in 2022 24th International Conference on Advanced Communication Technology (ICACT), (2022), 109–112. https://doi.org/10.23919/ICACT53585.2022.9728772 |
[11] |
T. Li, A. K. Sahu, A. Talwalkar, V. Smith, Federated learning: challenges, methods, and future directions, IEEE Signal Process Mag., 37 (2020), 50–60. https://doi.org/10.1109/MSP.2020.2975749 doi: 10.1109/MSP.2020.2975749
![]() |
[12] |
X. Yin, Y. Zhu, J. Hu, A comprehensive survey of privacy-preserving federated learning: a taxonomy, review, and future directions, ACM Comput. Surv., 54 (2021), 1–36. https://doi.org/10.1145/3460427 doi: 10.1145/3460427
![]() |
[13] | T. Nishio, R. Yonetani, Client selection for federated learning with heterogeneous resources in mobile edge, in ICC 2019 - 2019 IEEE International Conference on Communications (ICC), (2019), 1–7. https://doi.org/10.1109/ICC.2019.8761315 |
[14] | Z. Chai, H. Fayyaz, Z. Fayyaz, A. Anwar, Y. Zhou, N. Baracaldo, et al., Towards taming the resource and data heterogeneity in federated learning, in 2019 USENIX Conference on Operational Machine Learning (OpML 19), (2019), 19–21. Available from: https://www.usenix.org/conference/opml19/presentation/chai. |
[15] |
Y. Jiang, G. Xu, Z. Fang, S. Song, B. Li, Heterogeneous fairness algorithm based on federated learning in intelligent transportation system, J. Comput. Methods Sci. Eng., 21 (2021), 1365–1373. https://doi.org/10.3233/JCM-214991 doi: 10.3233/JCM-214991
![]() |
[16] | E. Diao, J. Ding, V. Tarokh, Heterofl: computation and communication efficient federated learning for heterogeneous clients, preprint, arXiv: 2010.01264. |
[17] | T. Li, A. K. Sahu, M. Zaheer, M. Sanjabi, A. Talwalkar, V. Smith, Federated optimization in heterogeneous networks, in Proceedings of Machine Learning and Systems, 2 (2020), 429–450. Available from: https://proceedings.mlsys.org/paper_files/paper/2020/file/1f5fe83998a09396ebe6477d9475ba0c-Paper.pdf. |
[18] | H. B. Mcmahan, E. Moore, D. Ramage, B. Arcas, Federated learning of deep networks using model averaging, preprint, arXiv: 1602.05629. |
[19] |
P. Kairouz, H. B. McMahan, B. Avent, A. Bellet, M. Bennis, A. N. Bhagoji, et al., Advances and open problems in federated learning, Found. Trends Mach. Learn., 14 (2021), 1–210. http://dx.doi.org/10.1561/2200000083 doi: 10.1561/2200000083
![]() |
[20] |
Q. Li, Z. Wen, Z. Wu, S. Hu, N. Wang, Y. Li, et al., A survey on federated learning systems: vision, hype and reality for data privacy and protection, IEEE Trans. Knowl. Data Eng., 35 (2021), 3347–3366. https://doi.org/10.1109/TKDE.2021.3124599 doi: 10.1109/TKDE.2021.3124599
![]() |
[21] |
Q. Yang, Y. Liu, T. Chen, Y. Tong, Federated machine learning: concept and applications, ACM Trans. Intell. Syst. Technol., 10 (2019), 1–19. https://doi.org/10.1145/3298981 doi: 10.1145/3298981
![]() |
[22] | J. Wang, Q. Liu, H. Liang, G. Joshi, H. V. Poor, Tackling the objective inconsistency problem in heterogeneous federated optimization, in Advances in Neural Information Processing Systems, 33 (2020), 7611–7623. |
[23] | S. P. Karimireddy, S. Kale, M. Mohri, S. J. Reddi, S. U. Stich, A. T. Suresh, Scaffold: stochastic controlled averaging for on-device federated learning, in Proceedings of the 37th International Conference on Machine Learning, 119 (2020), 5132–5143. Available from: https://proceedings.mlr.press/v119/karimireddy20a.html. |
[24] | Y. Esfandiari, S. Y. Tan, Z. Jiang, A. Balu, E. Herron, C. Hegde, et al., Cross-gradient aggregation for decentralized learning from non-IID data, in Proceedings of the 38th International Conference on Machine Learning, 139 (2021), 3036–3046. Available from: https://proceedings.mlr.press/v139/esfandiari21a.html. |
[25] | E. O. Box, K. Fujiwara, Vegetation types and their broad-scale distribution, in Vegetation Ecology, (2013), 455–485. https://doi.org/10.1002/9781118452592.ch15 |
[26] |
S. Hu, Y. Li, X. Liu, Q. Li, Z. Wu, B. He, The oarf benchmark suite: characterization and implications for federated learning systems, ACM Trans. Intell. Syst. Technol., 13 (2022), 1–32. https://doi.org/10.1145/3510540 doi: 10.1145/3510540
![]() |
[27] | M. Yurochkin, M. Agarwal, S. Ghosh, K. Greenewald, N. Hoang, Y. Khazaeni, Bayesian nonparametric federated learning of neural networks, in Proceedings of the 36th International Conference on Machine Learning, 97 (2019), 7252–7261. Available from: https://proceedings.mlr.press/v97/yurochkin19a.html. |
[28] | H. Wang, M. Yurochkin, Y. Sun, D. Papailiopoulos, Y. Khazaeni, Federated learning with matched averaging, preprint, arXiv: 2002.06440. |
[29] | T. Hsu, H. Qi, M. Brown, Measuring the effects of non-identical data distribution for federated visual classification, preprint, arXiv: 1909.06335. |
[30] | X. Li, K. Huang, W. Yang, S. Wang, Z. Zhang, On the convergence of fedavg on non-IID data, preprint, arXiv: 1907.02189. |
[31] | D. Acar, Y. Zhao, R. M. Navarro, M. Mattina, P. N. Whatmough, V. Saligrama, Federated learning based on dynamic regularization, preprint, arXiv: 2111.04263. |
[32] | Q. Li, B. He, D. Song, Model-contrastive federated learning, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2021), 10713–10722. |
[33] | X. Li, M. Jiang, X. Zhang, M. Kamp, Q. Dou, Fedbn: federated learning on non-IID features via local batch normalization, preprint, arXiv: 2102.07623. |
[34] | L. Wang, S. Xu, X. Wang, Q. Zhu, Addressing class imbalance in federated learning, in Proceedings of the AAAI Conference on Artificial Intelligence, 35 (2021), 10165–10173. https://doi.org/10.1609/aaai.v35i11.17219 |
[35] |
S. Liu, J. Yu, X. Deng, S. Wan, Fedcpf: an efficient-communication federated learning approach for vehicular edge computing in 6G communication networks, IEEE Trans. Intell. Transp. Syst., 23 (2021), 1616–1629. https://doi.org/10.1109/TITS.2021.3099368 doi: 10.1109/TITS.2021.3099368
![]() |
[36] | Y. Zhao, M. Li, L. Lai, N. Suda, D. Civin, V. Chandra, Federated learning with non-IID data, preprint, arXiv: 1806.00582. |
[37] | N. Yoshida, T. Nishio, M. Morikura, K. Yamamoto, R. Yonetani, Hybrid-FL for wireless networks: cooperative learning mechanism using non-IID data, in ICC 2020 - 2020 IEEE International Conference on Communications (ICC), (2020), 1–7. https://doi.org/10.1109/ICC40277.2020.9149323 |
[38] |
F. Sattler, K. R. Muller, W. Samek, Clustered federated learning: model-agnostic distributed multitask optimization under privacy constraints, IEEE Trans. Neural Networks Learn. Syst., 32 (2020), 3710–3722. https://doi.org/10.1109/TNNLS.2020.3015958 doi: 10.1109/TNNLS.2020.3015958
![]() |
[39] | Z. Chai, A. Ali, S. Zawad, S. Truex, A. Anwar, N. Baracaldo, et al., Tifl: a tier-based federated learning system, in Proceedings of the 29th International Symposium on High-Performance Parallel and Distributed Computing, (2020), 125–136. https://doi.org/10.1145/3369583.3392686 |
[40] |
Y. Lecun, L. Bottou, Y. Bengio, P. Haffner, Gradient-based learning applied to document recognition, Proc. IEEE, 86 (1998), 2278–2324. https://doi.org/10.1109/5.726791 doi: 10.1109/5.726791
![]() |
[41] | H. Xiao, K. Rasul, R. Vollgraf, Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms, preprint, arXiv: 1708.07747. |
[42] | R. Panigrahi, S. Borah, A detailed analysis of cicids2017 dataset for designing intrusion detection systems, Int. J. Eng. Technol., 7 (2018), 479–482. |
[43] | L. Muñoz-González, K. T. Co, E. C. Lupu, Byzantine-robust federated machine learning through adaptive model averaging, preprint, arXiv: 1909.05125. |
[44] | P. Blanchard, E. Mhamdi, R. Guerraoui, J. Stainer, Machine learning with adversaries: byzantine tolerant gradient descent, in Advances in Neural Information Processing Systems, 30 (2017). Available from: https://proceedings.neurips.cc/paper_files/paper/2017/file/f4b9ec30ad9f68f89b29639786cb62ef-Paper.pdf. |
[45] | K. Varma, Y. Zhou, N. Baracaldo, A. Anwar, Legato: a layerwise gradient aggregation algorithm for mitigating byzantine attacks in federated learning, in 2021 IEEE 14th International Conference on Cloud Computing (CLOUD), (2021), 272–277. https://doi.org/10.1109/CLOUD53861.2021.00040 |
[46] |
K. Zhang, W. Zuo, Y. Chen, D. Meng, L. Zhang, Beyond a gaussian denoiser: residual learning of deep cnn for image denoising, IEEE Trans. Image Process., 26 (2017), 3142–3155. https://doi.org/10.1109/TIP.2017.2662206 doi: 10.1109/TIP.2017.2662206
![]() |
1. | Muhammad Zubair Mehboob, Arslan Hamid, Jeevotham Senthil Kumar, Xia Lei, Comprehensive characterization of pathogenic missense CTRP6 variants and their association with cancer, 2025, 25, 1471-2407, 10.1186/s12885-025-13685-0 |