Double Insurance: Incentivized Federated Learning with Differential Privacy in Mobile Crowdsensing

Exploiting the computing capability of mobile devices with specialized engines (e.g., Neural Engine in iPhone), an attractive paradigm of federated learning that combines the mobile crowdsensing (MCS) has been deeply investigated recently (e.g., Google AI and Nvidia), where the training task is offloaded to the mobile crowd. However, this new paradigm still has numerous problems. Since executing the training task is costly for individual workers, the first problem is how to attract more participants. Following the incentive requirement, the second is how to preserve the workers' bid privacy since the reported costs are usually sensitive. Finally, the third problem is to guarantee the privacy protection on locally training models in the federated learning which involve the private information of local data. In this paper, we propose an incentivized federated learning with differential privacy in MCS system, namely, SHIELD, to solve the three significant problems. In fact, SHIELD satisfies the truthfulness and individual rationality while preserving the differential privacy of workers' bids and locally training models. Furthermore, for accuracy, the excess empirical risk of 1 SHIELD is proved to be upper bounded by O((ln(Kn min ))1/2/Kn min + ln(Kn min )/K 2 n min 2 ), where a special case for totally distributed scenario leads to a much sharper bound O( log(n)/n 2 ) than the latest result O(ln(mn min )/m 2 n min 2 ). Finally, comparing with the state-of-art apmin proaches, SHIELD illustrates superior performance by numerous experiments in classification and regression tasks.