The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Optimal Contract Design for Efficient Federated Learning With Multi-Dimensional Private Information
Abstract
As an emerging machine learning technique, federated learning has received significant attention recently due to its promising performance in mitigating privacy risks and costs. While most of the existing work of federated learning focused on designing learning algorithm to improve training performance, the incentive issue for encouraging users' participation is still under-explored. This paper presents an analytical study on the server's optimal incentive mechanism design, in the presence of users' multi-dimensional private information (e.g., training cost and communication delay). Specifically, we consider a multi-dimensional contract-theoretic approach, with a key contribution of summarizing users' multi-dimensional private information into a one-dimensional criterion that allows a complete order of users. We further perform the analysis in three information scenarios to reveal the impact of information asymmetry levels on server's optimal strategy and minimum cost. We show that weakly incomplete information does not increase the server's cost (comparing with the complete information scenario) when training data is IID, but it in general does when data is non-IID. Furthermore, the optimal mechanism design under strongly incomplete information is much more challenging, and it is not always optimal for the server to incentivize the group of users with the lowest training cost and delay to participate.
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
Federated Learning in Mobile Edge Networks: A Comprehensive Survey
Lim, W. Y. B., Luong, N. C., Hoang, D. T., Jiao, Y., Liang, Y.-C., Yang, Q., Niyato, D., & Miao, C. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2986024 · Cited by 2,565
SCAFFOLD: Stochastic Controlled Averaging for Federated Learning
Karimireddy, S. P., Kale, S., Mohri, M., Reddi, S. J., Stich, S. U., & Suresh, A. T. (2019) · arXiv · doi:10.48550/arxiv.1910.06378 · Cited by 1,734
Privacy-Preserving Traffic Flow Prediction: A Federated Learning Approach
Liu, Y., Yu, J. J. Q., Kang, J., Niyato, D., & Zhang, S. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2991401 · Cited by 712 · cited 3×
“As an illustrative example, federated learning are being applied to timely traffic flow prediction [5].”
BackgroundMethodA Learning-Based Incentive Mechanism for Federated Learning
Zhan, Y., Li, P., Qu, Z., Zeng, D., & Guo, S. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2967772 · Cited by 602
Mitigating Sybils in Federated Learning Poisoning
Fung, C., Yoon, C. J. M., & Beschastnikh, I. (2018) · arXiv · doi:10.48550/arxiv.1808.04866 · Cited by 385
Zhao, Z., Feng, C., Yang, H. H., & Luo, X. (2020) · IEEE Wireless Communications · doi:10.1109/mwc.001.1900370 · Cited by 125
Cited by
Blockchain-empowered Federated Learning: Challenges, Solutions, and Future Directions
Zhu, J., Cao, J., Saxena, D., Jiang, S., & Ferradi, H. (2023) · ACM Computing Surveys · doi:10.1145/3570953 · Cited by 309
Secure and Efficient Federated Learning for Smart Grid With Edge-Cloud Collaboration
Su, Z., Wang, Y., Luan, T. H., Zhang, N., Li, F., Chen, T., & Cao, H. (2022) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2021.3095506 · Cited by 301
A Survey of Incentive Mechanism Design for Federated Learning
Zhan, Y., Zhang, J., Hong, Z., Wu, L., Li, P., & Guo, S. (2021) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2021.3063517 · Cited by 284
Communication-efficient distributed learning: An overview
Cao, X., Başar, T., Diggavi, S., Eldar, Y. C., Letaief, K. B., Poor, H. V., & Zhang, J. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3242710 · Cited by 139
“strategic behavior of agents in distributed learning [10].”
BackgroundLi, L., Yang, L., Guo, X., Shi, Y., Wang, H., Chen, W., & Letaief, K. B. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3118431 · Cited by 37
“, the training bottleneck caused by the slowest participating devices) [22]–[28], resource allocation for improving the transmission efficiency [27]–[30], adaptive aggregation for dynamically controlling the aggregation frequency [31] or calibrating aggregation weights [32], batchsize selection for improving learning…”
Background
Metadata
- Authors
- Ding, N., Fang, Z., & Huang, J.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2021-01
- Volume
- 39
- Issue
- 1
- Pages
- 186-200
- ISSN
- 0733-8716 (ISSN-L)
- 1558-0008
- OpenAlex
- W3112877893
- Cited by
- 165
- References
- 7
- FWCI
- 7.86
- Type
- journal article
- 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
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.