Free-Rider Games for Federated Learning with Selfish Clients in NextG Wireless Networks
Yalin E. Sagduyu

TL;DR
This paper models free-riding in federated learning over wireless networks using game theory, deriving equilibrium strategies and analyzing the impact of costs and client numbers on participation and model accuracy.
Contribution
It introduces a game theoretic framework to analyze free-riding behavior in federated learning with wireless clients, deriving Nash equilibrium strategies and quantifying their effects.
Findings
Free-riding probability increases with participation cost and number of clients.
Significant optimality gap exists in Nash equilibrium compared to joint optimization.
Results quantify free-riding impact on federated learning resilience in NextG networks.
Abstract
This paper presents a game theoretic framework for participation and free-riding in federated learning (FL), and determines the Nash equilibrium strategies when FL is executed over wireless links. To support spectrum sensing for NextG communications, FL is used by clients, namely spectrum sensors with limited training datasets and computation resources, to train a wireless signal classifier while preserving privacy. In FL, a client may be free-riding, i.e., it does not participate in FL model updates, if the computation and transmission cost for FL participation is high, and receives the global model (learned by other clients) without incurring a cost. However, the free-riding behavior may potentially decrease the global accuracy due to lack of contribution to global model learning. This tradeoff leads to a non-cooperative game where each client aims to individually maximize its utility…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
