English

A Multi-Armed Bandit-Based Participant Selection Method for Federated Recommendation Systems

Distributed, Parallel, and Cluster Computing 2026-05-26 v3

Abstract

Federated Recommendation Systems (FRS) enable privacy-preserving model training by keeping user data on edge devices. However, the practical deployment of FRS in Edge-Cloud environments faces significant challenges due to system and statistical heterogeneity. Existing FRS participant selection strategies struggle to dynamically balance the trade-off between model convergence speed and recommendation quality in such volatile environments. To address this, we formulate the FRS participant selection problem as a normalized utility cost addressing the model quality and system efficiency. Next, we propose a dynamic participant selection framework incorporating a Multi-Armed Bandit (MAB)-based solver for multimodal FRS. We design a client-utility function that jointly evaluates historical Client Performance Reputation, data quality, and real-time system latency. By leveraging an Upper Confidence Bound strategy, our framework effectively balances the exploration of under-sampled clients with the exploitation of high-performing ones. We validate the proposed approach on a realistic edge-cloud testbed implementation using a multimodal movie-recommendation task. Experimental results demonstrate that our MAB-driven approach outperforms other baselines across eight different data-skew scenarios. Specifically, it improves training efficiency by 32-50% while improving model quality metrics such as Recall@50 by up to around 5%

Keywords

Cite

@article{arxiv.2507.15233,
  title  = {A Multi-Armed Bandit-Based Participant Selection Method for Federated Recommendation Systems},
  author = {Jintao Liu and Mohammad Goudarzi and Adel Nadjaran Toosi},
  journal= {arXiv preprint arXiv:2507.15233},
  year   = {2026}
}

Comments

Accepted in IEEE/ACM CCGRID 2026

R2 v1 2026-07-01T04:10:30.204Z