The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
A Learning-Based Incentive Mechanism for Federated Learning
Abstract
Internet of Things (IoT) generates large amounts of data at the network edge. Machine learning models are often built on these data, to enable the detection, classification, and prediction of the future events. Due to network bandwidth, storage, and especially privacy concerns, it is often impossible to send all the IoT data to the data center for centralized model training. To address these issues, federated learning has been proposed to let nodes use the local data to train models, which are then aggregated to synthesize a global model. Most of the existing work has focused on designing learning algorithms with provable convergence time, but other issues, such as incentive mechanism, are unexplored. Although incentive mechanisms have been extensively studied in network and computation resource allocation, yet they cannot be applied to federated learning directly due to the unique challenges of information unsharing and difficulties of contribution evaluation. In this article, we study the incentive mechanism for federated learning to motivate edge nodes to contribute model training. Specifically, a deep reinforcement learning-based (DRL) incentive mechanism has been designed to determine the optimal pricing strategy for the parameter server and the optimal training strategies for edge nodes. Finally, numerical experiments have been implemented to evaluate the efficiency of the proposed DRL-based incentive mechanism.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“FTL was first proposed in [71].”
From Challenges, Applications and Design Aspects of Federated Learning: A Survey (2021) · cites this paper as [71]
In the citing paper
“Most of the state-of-the art techniques [40], [41] use DRL to implement resource allocation strategies for FLchain systems under energy and channel bandwidth availability conditions.”
From Federated learning meets blockchain in edge computing: Opportunities and challenges (2021) · cites this paper as [41]
In the citing paper
“Without a proper incentive mechanism, clients may not be willing to join the data training which would reduce the scalability of the designed FL system [45].”
From Federated learning meets blockchain in edge computing: Opportunities and challenges (2021) · cites this paper as [45]
Citations
Cites
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 25,268
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
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
Reinforcement Learning: An Introduction
Johnson, J. D., Li, J., & Chen, Z. (2000) · Neurocomputing · doi:10.1016/s0925-2312(00)00324-6 · Cited by 8,825
(1999) · Cited by 5,147
Trust region policy optimization
Schulman, J., Levine, S., Moritz, P., Jordan, M. I., & Abbeel, P. (2015) · arXiv · doi:10.48550/arxiv.1502.05477 · Cited by 4,578
Real-time status: How often should one update?
Kaul, S. K., Yates, R. D., & Gruteser, M. (2012) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2012.6195689 · Cited by 2,508
Konda, V. R., & Tsitsiklis, J. N. (2002) · Cited by 2,202
Learning IoT in Edge: Deep Learning for the Internet of Things with Edge Computing
Li, H., Ota, K., & Dong, M. (2018) · IEEE Network · doi:10.1109/mnet.2018.1700202 · Cited by 1,566
Research works printed but not linked: 3
- konda, 2000, Actor–critic algorithms, Proc NIPS, 1008
- 2017, Proximal Policy Optimization
- goodfellow, 2016, Deep Learning
Cited by
Sorted by citations
Items 601–601 of 601
Cherbal, S., & Gawanmeh, A. (2026) · Cluster Computing · doi:10.1007/s10586-026-06637-1
Metadata
- Authors
- Zhan, Y., Li, P., Qu, Z., Zeng, D., & Guo, S.
- Affiliations
- Hong Kong Polytechnic University (HK)
- University of Aizu (JP)
- China University of Geosciences (CN)
- Venue
- IEEE Internet of Things Journal
- Published
- 2020-07
- Volume
- 7
- Issue
- 7
- Pages
- 6360-6368
- ISSN
- 2327-4662 (ISSN-L)
- 2372-2541
- OpenAlex
- W3001989995
- Semantic Scholar
- 08a9c7ba8868ad41bcf911ea389c8dc184922627
- Cited by
- 602
- References
- 47
- Citations by year
- 2026: 40 · 2025: 81 · 2024: 128 · 2023: 128 · 2022: 108 · 2021: 86 · 2020: 31
- FWCI
- 34.67
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Internet of Things Journal (publishedVersion)
- Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
- Funders
- General Research Fund of the Research Grants Council of Hong Kong (PolyU 152221/19E)
- National Natural Science Foundation of China (61872310)
- JSPS Grants-in-Aid for Scientific Research (JP19K20258)
- Basic Research-Free Exploration Project of Shenzhen (JCYJ20170818103849343)
- China Postdoctoral Science Foundation (2019M661709)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
- Keywords
- federated learning, incentive mechanisms, deep reinforcement learning, Internet of Things, edge computing, privacy-preserving training
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
