Federated Learning is a Machine Learning paradigm in which multiple devices jointly train a shared model without the need to share their local data. Most Federated Learning approaches assume that the data remains static. However, this assumption is unrealistic in real-world scenarios where data may change over time. In this paper we study the impact of concept drift on Federated Learning models with heterogeneous data distribution. Client selection directly impacts the model’s performance, and we observe that the local loss of clients under concept drift deviates. Nevertheless, most applications select clients randomly for each training round. Our main contribution therefore is a probabilistic client selection algorithm that introduces a bias towards clients with higher local loss in order to counter concept drift. Extensive evaluations show that our algorithm recovers a drop in accuracy incurred by concept drift up to five times faster than random sampling while retaining competitive performance.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Adaption via Selection: On Client Selection to Counter Concept Drift in Federated Learning

  • Julius Thomas,
  • Finn Saile,
  • Mathias Fischer,
  • Dominik Kaaser,
  • Stefan Schulte

摘要

Federated Learning is a Machine Learning paradigm in which multiple devices jointly train a shared model without the need to share their local data. Most Federated Learning approaches assume that the data remains static. However, this assumption is unrealistic in real-world scenarios where data may change over time. In this paper we study the impact of concept drift on Federated Learning models with heterogeneous data distribution. Client selection directly impacts the model’s performance, and we observe that the local loss of clients under concept drift deviates. Nevertheless, most applications select clients randomly for each training round. Our main contribution therefore is a probabilistic client selection algorithm that introduces a bias towards clients with higher local loss in order to counter concept drift. Extensive evaluations show that our algorithm recovers a drop in accuracy incurred by concept drift up to five times faster than random sampling while retaining competitive performance.