Fair Distributed Machine Learning with Imbalanced Data as a Stackelberg Evolutionary Game

Sebastian Niehaus, Ingo Roeder, Nico ScherfarXiv 2024 · DOI · arXiv

Abstract

In decentralized machine learning, data imbalance across nodes often leads to a "tyranny of the majority," where global models favor large data contributors at the expense of smaller ones. This paper introduces the Adaptive Stackelberg Weighting Model (ASWM), a framework that treats federated learning as a Stackelberg Evolutionary Game. By modeling nodes as strategic players—a Leader (large node) and Followers (small nodes)—the system dynamically optimizes contribution weights to ensure fairness. Experimental results on MedMNIST datasets demonstrate that ASWM improves performance for underrepresented nodes by up to 2.7% in AUC with negligible impact on major contributors.

Introduction

Standard Federated Learning (FL) algorithms, such as FedAvg, typically weight node contributions based on local dataset size. While effective for independent and identically distributed (IID) data, this approach fails in real-world scenarios where data is non-IID (non-independent and identically distributed). For instance, in medical imaging, a large university hospital may dominate the training process, causing the resulting global model to perform poorly on unique data distributions from smaller rural clinics. This creates a "fairness gap," discouraging participation from smaller entities who gain little from the collective training.

The Stackelberg Evolutionary Game Framework

To address this, we reframe FL as a Stackelberg Game—a strategic model where a "Leader" (the node with the most data) moves first, and "Followers" (smaller nodes) respond. Since FL is an iterative process, this evolves into an Evolutionary Game where strategies adapt over time. Unlike traditional FL where nodes are passive, here they are active players with specific objectives.

We propose the Adaptive Stackelberg Weighting Model (ASWM). ASWM utilizes an actor-critic neural network and an experience replay buffer to predict optimal contribution weights ($C_k$). The Leader’s network anticipates Follower reactions to specific weightings, seeking a "Stackelberg Equilibrium" that balances collective performance with individual node needs.

Figure 1: (a) ASWM system architecture showing Leader-Follower interaction; (b) Data distribution skew across nodes for MedMNIST subsets; (c, d) Evolution of contribution weights C over training rounds.

Experimental Evaluation

The model was validated using three MedMNIST subsets: BloodMNIST (blood cell classification), DermaMNIST (skin lesion diagnosis), and BreastMNIST (breast ultrasound analysis). To simulate realistic imbalances, we applied a Dirichlet distribution to skew class proportions and introduced unique Gaussian noise patterns to represent hardware variability across nodes. This setup ensures that the model is tested against both label skew and feature distribution shift, common hurdles in decentralized medical AI.

Results and Discussion

ASWM consistently outperformed standard Federated Averaging (FedAvg) and Precision-Weighted FedAvg (PWFedAvg). Key findings include:

  • Follower Gains: Underrepresented nodes experienced an average AUC increase of 2.713%, with some nodes seeing improvements as high as 5.97% compared to standard methods.
  • Leader Stability: The performance cost to the Leader node was minimal, averaging only a 0.441% decrease. This suggests that the Leader actually benefits from the Followers' unique data (unfamiliar cases), formalizing a "mutual need" between nodes of different sizes.
  • Dynamic Convergence: As shown in the weight evolution plots (Figures 1c and 1d), the system successfully reaches an equilibrium where weights stabilize. This dynamic adjustment round-by-round ensures a robust global model across all participating nodes regardless of their initial size.

Conclusion

By treating decentralized learning as a strategic game, ASWM effectively mitigates the "tyranny of the majority." While the sequential nature of Stackelberg games presents potential parallelism challenges, this work provides a foundational approach for achieving fairness in heterogeneous federated environments. Future research will focus on optimizing communication overhead and scaling the framework to larger networks with hundreds of nodes.

Summary updated

Abstract

Decentralised learning enables the training of deep learning algorithms without centralising data sets, resulting in benefits such as improved data privacy, operational efficiency and the fostering of data ownership policies. However, significant data imbalances pose a challenge in this framework. Participants with smaller datasets in distributed learning environments often achieve poorer results than participants with larger datasets. Data imbalances are particularly pronounced in medical fields and are caused by different patient populations, technological inequalities and divergent data collection practices. In this paper, we consider distributed learning as an Stackelberg evolutionary game. We present two algorithms for setting the weights of each node's contribution to the global model in each training round: the Deterministic Stackelberg Weighting Model (DSWM) and the Adaptive Stackelberg Weighting Model (ASWM). We use three medical datasets to highlight the impact of dynamic weighting on underrepresented nodes in distributed learning. Our results show that the ASWM significantly favours underrepresented nodes by improving their performance by 2.713% in AUC. Meanwhile, nodes with larger datasets experience only a modest average performance decrease of 0.441%.
BibTeX
@misc{niehaus2024fair,
  author = {Sebastian Niehaus and Ingo Roeder and Nico Scherf},
  title = {{Fair Distributed Machine Learning with Imbalanced Data as a Stackelberg Evolutionary Game}},
  year = {2024},
  eprint = {2412.16079},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2412.16079},
}
Figure