FDFL: Fair and Discrepancy-Aware Incentive Mechanism for Federated Learning

Abstract

Federated Learning (FL) is an emerging distributed machine learning paradigm crucial for ensuring privacy-preserving learning. In FL, a fair incentive mechanism is indispensable for inspiring more clients to participate in FL training. Nevertheless, achieving a fair incentive mechanism in FL is an arduous endeavor, underscored by two significant challenges that persistently elude resolution within existing methodologies. Firstly, existing works overlook the issue of category distribution heterogeneity in contribution evaluation, leading to incomplete contribution evaluations. Secondly, the fact that malicious servers will dishonestly allocate rewards to save costs is not considered in existing work, which can be a barrier to client participation in FL. This paper introduces FDFL (<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">F</u>air and <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</u>iscrepancy-aware incentive mechanism for <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">F</u>ederated <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</u>earning), a novel system addressing these concerns. FDFL encompasses two key elements: 1) Discrepancy-aware contribution evaluation approach; 2) Provable reward allocation approach. Extensive experiments on four model-dataset combinations demonstrate that, under the heterogeneous setting, our scheme improves accuracy by an average of 9.85% and 11.97% compared to FedAvg and FAIR, respectively.