Power of Redundancy: Surplus Client Scheduling for Federated Learning against User Uncertainties
Youqi Li, Fan Li, Lixing Chen, Liehuang Zhu, Pan Zhou, Yu Wang
Abstract
Federated learning (FL) has reshaped the learning paradigm by overcoming privacy concerns and siloed data. In FL, an aggregator schedules a set of mobile users (MUs) to collectively train a global model with their local datasets and subsequently aggregates their model updates. However, the users have many uncertainties like unstable network connections and volatile availability, which leads to the straggler problem and deteriorates the efficiency of the FL system. Besides, the issue of non-IID datasets hinders the convergence performance of the global model. To hurdle the user uncertainties, we associate a deadline with the decision in each round and partially collect MUs' updates after the deadline, which can be achieved by considering surplus budget constraints. Moreover, we introduce fairness constraints for the non-IID issue. We propose a deadline-aware task replication for surplus client scheduling policy, called FEDDATE-CS. FEDDATE-CS is developed based on a novel contextual-combinatorial multi-armed bandit (CCMAB) learning framework with fairness guarantee. We extend the hypercube-based CCMAB framework by integrating the Lyapunov queuing technique and rigorously prove that FEDDATE-CS achieves a sublinear regret bound and provides an <formula><tex>$[\mathcal{O}(1/V),\mathcal{O}(V)]$</tex></formula> regret-fairness tradeoff for any fairness control factor <formula><tex>$V>0$</tex></formula>. We conduct extensive evaluations to verify the significant superiority of FEDDATE-CS over benchmarks.