Communication-Efficient Federated Low-Rank Update Algorithm and its Connection to Implicit Regularization
Haemin Park, Diego Klabjan

TL;DR
This paper introduces FedLoRU, a low-rank update framework for federated learning that reduces communication costs, provides theoretical insights into rank properties, and maintains competitive performance in heterogeneous environments.
Contribution
It presents the first theoretical analysis of rank properties in FL and proposes a low-rank update method that offers implicit regularization and communication efficiency.
Findings
FedLoRU achieves comparable accuracy to full-rank algorithms.
Theoretical analysis shows higher-rank structures in client losses.
FedLoRU is robust to heterogeneity and large client populations.
Abstract
Federated Learning (FL) faces significant challenges related to communication efficiency and performance reduction when scaling to many clients. To address these issues, we explore the potential of using low-rank updates and provide the first theoretical study of rank properties in FL. Our theoretical analysis shows that a client's loss exhibits a higher-rank structure (i.e., gradients span higher-rank subspaces of the Hessian) compared to the server's loss, and that low-rank approximations of the clients' gradients have greater similarity. Based on this insight, we hypothesize that constraining client-side optimization to a low-rank subspace could provide an implicit regularization effect while reducing communication costs. Consequently, we propose FedLoRU, a general low-rank update framework for FL. Our framework enforces low-rank client-side updates and accumulates these updates to…
Peer Reviews
Decision·Submitted to ICLR 2025
FedLoRU uses successive low-rank updates for both pre-training and fine-tuning in federated learning and achieves good performance.
W1. The novelty is not justified sufficiently. W2. More discussions and justifications regarding the stable rank metric are needed. W3. The experiment setup and results are not convincing.
1. The proposed method is well-motivated, the paper investigates the rank properties of client and server losses, analytically showing that under stochastic sampling, the rank of the Hessian of the loss function increases with smaller sample sizes. 2. The empirical results show empirical evidence of the higher rank structure of client losses and demonstrate that restricting the rank of local updates aids in implicit regularization.
1. In the theorems that are presented, summarizing the main insights of these theorems may be needed since currently they are just written as long paragraphs. 2. In experiments, the least partial client participation ratio is set as 0.5. In more realistic settings, the participation ratio is lower with more clients. 3. The author should consider more baselines, which apply low-rank factorized update models, such as [1]. [1] Nam Hyeon-Woo, Moon Ye-Bin, Tae-Hyun Oh. FedPara: Low-rank Hadamard Prod
This paper reveals that client loss in federated learning has a higher rank structure (in gradients and Hessian subspaces) than the server's loss. Based on this, they propose that restricting client optimization to a low-rank subspace could provide implicit regularization. They then introduce FedLoRU, a framework that enforces low-rank updates on the client side and aggregates them into a higher-rank model. Finally, they add another low-rank module pair to adapt to environments with statistical
The novelty is limited, there is no close connectiong between the analysis and the algorithm. I think this algorithm is a federated version of ReLoRA if we consider on the non-personalized version, aggregating low-rank modules for higher rank training. There is no theoretical analysis for the algorithm. It's fully heuristic. When we consider the personalized strategy this paper studied, I don't know what kind of solution will this algoritm converge to. Will the introduced L, U fully concel out
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlind Source Separation Techniques · Sparse and Compressive Sensing Techniques · Optical Network Technologies
