IP Library › Granted Patent US 12,393,883
Granted Patent B2
US 12,393,883 · App. 17/122,475 · Granted Aug 19, 2025

Adaptively synchronizing learning of multiple learning models

Inventors: Vishesh Garg (Bangalore Karnataka, IN); Sathyanarayanan Manamohan (Bangalore Karnataka, IN); Krishnaprasad Lingadahalli Shastry (Bangalore Karnataka, IN)
Assignee: Hewlett Packard Enterprise Development LP
G06N20/20G06F9/3891G06F17/18
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,393,883
App. No.
17/122,475
Granted
Aug 19, 2025
Kind
B2
Abstract

A system and a method for adaptively synchronizing learning of multiple learning models are disclosed. Several local learning models are executed on multiple nodes. Learning model parameters are shared by such nodes to a master node, in multiple iterations, after a predefined synchronization interval. Such learning model parameters are aggregated and central learning models are generated based on aggregated set of learning model parameters. Accuracies of the central learning models and an average accuracy of the central learning models are determined. Accuracy of an immediate central learning model i.e. the one received after determining the average accuracy, is compared with the average accuracy. Based on the difference between the accuracy of the immediate central learning model and the average accuracy, the synchronization interval is modified, and the multiple nodes are updated about this modified synchronization interval.

Claims (56)

1. A system, comprising:

a memory;

a processor that is configured to execute machine readable instructions stored in the memory to transmit communications between a plurality of data processing nodes and a master node;

the plurality of data processing nodes programmed to run a plurality of local learning models; and

the master node programmed to communicate with the plurality of data processing nodes to:

iteratively receive, by the master node over a predefined synchronization interval, a set of learning model weights from the plurality of data processing nodes, wherein the predefined synchronization interval is stored as an integer value at the master node;

aggregate, by the master node, the set of learning model weights received iteratively from the plurality of data processing nodes, after a predefined synchronization interval, wherein the set of learning model weights are received for a predefined number of iterations;

generate central learning models based on the aggregated set of learning model weights received after each of the predefined number of iterations;

generate an average accuracy value associated with the central learning models;

determine a difference between an accuracy of a central learning model and the average accuracy value;

update an accuracy metric based on the difference between the accuracy of the central model and the average accuracy value;

compare the accuracy metric to a range established by a set of thresholds; and

when the accuracy metric is outside of the range established by the set of thresholds, downscale, in accordance with the integer value, the predefined synchronization interval by a predefined scaling factor that increases sharing of the set of learning model weights by the data processing nodes.

2. The system of claim 1 , wherein the accuracy metric is represented as Mean Squared Errors (MSEs).

3. The system of claim 1 , wherein the average accuracy value associated with the central learning models and the accuracy of the central learning model are determined based on results obtained by implementation of the central learning models and the central learning model on pre-stored evaluation data.

4. The system of claim 1 , wherein the predefined synchronization interval is up-scaled by the predefined scaling factor when the accuracy metric exceeds the range established by the set of thresholds.

5. The system of claim 1 , wherein the master node and the plurality of data processing nodes are a part of a decentralized data processing network or a distributed data processing network.

6. A method, comprising:

periodically receiving, at a master node of a plurality of data processing nodes, a set of learning model weights from each node of the plurality of data processing nodes,

wherein the each successive set of learning model weights from the respective nodes are iteratively received after a predefined synchronization interval, wherein the predefined synchronization interval is stored as an integer value at the master node, and wherein the set of learning model weights are received for a predefined number of iterations;

aggregating, after each of the predefined number of iterations, the set of learning model weights received after the predefined synchronization interval;

generating central learning models based on the aggregated set of learning model weights received after each of the predefined number of iterations;

generating an average accuracy value associated with the central learning models;

determining a difference between an accuracy of a central learning model and the average accuracy value;

comparing the difference in accuracy to a set of thresholds;

when the difference in accuracy is outside of a range established by the set of thresholds, downscaling, in accordance with the integer value, the predefined synchronization interval by a predefined scaling factor that increases sharing of the set of learning model weights by the data processing nodes modifying the predefined synchronization interval; and

transmitting, to the plurality of data processing nodes, the modified synchronization interval.

7. The method of claim 6 , wherein the accuracy is represented as Mean Squared Errors (MSEs).

8. The method of claim 6 , wherein the average accuracy value associated with the central learning models and the accuracy of the central learning model are determined based on results obtained by implementation of the central learning models and the central learning model on pre-stored evaluation data.

