4.6 Article

Task-Load-Aware Game-Theoretic Framework for Wireless Federated Learning

Journal

IEEE COMMUNICATIONS LETTERS
Volume 27, Issue 1, Pages 268-272

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2022.3210604

Keywords

Task analysis; Costs; Training; Games; Data models; Load modeling; Computational modeling; Machine learning; federated learning; resource allocation; bertrand game; nash equilibrium

Ask authors/readers for more resources

This paper proposes a Bertrand-game based framework to address the incentive problem in federated learning. By predicting the impact of time-varying task load and channel quality on user equipment's motivation to engage in the task, each user equipment seeks to maximize its profit based on the performance metrics set by the model owner and the estimated energy cost. The simulation result verifies the effectiveness of the proposed approach.
Federated learning (FL) can protect data privacy but has difficulties in motivating user equipment (UE) to engage in task training. This letter proposes a Bertrand-game based framework to address the incentive problem, where a model owner (MO) issues an FL task and the employed UEs help train the model by using their local data. Specially, we consider the impact of time-varying task load and channel quality on UE's motivation to engage in the FL task. We adopt the finite-state discrete-time Markov chain (FSDT-MC) to predict these parameters during the FL task. Depending on the performance metrics set by the MO and the estimated energy cost of the FL task, each UE seeks to maximize its profit. We obtain the Nash equilibrium (NE) of the game in closed form, and develop a distributed iterative algorithm to find it. Finally, the simulation result verifies the effectiveness of the proposed approach.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available