mlsanityData to 14 Oct 2026

PreLort: Prefix-Nested LoRA for Federated Fine-Tuning under Rank Heterogeneity

arXiv 2606.15963 ↗First posted 14 Jun 2026cs.DC cs.AI cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Federated fine-tuning of large language models using parameter-efficient methods such as LoRA enables privacy-preserving adaptation of foundation models. Heterogeneous hardware resources introduce challenges, as clients with different adapter ranks cannot be directly aggregated. While existing methods enable aggregation under heterogeneous ranks, they fail to control how information is distributed across rank dimensions, leading to suboptimal use of shared low-rank representations. Instead, we propose PreLort: a nested low-rank formulation for federated LoRA that organizes adapter dimensions into a prefix hierarchy. Our approach ensures that lower-rank dimensions encode task-relevant information, while higher-rank dimensions capture additional capacity. Building on this, we introduce (i) a segment-wise aggregation rule that averages only over clients contributing to each rank segment, avoiding dilution from zero-padded lower-rank clients, and (ii) a prefix-nested training strategy that optimizes each adapter under multiple rank truncations, encouraging useful signal to concentrate in low-rank prefix dimensions. Together, these components encourage a consistent low-rank prefix capturing the most task-relevant information, while higher-rank dimensions learn additional capacity. This allows low-rank clients to benefit from richer information contributed by higher-rank clients, as prefix dimensions are consistently learned and aggregated. Experiments demonstrate that our method consistently outperforms prior heterogeneous federated LoRA methods in accuracy and ROUGE-L, while achieving lower or comparable perplexity across multiple base models.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 30 references that are in the map. First posted on arXiv 14 Jun 2026.

Builds on

23 of 30 references.

References · 23

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  4. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  5. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  6. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  7. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  8. 2022Editing Models with Task Arithmeticcited by 1,120
  9. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
  10. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
  11. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  12. 2021Merging Models with Fisher-Weighted Averagingcited by 621
11 more
  1. 2024TinyLlama: An Open-Source Small Language Modelcited by 618
  2. 2018Slimmable Neural Networkscited by 305
  3. 2022Matryoshka Representation Learningcited by 282
  4. 2019Universally Slimmable Networks and Improved Training Techniquescited by 221
  5. 2021FjORD: Fair and Accurate Federated Learning under heterogeneous targets with Ordered Dropoutcited by 192
  6. 2023Towards Building the Federated GPT: Federated Instruction Tuningcited by 185
  7. 2024FLoRA: Federated Fine-Tuning Large Language Models with Heterogeneous Low-Rank Adaptationscited by 146
  8. 2024Heterogeneous LoRA for Federated Fine-tuning of On-Device Foundation Modelscited by 116
  9. 2025LoFT: Low-Rank Adaptation That Behaves Like Full Fine-Tuningcited by 14
  10. 2025Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networkscited by 6
  11. 2025A Framework for Double-Blind Federated Adaptation of Foundation Modelscited by 1

Built on by

Not cited yet.