View full-text article in PMC Entropy (Basel). 2021 Oct 27;23(11):1413. doi: 10.3390/e23111413 Search in PMC Search in PubMed View in NLM Catalog Add to search Copyright and License information © 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). PMC Copyright notice Algorithm 1: FL Model Compression 1:Input:WI 2:forτ∈{1,…,T}do 3: for n∈{1,…,N} do 4: Client n does: 5: (WCt−1,M)←DownloadBS→n(WCt−1) 6: Wnt←WCt−1+(1−M)⊗Wnt−1 7: Gnt←Train(Wnt,Dn)+Rnt−1−Wnt 8: Mn←Compress(Gnt) 9: Gn,Ct←Gnt⊗Mn 10: Wn,Ct←Wnt⊗Mn 11: Rnt←Gnt−Gn,Ct 12: Save(Rnt,Wnt) 13: Uploadn→BS(Wn,Ct) 14: end for 15: BS does: 16: for n∈S=S1∪S2 do 17: (Wn,Ct,Mn)←Wn,Ct 18: end for 19: WCt←Aggregate(1|S|∑n∈SWn,Ct)+Rt−1 20: Wt←WCt+(1−M1)⊗(1−M2)⋯⊗(1−Mn)⊗Wt−1 21: Gt←Wt−Wt−1 22: M←Compress(Gt) 23: GCt←Gt⊗M 24: WCt←Wt⊗M 25: Rt←Gt−GCt 26: Save(Rt,Wt) 27: TransmitsBS→n(WCt) 28:end for 29:ReturnWF