9. The method of claim 6 , wherein the predefined synchronization interval is modified by the master node elected amongst the plurality of data processing nodes.

10. The method of claim 6 , wherein the synchronization interval is up-scaled by the predefined scaling factor when the difference in accuracy exceeds the range established by the set of thresholds.

11. The method of claim 6 , wherein the master node and the plurality of data processing nodes are a part of a decentralized data processing network or a distributed data processing network.

12. A non-transitory machine-readable storage medium that stores instructions which, when executed by a processor, perform a plurality of operations comprising:

receiving a set of learning model weights iteratively from each node of a plurality of data processing nodes, wherein the set of learning model weights is received after a predefined synchronization interval, wherein the predefined synchronization interval is stored as an integer value at the master node, and wherein the set of learning model weights are received for a predefined number of iterations;

generating central learning models based on the set of learning model weights received after each of the predefined number of iterations;

generating an average accuracy value associated with the central learning models;

determining a difference between an accuracy of a central learning model and the average accuracy value;

comparing the difference in accuracy to a range established by a set of thresholds;

when the difference in accuracy is outside of the range, downscaling, in accordance with the integer value, the predefined synchronization interval by a predefined scaling factor that increases sharing of the set of learning model weights by the data processing nodes; and

transmitting, to the plurality of data processing nodes, the modified predefined synchronization interval.

13. The system of claim 1 , wherein the set of learning model weights indicate a level of learning achieved by the plurality of data processing nodes.

14. The system of claim 1 , wherein the master node is further programmed to:

receive pre-stored evaluation data;

generate, using the central learning model, an inferred label of the pre-stored evaluation data; and

store the inferred label of the pre-stored evaluation data with the master node.

15. The system of claim 1 , wherein the master node is further programmed to:

identify common data in the set of learning model weights.

16. The system of claim 1 , wherein the master node is further programmed to:

adjust the predefined synchronization interval by the predefined scaling factor to reduce a frequency of synchronization of the plurality of local learning models with the master node.

17. The system of claim 1 , wherein the master node is further programmed to:

plot a learning curve that illustrates results obtained upon synchronization of the set of learning models.

18. The system of claim 1 , wherein the plurality of data processing nodes use an Application Programming Interface (API) to communicate with the master node.

19. The system of claim 1 , wherein the set of learning model weights is averaged and aggregated by the master node.

20. The system of claim 1 , wherein the master node is further programmed to:

determine that the predefined synchronization interval has expired for the iteration; and

