Paper Detail

Rethinking Factor Sharing in Federated LoRA: A Rank-Aware Adaptive Approach

Xinyi Xu, Bingnan Xiao, Shuang Qin, Gang Feng, Tony Q. S. Quek

arxiv Score 7.2

Published 2026-08-10 · First seen 2026-08-11

General AI

Abstract

Low-rank adaptation (LoRA) represents large language model (LLM) updates with two compact matrix factors, i.e., $A$ and $B$, providing an efficient way to fine-tune large models in federated learning paradigm. Inspired by the asymmetric roles of the LoRA factors, we study whether $A$ should be shared across clients while $B$ remains client-specific (Share-A/Local-B), or whether $B$ should instead be shared while $A$ remains client-specific (Share-B/Local-A). With a least-squares surrogate, we reveal that Share-A/Local-B requires the client-specific LoRA update matrices to use a common rank-$r$ input-side space, whereas Share-B/Local-A requires a common rank-$r$ output-side space. The two strategies therefore incur different projection residuals, indicating that the preferred strategy is the one with the smaller aggregate residual across clients. With this insight, we propose Federated Adaptive Factor Sharing Low-Rank Adaptation (FedAS-LoRA), which selects the sharing side before training to enhance fine-tuning performance. To enable adaptive factor selection before training, we design a Rank-Aware Shared-Subspace Sufficiency (RSS) metric, which effectively assesses whether a shared rank-$r$ input subspace is sufficient for the local data distributions using representations extracted from a frozen LLM backbone. Experiments across different tasks, data distributions, LoRA ranks, and participation settings confirm the effectiveness of RSS and the superior performance of FedAS-LoRA.

Workflow Status

Review status
pending
Role
unreviewed
Read priority
soon
Vote
Not set.
Saved
no
Collections
Not filed yet.
Next action
Not filled yet.

Reading Brief

No structured notes yet. Add `summary_sections`, `why_relevant`, `claim_impact`, or `next_action` in `papers.jsonl` to enrich this view.

Why It Surfaced

No ranking explanation is available yet.

Tags

No tags.

BibTeX

@article{xu2026rethinking,
  title = {Rethinking Factor Sharing in Federated LoRA: A Rank-Aware Adaptive Approach},
  author = {Xinyi Xu and Bingnan Xiao and Shuang Qin and Gang Feng and Tony Q. S. Quek},
  year = {2026},
  abstract = {Low-rank adaptation (LoRA) represents large language model (LLM) updates with two compact matrix factors, i.e., \$A\$ and \$B\$, providing an efficient way to fine-tune large models in federated learning paradigm. Inspired by the asymmetric roles of the LoRA factors, we study whether \$A\$ should be shared across clients while \$B\$ remains client-specific (Share-A/Local-B), or whether \$B\$ should instead be shared while \$A\$ remains client-specific (Share-B/Local-A). With a least-squares surrogate, we re},
  url = {https://arxiv.org/abs/2608.09742},
  keywords = {cs.LG, cs.AI, cs.DC},
  eprint = {2608.09742},
  archiveprefix = {arXiv},
}

Metadata

{}