Align Before Aggregation: Basis-Consistent Federated LoRA under Heterogeneous Ranks
arXiv cs.AIen
arXiv:2611.07598v1 Announce Type: new Abstract: Federated fine-tuning of large language models (LLMs) under heterogeneous client capacities is increasingly important, and low-rank adaptation (LoRA) with heterogeneous ranks makes it practical. Existing server-side aggregators compose local matrix updates $\Delta W_i$ from client-specific LoRA factors $(A_i,B_i)$ before aggregating them. Although these matrix updates lie in the same weight space $\mathbb{R}^{m\times n}$ and can be averaged directly, the LoRA factors that generate them may expressed client-specific local basis. In the typical compose--aggregate--factorize--dispatch loop, this basis inconsistency can make the rank-$r_i$ referenc
This is a short summary published by AI Global Wire. The full article is owned and hosted by arXiv cs.AI — open it there to read it in full.
Read the full story at arXiv cs.AI- Forskning
Related AI news
- BlockLock: Reproducible LLM Inference with Fixed Batch GeometryarXiv cs.AI · November 6, 2026
- KDASO: Knowledge-Data Dual-Driven Automated Skill Optimization for Liability Adjudication TasksarXiv cs.AI · November 6, 2026
- Adapting the Process of Adaptation: Darwinian, Lamarckian, and Agent-Directed Evolution in AIarXiv cs.AI · November 6, 2026
- SAVeR$^2$: Reasoning-based Safety Alignment for Large Reasoning Models via Verifiable RewardsarXiv cs.AI · November 6, 2026
- Graph learning-assisted logic-based Benders decomposition for distributionally robust in-station train rescheduling under disruptionsarXiv cs.AI · November 6, 2026
- Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent PathfindingarXiv cs.AI · November 6, 2026