in response to the predefined synchronization interval expiring, trigger the aggregation and averaging of the set of learning model weights.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 1, 2022
From: ARUBA NETWORKS, LLC
To: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Reel/Frame 061037/0605 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 21, 2021
From: GARG, VISHESH; MANAMOHAN, SATHYANARAYANAN; SHASTRY, KRISHNA PRASAD LINGADAHALLI
To: ARUBA NETWORKS, INC.
Reel/Frame 057541/0742 →
Priority Claims (1)
IN 202041004375 · Jan 31, 2020 · national
Continuity (1)
Related Publication 20210241183A1 · Aug 5, 2021
References Cited (169)
US 6363416B1 · Naeimi · 2002 [cited by examiner]
US 9413779B2 · Vasseur et al. · 2016 [cited by applicant]
US 9569517B1 · Smola et al. · 2017 [cited by applicant]
US 9633315B2 · Chapelle et al. · 2017 [cited by applicant]
US 9779557B2 · Hauser et al. · 2017 [cited by applicant]
US 9875510B1 · Kasper · 2018 [cited by applicant]
US 10057243B1 · Kumar et al. · 2018 [cited by applicant]
US 10360500B2 · Kabul et al. · 2019 [cited by applicant]
US 10547679B1 · Burnett et al. · 2020 [cited by applicant]
US 10671435B1 · Gold et al. · 2020 [cited by applicant]
US 11201747B2 · Scherrer et al. · 2021 [cited by applicant]
US 11334817B2 · Wang et al. · 2022 [cited by applicant]
US 20120039473A1 · Gentry et al. · 2012 [cited by applicant]
US 20130290223A1 · Chapelle et al. · 2013 [cited by applicant]
US 20150193697A1 · Vasseur et al. · 2015 [cited by applicant]
US 20150324690A1 · Chilimbi et al. · 2015 [cited by applicant]
US 20150332283A1 · Witchey · 2015 [cited by applicant]
US 20150379072A1 · Dirac et al. · 2015 [cited by applicant]
US 20160087854A1 · Jayanti et al. · 2016 [cited by applicant]
US 20160179835A1 · Mika et al. · 2016 [cited by applicant]
US 20160217388A1 · Okanohara et al. · 2016 [cited by applicant]
US 20160261690A1 · Ford · 2016 [cited by applicant]
US 20160299918A1 · Ford · 2016 [cited by applicant]
US 20160335533A1 · Davis et al. · 2016 [cited by applicant]
US 20170060988A1 · Kudo et al. · 2017 [cited by applicant]
US 20170091397A1 · Shah · 2017 [cited by applicant]
US 20170103468A1 · Orsini et al. · 2017 [cited by applicant]
US 20170116693A1 · Rae et al. · 2017 [cited by applicant]
US 20170134158A1 · Pasol et al. · 2017 [cited by applicant]
US 20170140145A1 · Shah · 2017 [cited by applicant]
US 20170169358A1 · Choi et al. · 2017 [cited by applicant]
US 20170220949A1 · Feng et al. · 2017 [cited by applicant]
US 20170272342A1 · Zessin et al. · 2017 [cited by applicant]
US 20170279774A1 · Booz et al. · 2017 [cited by applicant]
US 20170289111A1 · Voell et al. · 2017 [cited by applicant]
US 20170302663A1 · Nainar et al. · 2017 [cited by applicant]
US 20180018590A1 · Szeto et al. · 2018 [cited by applicant]
US 20180039667A1 · Pierce et al. · 2018 [cited by applicant]
US 20180089683A1 · Setty et al. · 2018 [cited by applicant]
US 20180157688A1 · Zessin et al. · 2018 [cited by applicant]
US 20180183768A1 · Lobban et al. · 2018 [cited by applicant]
US 20180217905A1 · Reza et al. · 2018 [cited by applicant]
US 20180247191A1 · Katz et al. · 2018 [cited by applicant]
US 20180276626A1 · Laiben · 2018 [cited by applicant]
US 20180331897A1 · Zhang et al. · 2018 [cited by applicant]
US 20190020629A1 · Baird et al. · 2019 [cited by applicant]
US 20190042407A1 · Gao et al. · 2019 [cited by applicant]
US 20190089716A1 · Carsten · 2019 [cited by applicant]
US 20190138929A1 · Wong et al. · 2019 [cited by applicant]
US 20190147532A1 · Singh et al. · 2019 [cited by applicant]
US 20190182030A1 · Jo · 2019 [cited by applicant]
US 20190182231A1 · Harrer et al. · 2019 [cited by applicant]
US 20190236598A1 · Padmanabhan · 2019 [cited by applicant]
US 20190268284A1 · Karame et al. · 2019 [cited by applicant]
US 20190287026A1 · Calmon et al. · 2019 [cited by applicant]
US 20190295000A1 · Candel et al. · 2019 [cited by applicant]
US 20190317934A1 · Jentzsch et al. · 2019 [cited by applicant]
US 20190325432A1 · Ow et al. · 2019 [cited by applicant]
US 20190332921A1 · Rodriguez · 2019 [cited by applicant]
US 20190332955A1 · Manamohan et al. · 2019 [cited by applicant]
US 20190332966A1 · Gidney · 2019 [cited by applicant]
US 20190347540A1 · Yim et al. · 2019 [cited by applicant]
US 20200042362A1 · Cui et al. · 2020 [cited by applicant]
US 20200050494A1 · Bartfai-Walcott et al. · 2020 [cited by applicant]
US 20200057920A1 · Collins et al. · 2020 [cited by applicant]
US 20200193292A1 · Weng et al. · 2020 [cited by applicant]
US 20200218940A1 · Anglin et al. · 2020 [cited by applicant]
US 20200242511A1 · Kale · 2020 [cited by examiner]
US 20200244435A1 · Shpurov et al. · 2020 [cited by applicant]
US 20200272845A1 · He · 2020 [cited by examiner]
US 20200311617A1 · Swan · 2020 [cited by examiner]
US 20200348662A1 · Cella et al. · 2020 [cited by applicant]
US 20210019630A1 · Yao · 2021 [cited by examiner]
US 20210134095A1 · Milt et al. · 2021 [cited by applicant]
US 20210287080A1 · Moloney · 2021 [cited by examiner]
US 20220261634A1 · Liu · 2022 [cited by examiner]
US 20220344060A1 · Kristal · 2022 [cited by examiner]
US 20230010095A1 · Alabbasi · 2023 [cited by examiner]
US 20230041118A1 · Imabayashi et al. · 2023 [cited by applicant]
AU 2017100968A4 · 2017 [cited by applicant]
CN 105488675A · 2016 [cited by applicant]
CN 106228446A · 2016 [cited by applicant]
CN 106445711A · 2017 [cited by applicant]
CN 106656798A · 2017 [cited by applicant]
CN 106911513A · 2017 [cited by applicant]
CN 107103087A · 2017 [cited by applicant]
CN 107332900A · 2017 [cited by applicant]
CN 107395349A · 2017 [cited by applicant]
CN 107395353A · 2017 [cited by applicant]
CN 107579848 · 2018 [cited by applicant]
CN 107656832A · 2018 [cited by applicant]
CN 107665154A · 2018 [cited by applicant]
CN 107864198A · 2018 [cited by applicant]
CN 107967539A · 2018 [cited by applicant]
CN 108268638A · 2018 [cited by applicant]
CN 109033757A · 2018 [cited by applicant]
CN 109685501A · 2019 [cited by applicant]
CN 109889326A · 2019 [cited by applicant]
CN 110428056A · 2019 [cited by applicant]
CN 110472745A · 2019 [cited by applicant]
CN 110490305A · 2019 [cited by applicant]
CN 110490330A · 2019 [cited by applicant]
CN 105488675B · 2019 [cited by applicant]
EP 3564873A1 · 2019 [cited by applicant]
GB 2559592A · 2018 [cited by applicant]
WO 2017203093A1 · 2017 [cited by applicant]
WO 2018059939A1 · 2018 [cited by applicant]
WO 2018130267A1 · 2018 [cited by applicant]
WO 2018191030A1 · 2018 [cited by applicant]
“Decentralized Machine Learning White Paper”, available online at <www.decentralizedml.com>, Dec. 31, 2017, 58 pages. [cited by applicant]
Diro et al., “Deep Learning: The Frontier for Distributed Attack Detention in Fog-to-Things Computing”, IEEE Communications Magazine, Feb. 2018, , pp. 169-175. [cited by applicant]
Acar et al., “A Survey on Homomorphic Encryption Schemes: Theory and Implementation”, ACM Computing Surveys, vol. 51, No. 4, Article 79, Jul. 2018, pp. 79:1-79:35. [cited by applicant]
Bonawitz et al., “Practical Secure Aggregation for Privacy-Preserving Machine Learning”, Cryptology ePrint Archive: Report 2017/281, 2017, 21 pages. [cited by applicant]
Kurakin et al., “Adversarial Examples in the Physical World”, CoRR, abs/1607.02533, 2017, pp. 1-14. [cited by applicant]
Nedic et al., “Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization”, Jan. 15, 2018, 32 pages. [cited by applicant]
Shokri et al., “Membership Inference Attacks Against Machine Learning Models”, CoRR, abs/1610.05820, 2017, 16 pages. [cited by applicant]
Yuan et al., “Privacy Preserving Back-Propagation Neural Network Learning Made Practical with Cloud Computing”, IEEE Transactions on Parallel and Distributed Systems, 2013, vol. 25, pp. 1-11. [cited by applicant]
Reisizadeh et al., “Robust and Communication-Efficient Collaborative Learning”, Oct. 31, 2019, 33 pages. [cited by applicant]
Teerapittayanon et al., “DaiMON: a Decentralized Artificial Intelligence Model Network”, Jul. 2019, 8 pages. [cited by applicant]
Resizadeh, et al., “Quantized Decentralized Consensus Optimization”; 2018 IEEE Conference on Decision and Control (CDC) (Year: 2018). [cited by applicant]
Zhu, et al., Blockchain-Based Privacy Preserving Deep Learning. In: Guo, F., Huang, X., Yung, M. (eds) Information Security and Cryptology. Inscrypt 2018. Lecture Notes in Computer Science( ), vol. 1144 (Year: 2018). [cited by applicant]
M. Shen, X. Tang, L. Zhu, X. Du and M. Guizani, “Privacy-Preserving Support Vector Machine Training Over Blockchain-Based Encrypted IoT Data in Smart Cities,” in IEEE Internet of Things Journal, vol. 6, No. 5, pp. 7702-… [cited by applicant]
Search Report and Written Opinion received for PCT Application No. PCT/US2021/013394, mailed on Apr. 19, 2021, 08 pages. [cited by applicant]
Kate et al, “Distributed Key Generation in the Wild”, Report 2012/377, 2012, pp. 1-30. [cited by applicant]
Xu et al., “HybridAlpha: an Efficient Approach for Privacy-Preserving Federated Learning”, ACM, 2019, 11 pages. [cited by applicant]
Watanabe et al, “Blockchain contract: a complete consensus using blockchain,” 2015 IEEE 4th Global Conference on Consumer Electronics (GCCE), 2015, pp. 577-578, doi: 10.1109/GCCE.2015.7398721. (Year: 2015). [cited by applicant]
Yang et al. “Federated Machine Learning: Concept and Applications.” arXiv preprint arXiv:1902.04885 (2019). (Year: 2019). [cited by applicant]
European Search Report and Search Opinion received for EP Application No. 21747157.2, mailed on Oct. 28, 2022, 5 pages. [cited by applicant]
Li et al., “DLBC: a Deep Learning-Based Consensus in Blockchains for Deep Learning Services”, IEEE Transactions on Services Computing, Jan. 31, 2020, 13 pages. [cited by applicant]
Lihu et al., “A Proof of Useful Work for Artificial Intelligence on the Blockchain”, Jan. 25, 2020, 25 pages. [cited by applicant]
Xu, R., et al., “HybridAlpha: an Efficient Approach for Privacy-Preserving Federated Learning”, ACM, Nov. 11, 2019, pp. 11. [cited by applicant]
Abadi et al., “TensorFlow: a System for Large-Scale Machine Learning”, 2th USENIX Symposium on Operating Systems Design and Implementation (OSDI '16), Nov. 2-4, 2016, 21 pages. [cited by applicant]
Ali et al., “Applications of Blockchains in the Internet of Things: a Comprehensive Survey”, IEEE Communications Surveys & Tutorials, 2018, 42 pages. [cited by applicant]
Bank for International Settlements, “Distributed ledger technology in payment, clearing and settlement”, Committee on Payments and Market Infrastructures, Feb. 2017, 29 pages. [cited by applicant]
Ben Dickson, “The case for decentralized artificial intelligence”, TechTalks, available online at <https://bdtechtalks.com/2018/01/10/decentralized-ai-blockchain/>, Jan. 10, 2018, 5 pages. [cited by applicant]
Bonawitz et al., “Practical Secure Aggregation for Privacy-Preserving Machine Learning”, CCS'17, ACM, Oct. 30-Nov. 3, 2017, pp. 1175-1191. [cited by applicant]
Catherine Sturman, “OWKIN is set to use machine learning to augment medical and biology research”, Healthcare Global, available online at <https://www.healthcareglobal.com/technology/owkin-set-use-machine-learning-augme… [cited by applicant]
Chen et al., “ALGORAND”, Computer Science Cryptography and Security, May 26, 2017, pp. 1-75. [cited by applicant]
Chen et al., “When Machine Learning Meets Blockchain: a Decentralized, Privacy-preserving and Secure Design”, IEEE International Conference on Big Data (Big Data), 2018, pp. 1178-1187. [cited by applicant]
Extended European Search Report received for EP Patent Application No. 18177565.1, mailed on Nov. 30, 2018, 08 pages. [cited by applicant]
Extended European Search Report received for EP Patent Application No. 18177566.9, mailed on Dec. 13, 2018, 07 pages. [cited by applicant]
Extended European Search Report received for EP Patent Application No. 18183265.0, mailed on Feb. 4, 2019, 11 pages .. [cited by applicant]
Fred Ehrsam, “Blockchain-based Machine Learning Marketplaces”, Medium, available online at <https://medium.com/@FEhrsam/blockchain-based-machine-learning-marketplaces-cb2d4dae2c17>, Mar. 13, 2018, 10 pages. [cited by applicant]
Georgopoulos et al., “Distributed machine learning in networks by consensus”, Neurocomputing, Elsevier, vol. 124, 2013, 11 pages. [cited by applicant]
Kim et al., “On-Device Federated Learning via Blockchain and its Latency Analysis”, Research Gate, Aug. 2018, 4 pages. [cited by applicant]
Kurtulmus et al., “Trustless Machine Learning Contracts; Evaluating and Exchanging Machine Learning Models on the Ethereum Blockchain”, Research Gate, Feb. 27, 2018, 11 pages. [cited by applicant]
Lei Shi, “The convergence of AI and IoT, are we there yet?”, available online at <https://northstream.se/insights/blog/the-convergence-of-ai-and-iot-are-we-there-yet/>, Oct. 11, 2017, 11 pages. [cited by applicant]
Li et al., “Scaling Distributed Machine Learning with the Parameter Server”, 11th USENIX Symposium on Operating Systems Design and Implementation, Oct. 6-8, 2014, 17 pages. [cited by applicant]
Mendis et al., “Blockchain as a Service: an Autonomous, Privacy Preserving, Decentralized Architecture for Deep Learning”, Research Paper, Jul. 5, 2018, pp. 1-8. [cited by applicant]
Nakamoto et al., “Bitcoin: a Peer-to-Peer Electronic Cash System”, Oct. 31, 2008, pp. 1-9. [cited by applicant]
Pop at al., “Blockchain Based Decentralized Management of Demand Response Programs in Smart Energy Grids”, MDPI, Jan. 9, 2018, pp. 1-21. [cited by applicant]
Sandha et al., “In-database Distributed Machine Learning: Demonstration Using Teradata SQL Engine,” Proceedings of the VLDB Endowment, vol. 12, No. 12., Aug. 2019, pp. 1854-1857. [cited by applicant]
Search Report and Written Opinion received for PCT Application No. PCT/US2020/019064, mailed on Jun. 2, 2020, 15 pages. [cited by applicant]
Singla et al.., “Machine Learning for Secure Device Personalization Using Blockchain”, IEEE, Sep. 19, 2018, 7 pages. [cited by applicant]
Venkataraman et al., “Adopting blockchain for enterprise asset management (EAM)”, IBM, available online at <https://developer.ibm.com/technologies/blockchain/tutorials/cl-adopting-blockchain-for-enterprise-asset-managem… [cited by applicant]
Verbraeken et al., A Survey on Distributed Machine Learning, (Research Paper), ACM Computing Surveys, vol. 53, No. 2, Mar. 2020, pp. 1-33. [cited by applicant]
Weng et al., “DeepChain: Auditable and Privacy-Preserving Deep Learning with Blockchain-based Incentive”, Journal of Latex Class Files, vol. 14(8), Nov. 2019, pp. 1-18. [cited by applicant]
Zhang et al., “Stay Fresh: Speculative Synchronization for Fast Distributed Machine Learning”, 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), 2018, 11 pages. [cited by applicant]
Search Report and Written Opinion received for PCT Application No. PCT/US2021/014932, mailed on May 13, 2021, 08 pages. [cited by applicant]
Castro et al, “Practical Byzantine Fault Tolerance”, Proceedings of the Third Symposium on Operating Systems Design and Implementation, New Orleans, USA, Feb. 1999 (Year: 1999). [cited by applicant]
Chen et al, “On Security Analysis of Proof-of-Elapsed-Time (PoET)”, In: Spirakis, P., Tsigas, P. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2017. Lecture Notes in Computer Science( ), vol. 106… [cited by applicant]
Feng et al, “Scalable Dynamic Multi-Agent Practical Byzantine Fault-Tolerant Consensus in Permissioned Blockchain”. Appl. Sci. 2018, 8, 1919. https://doi.org/10.3390/app8101919 (Year: 2018). [cited by applicant]
Nguyen et al, “A Survey about Consensus Algorithms Used in Blockchain”, J Inf Process Syst, vol. 14, No. 1, pp. 101-128, Feb. 2018 https://doi.org/10.3745/JIPS.01.0024 (Year: 2018). [cited by applicant]
Yuguang et al., “Review and Research for Consensus Mechanism of Block Chain”, China Academic Journal Electronic Publishing House, Research Papers, vol. 4, No. 4, Apr. 2018, pp. 369-379. (English Abstract Only). [cited by applicant]
860/Towards-Fair-and-Privacy-Preserving-Federated-Deep-Models.pdf (Year: 2020). [cited by applicant]
Lyu, Lingjuan et al. “Toward Fair and Decentralized Privacy-Preserving Deep Learning with Blockchain” Jun. 4, 2019 [Online] Downloaded Sep. 25, 2024 https://www.researchgate.net/profile/Xingjun-Ma/publication/333617529_… [cited by applicant]
Tran, Nguyen H. et al “Federated Learning over Wireless Networks: Optimization Model Design and Analysis” May 2019 [ONline] Downloaded Sep. 25, 2024 https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8737464 (Year… [cited by applicant]
Bano, Shehar et al. “SoK: Consensus in the Age of Blockchains” 2017, pp. 1-17. [cited by applicant]
Invidia, Lorenzo et al. “An IoT-oriented Fast Prototyping Platform for BLE-based Star Topology Networks”, Journal of Communications Software and Systems, vol. 15, No. 2, Jun. 2019, pp. 138-149. [cited by applicant]