TL;DR
FedSLoP introduces a low-rank gradient projection method for federated learning, significantly reducing communication and memory costs while maintaining competitive accuracy, supported by theoretical convergence guarantees.
Contribution
The paper proposes FedSLoP, a novel federated optimization algorithm using stochastic low-rank gradient projections, with proven convergence and improved efficiency over existing methods.
Findings
FedSLoP reduces communication volume compared to FedAvg.
FedSLoP achieves similar or better accuracy in heterogeneous data settings.
Theoretical analysis guarantees convergence to a stationary point at rate O(1/√NT).
Abstract
Federated learning enables a population of clients to collaboratively train machine learning models without exchanging their raw data, but standard algorithms such as FedAvg suffer from slow convergence and high communication and memory costs in heterogeneous, resource-constrained environments. We introduce FedSLoP, a federated optimization algorithm that combines stochastic low-rank subspace projections of gradients, thereby reducing the dimension of communicated and stored updates while preserving optimization progress. On the theoretical side, we develop a detailed nonconvex convergence analysis under standard smoothness and bounded-variance assumptions, showing that FedSLoP is guaranteed to converge to a first-order stationary point at a rate of . On the empirical side, we conduct extensive experiments on federated MNIST classification with heterogeneous data…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
