FedHSIP reformulates all LoRA parameters into a shared low-dimensional trainable vector, enabling clients to optimize and communicate only low-dimensional updates, and transforms federated LoRA from a bilinear factor aggregation problem into a unified linear parameter space, thereby eliminating aggregation mismatch and preventing the quadratic amplification of DP noise.
Abstract
Federated Low-Rank Adaptation (LoRA) provides an efficient solution for finetuning large language models across distributed and privacy-sensitive data. However, despite avoiding raw data sharing, federated LoRA remains vulnerable to privacy leakage through transmitted model updates. Differential privacy (DP) mitigates such leakage, but integrating DP into federated LoRA introduces two fundamental challenges: aggregation mismatch from independently averaging low-rank factors, and quadratic noise amplification when noise is injected into both factors. To address these challenges, we propose FedHSIP, a differentially private federated LoRA framework based on a unified low-dimensional parameterization. FedHSIP reformulates all LoRA parameters into a shared low-dimensional trainable vector, enabling clients to optimize and communicate only low-dimensional updates. This reformulation transforms federated LoRA from a bilinear factor aggregation problem into a unified linear parameter space, thereby eliminating aggregation mismatch and preventing the quadratic amplification of DP noise. To further handle non-IID data, we introduce a heterogeneity- and sensitivity-aware isometric projection, constructed from warm-up statistics, which groups coordinates with compatible cross-client update patterns while balancing sensitivity, update energy, and heterogeneity across the low-dimensional space. Extensive experiments on natural language understanding and generation benchmarks show that FedHSIP consistently outperforms existing federated LoRA methods under both private and non-private settings, achieving up to 3-4% improvements under differential privacy while reducing communication cost by over 80% and maintaining robustness under heterogeneous data distributions.
Federated Learning (FL) enables privacy-preserving fine-tuning of Large Language Models (LLMs), yet the massive communication overhead remains a critical bottleneck. Furthermore, applying Low-Rank Adaptation (LoRA) in FL faces a fundamental"aggregation dilemma"between the accurate Sum-of-Products (SoP) and the communic...
Han Zou, Chao Zhang, Yu-Zhi Yang et al.· 0 citations
Across MNIST and CIFAR-10, the design matches or outperforms full-model private adaptation across privacy budgets and client heterogeneity, while reducing protected uplink by a factor of 2.67 at \(\varepsilon=16\) on CIFAR-10 with comparable future-client accuracy.
Yi-Lin Xu, Chun Hei Michael Shiu, Chih-Wei Ling et al.· 0 citations
CFLoRA is presented, a federated LoRA scheme that partitions latent LoRA channels into two complementary sets in every communication round, and eliminates bilinear terms in matrix multiplications, making federated aggregation exact.
Ya-Nan Ma, Qi-Yuan Chen, Zi-Han Fang et al.· 0 citations
Federated learning (FL) trains a shared model across data holders that cannot pool their records, but deployments remain bounded by three coupled costs: uplink traffic from repeated model exchange, accuracy loss under statistically heterogeneous clients, and the information that updates still leak. These are usually at...
Harshavardhan Peddireddy, Sandeep Kumar Gadde, Prasad Bheemavarapu et al.· 2026 International Conferenc...· 0 citations
FedRoRA (Federated Rank-wise Personalized LoRA) is proposed, a novel framework that enables fine-grained personalization within rank-heterogeneous federations and consistently outperforms state-of-the-art methods.
Lei Wang, Jieming Bian, Letian Zhang et al.· 0 citations
This work proposes FedLSA, a Federated Low-rank Subspace Adaptive update framework, which utilizes the cosine similarity of updates to the low rank coefficient matrix B as an economical proxy for subspace drift, which minimizes overhead on the server through dynamic Singular Value Decomposition (SVD) allocation.
Zhen-Cheng Fan· Poster Volume 0008 The 2026...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.