Sign inGet started
Paper · arXiv

FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection

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 guarant...

AuthorsYutong He, Zhengyang Huang, Jiahe Geng et al.
Primary categorycs.LG
Published27 April 2026
Last updated at source9 June 2026
cs.LGmath.OC
Embed this entry
<iframe src="https://silytics.si/embed/item/f278ac74-4fcf-4b6f-8538-2b3781497967" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.