Efficient Federated Learning against Heterogeneous and Non-stationary Client Unavailability
<|reference_start|>Efficient Federated Learning against Heterogeneous and Non-stationary Client Unavailability: Addressing intermittent client availability is critical for the real-world deployment of federated learning algorithms. Most prior work either overlooks the potential non-stationarity in the dynamics of client unavailability or requires substantial memory/computation overhead. We study federated learning in the presence of heterogeneous and non-stationary client availability, which may occur when the deployment environments are uncertain or the clients are mobile. The impacts of the heterogeneity and non-stationarity in client unavailability can be significant, as we illustrate using FedAvg, the most widely adopted federated learning algorithm. We propose FedAPM, which includes novel algorithmic structures that (i) compensate for missed computations due to unavailability with only $O(1)$ additional memory and computation with respect to standard FedAvg, and (ii) evenly diffuse local updates within the federated learning system through implicit gossiping, despite being agnostic to non-stationary dynamics. We show that FedAPM converges to a stationary point of even non-convex objectives while achieving the desired linear speedup property. We corroborate our analysis with numerical experiments over diversified client unavailability dynamics on real-world data sets.<|reference_end|>
@article{xiang2024efficient,
    title={Efficient Federated Learning against Heterogeneous and Non-stationary
  Client Unavailability},
    author={Ming Xiang, Stratis Ioannidis, Edmund Yeh, Carlee Joe-Wong, Lili Su},
    journal={arXiv preprint arXiv:2409.17446},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.17446},
    primaryClass={cs.DC cs.LG math.OC}
}