Riemannian Federated Learning via Averaging Gradient Stream
<|reference_start|>Riemannian Federated Learning via Averaging Gradient Stream: In recent years, federated learning has garnered significant attention as an efficient and privacy-preserving distributed learning paradigm. In the Euclidean setting, Federated Averaging (FedAvg) and its variants are a class of efficient algorithms for expected (empirical) risk minimization. This paper develops and analyzes a Riemannian Federated Averaging Gradient Stream (RFedAGS) algorithm, which is a generalization of FedAvg, to problems defined on a Riemannian manifold. Under standard assumptions, the convergence rate of RFedAGS with fixed step sizes is proven to be sublinear for an approximate stationary solution. If decaying step sizes are used, the global convergence is established. Furthermore, assuming that the objective obeys the Riemannian Polyak-{\L}ojasiewicz property, the optimal gaps generated by RFedAGS with fixed step size are linearly decreasing up to a tiny upper bound, meanwhile, if decaying step sizes are used, then the gaps sublinearly vanish.   Numerical simulations conducted on synthetic and real-world data demonstrate the performance of the proposed RFedAGS.<|reference_end|>
@article{huang2024riemannian,
    title={Riemannian Federated Learning via Averaging Gradient Stream},
    author={Zhenwei Huang, Wen Huang, Pratik Jawanpuria, Bamdev Mishra},
    journal={arXiv preprint arXiv:2409.07223},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.07223},
    primaryClass={cs.LG math.OC}
}