Federated Learning with Fair Worker Selection: A Multi-Round Submodular Maximization Approach
In this paper, we study the problem of fair worker selection in Federated Learning systems, where fairness serves as an incentive mechanism that encourages more workers to participate in the federation. Considering the achieved training accuracy of the global model as the utility of the selected workers, which is typically a monotone submodular function, we formulate the worker selection problem as a new multi-round monotone submodular maximization problem with cardinality and fairness constraints. The objective is to maximize the time-average utility over multiple rounds subject to an additional fairness requirement that each worker must be selected for a certain fraction of time. While the traditional submodular maximization with a cardinality constraint is already a well-known NP-Hard problem, the fairness constraint in the multi-round setting adds an extra layer of difficulty. To address this novel challenge, we propose three algorithms: Fair Continuous Greedy (FairCG1 and FairCG2) and Fair Discrete Greedy (FairDG), all of which satisfy the fairness requirement whenever feasible. Moreover, we prove nontrivial lower bounds on the achieved time-average utility under FairCG1 and FairCG2. In addition, by giving a higher priority to fairness, FairDG ensures a stronger short-term fairness guarantee, which holds in every round. Finally, we perform extensive simulations to verify the effectiveness of the proposed algorithms in terms of the time-average utility and fairness satisfaction.
Code (0)
등록된 구현이 없습니다.
Tasks
FairnessFederated LearningSimilar Papers 제목 키워드 기반
Hiring from a pool of workers
In many countries and institutions around the world, the hiring of workers is made through open competitions. In them, candidates take tests and are ranked based on scores in exams and other predetermined criteria. Those…
FairnessFairness-Aware Client Selection for Federated Learning
Federated learning (FL) has enabled multiple data owners (a.k.a. FL clients) to train machine learning models collaboratively without revealing private data. Since the FL server can only engage a limited number of client…
FairnessFederated LearningFedFair^3: Unlocking Threefold Fairness in Federated Learning
Federated Learning (FL) is an emerging paradigm in machine learning without exposing clients' raw data. In practical scenarios with numerous clients, encouraging fair and efficient client participation in federated learn…
FairnessFederated LearningMulti-Criteria Client Selection and Scheduling with Fairness Guarantee for Federated Learning Service
Federated Learning (FL) enables multiple clients to train machine learning models collaboratively without sharing the raw training data. However, for a given FL task, how to select a group of appropriate clients fairly b…
FairnessFederated LearningSchedulingAFAFed -- Protocol analysis
In this paper, we design, analyze the convergence properties and address the implementation aspects of AFAFed. This is a novel Asynchronous Fair Adaptive Federated learning framework for stream-oriented IoT application e…
FairnessFederated Learning