Abstract
Federated learning (FL) trains a machine learning model on mobile devices in a distributed manner using each device's private data and computing resources. A critical issues is to evaluate individual users' contributions so that (1) users' effort in model training can be compensated with proper incentives and (2) malicious and low-quality users can be detected and removed. The state-of-the-art solutions require a representative test dataset for the evaluation purpose, but such a dataset is often unavailable and hard to synthesize. In this paper, we propose a method called Pairwise Correlated Agreement (PCA) based on the idea of peer prediction to evaluate user contribution in FL without a test dataset. PCA achieves this using the statistical correlation of the model parameters uploaded by users. We then apply PCA to designing (1) a new federated learning algorithm called Fed-PCA, and (2) a new incentive mechanism that guarantees truthfulness. We evaluate the performance of PCA and Fed-PCA using the MNIST dataset and a large industrial product recommendation dataset. The results demonstrate that our Fed-PCA outperforms the canonical FedAvg algorithm and other baseline methods in accuracy, and at the same time, PCA effectively incentivizes users to behave truthfully.
Original language | English |
---|---|
Title of host publication | 2021 19th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2021 |
ISBN (Electronic) | 9783903176379 |
DOIs | |
State | Published - Oct 18 2021 |
Event | 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks, WiOpt 2021 - Virtual, Philadelphia, United States Duration: Oct 18 2021 → Oct 21 2021 |
Publication series
Name | 2021 19th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2021 |
---|
Conference
Conference | 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks, WiOpt 2021 |
---|---|
Country/Territory | United States |
City | Virtual, Philadelphia |
Period | 10/18/21 → 10/21/21 |
Bibliographical note
Publisher Copyright:© 2021 IFIP.
Funding
This work was supported in part by China NSF grant No. 62025204, 62072303, 61972252, 61902248, and 61972254, in part by the National Science Foundation (NSF) under Grant CNS-2008878, in part by Shanghai Science and Technology fund 20PJ1407900, in part by Alibaba Group through Alibaba Innovation Research Program, and in part by Tencent Rhino Bird Key Research Project. The opinions, findings, conclusions, and recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the funding agencies or the government. Z. Zheng is the corresponding author.
Funders | Funder number |
---|---|
Shanghai Science and Technology Museum | 20PJ1407900 |
Tencent Rhino Bird Key Research Project | |
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China | CNS-2008878 |
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China | |
National Natural Science Foundation of China (NSFC) | 61972252, 61902248, 62025204, 62072303, 61972254 |
National Natural Science Foundation of China (NSFC) |
Keywords
- Peer prediction
- correlated agreement
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Networks and Communications
- Information Systems and Management
- Control and Optimization
- Modeling and Simulation