Improving Federated Learning With Quality-Aware User Incentive and Auto-Weighted Model Aggregation
- 1 August 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (12) , 4515-4529
Abstract
Federated learning enables distributed model training over various computing nodes, e.g., mobile devices, where instead of sharing raw user data, computing nodes can solely commit model updates without compromising data privacy. The quality of federated learning relies on the model updates contributed by computing nodes training with their local data. However, with various factors (e.g., training data size, mislabeled data samples, skewed data distributions), the model update qualities of computing nodes can vary dramatically, while inclusively aggregating low-quality model updates can deteriorate the global model quality. To achieve efficient federated learning, in this paper, we propose a novel framework named FAIR , i.e., F ederated le A rning with qual I ty awa R eness. Particularly, FAIR integrates three major components: 1) learning quality estimation: we adopt the model aggregation weight (learned in the third component) to reversely quantify the individual learning quality of nodes in a privacy-preserving manner, and leverage the historical learning records to infer the next-round learning quality; 2) quality-aware incentive mechanism: within the recruiting budget, we model a reverse auction problem to stimulate the participation of high-quality and low-cost computing nodes, and the method is proved to be truthful, individually rational, and computationally efficient; and 3) auto-weighted model aggregation: based on the gradient descent method, we devise an auto-weighted model aggregation algorithm to automatically learn the optimal aggregation weights to further enhance the global model quality. Based on real-world datasets and learning tasks, extensive experiments are conducted to demonstrate the efficacy of FAIR .Keywords
Funding Information
- National Key R&D Program of China (2022YFC2009800)
- National Natural Science Foundation of China (62002389, 62001180, 62122095, 62072472, U19A2067)
- Guoqiang Institute, Tsinghua University
- Young Elite Scientists Sponsorship Program (YESS20200238)
- Key-Area Research and Development Program of Guangdong Province (2019B010137005)
- Natural Science Foundation of Hunan Province (2020JJ2050, 2021JJ20079)
- Key R&D Program of Hunan Province of China (2022GK2013)
- Young Talents Plan of Hunan Province of China (2021RC3004)
This publication has 37 references indexed in Scilit:
- Big Data Driven Vehicular NetworksIEEE Network, 2018
- Billion-scale Commodity Embedding for E-commerce Recommendation in Alibaba2018
- An Online Learning Approach to Improving the Quality of Crowd-SourcingIEEE/ACM Transactions on Networking, 2017
- Deep Residual Learning for Image Recognition2016
- DBOD-DS: Distance Based Outlier Detection for Data StreamsLecture Notes in Computer Science, 2010
- Selecting the forgetting factor in subset autoregressive modellingJournal of Time Series Analysis, 2002
- Approximation Algorithms for the Multiple Knapsack Problem with Assignment RestrictionsJournal of Combinatorial Optimization, 2000
- Gradient-based learning applied to document recognitionProceedings of the IEEE, 1998
- Optimal Auction DesignMathematics of Operations Research, 1981
- An algorithm for 0‐1 multiple‐knapsack problemsNaval Research Logistics Quarterly, 1978