Blockchain-based Node-aware Dynamic Weighting Methods for Improving Federated Learning Performance
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Federated learning (FL) is a decentralized learning method that deviated from the conventional centralized learning. The FL progresses learning locally on each device and gradually improves the learning model through interaction with the central server. However, it can cause network overload because of limited communication bandwidth and the participation of a huge number of users. One of the ways to minimize the network load is for the model to converge rapidly and stably with target learning accuracy. In this paper, we propose blockchain based federated learning scenario. Blockchain can efficiently induce users to participate in learning and can separate each participating user as a `node'. In addition, it can be pursued the integrity, stability, and so on. We consider two types of weights to choose the subset of clients for updating the global model. First, we consider the weight based on local learning accuracy of each client. Second, we consider the weight based on participation frequency of each client. We choose two key performance indicators, learning speed and standard deviation, to compare the performance of our proposed scheme with existing schemes. The simulation results show that our proposed scheme achieves higher stability along with fast convergence time for targeted accuracy compared to others.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Communication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215
Blockchain for AI: review and open research challenges
Salah, K., Rehman, M. H. U., Nizamuddin, N., & Al-Fuqaha, A. (2019) · IEEE Access · doi:10.1109/access.2018.2890507 · Cited by 1,001 · cited 2×
“Temporally Weighted Aggregation Temporally Weighted Aggregation algorithm is proposed by [6] to increase the communication efficiency of federated learning.”
Background
Cited by
A review of applications in federated learning
Li, L., Fan, Y., Tse, M., & Lin, K.-Y. (2020) · Computers & Industrial Engineering · doi:10.1016/j.cie.2020.106854 · Cited by 1,559
Federated learning meets blockchain in edge computing: Opportunities and challenges
Nguyen, D. C., Ding, M., Pham, Q.-V., Pathirana, P. N., Le, L. B., Seneviratne, A., Li, J., Niyato, D., & Poor, H. V. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3072611 · Cited by 661
A Blockchain-Based Decentralized Federated Learning Framework with Committee Consensus
Li, Y., Chen, C., Liu, N., Huang, H., Zheng, Z., & Yan, Q. (2021) · IEEE Network · doi:10.1109/mnet.011.2000263 · Cited by 645
Federated learning review: Fundamentals, enabling technologies, and future applications
Banabilah, S., Aloqaily, M., Alsayed, E., Malik, N., & Jararweh, Y. (2022) · Information Processing & Management · doi:10.1016/j.ipm.2022.103061 · Cited by 556
Ghimire, B., & Rawat, D. B. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3150363 · Cited by 478
Metadata
- Authors
- Kim, Y. J., & Hong, C. S.
- Venue
- 2019 20th Asia-Pacific Network Operations and Management Symposium (APNOMS)
- Publisher
- IEEE
- Published
- 2019-09
- Pages
- 1-4
- OpenAlex
- W2989253922
- Cited by
- 93
- References
- 2
- FWCI
- 5.11
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Blockchain-based Node-aware Dynamic Weighting Methods for Improving Federated Learning Performance. https://app.cochat.ai/papers/10.23919/apnoms.2019.8893114
- The paper
- Kim, Y. J., & Hong, C. S. (2019). Blockchain-based Node-aware Dynamic Weighting Methods for Improving Federated Learning Performance. 2019 20th Asia-Pacific Network Operations and Management Symposium (APNOMS). https://doi.org/10.23919/apnoms.2019.8893114
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.