mlsanityData to 14 Oct 2026

L1RA: Dynamic Rank Assignment in LoRA Fine-Tuning

arXiv 2509.04884 ↗First posted 5 Sep 2025cs.CL cs.PFcited by 4

Not on the map. Why?

Abstract (arXiv)

The ability of Large Language Models (LLMs) to solve complex tasks has made them crucial in the development of AI-based applications. However, the high computational requirements to fine-tune these LLMs on downstream tasks pose significant challenges, particularly when resources are limited. In response to this challenge, we introduce L1RA, a novel technique aimed at dynamically distributing the rank of low-rank adapters during fine-tuning using LoRA. Given a rank budget (i.e., total sum of adapters rank), L1RA leverages L1 regularisation to prune redundant ranks and redistribute them across adapters, thereby optimising resource utilisation. Through a series of comprehensive experiments, we empirically demonstrate that L1RA maintains comparable or even reduced computational overhead compared to other LoRA variants, including the vanilla approach, while achieving same or better performances. Moreover, the post-training analysis of rank distribution unveiled insights into the specific model components requiring the most adaptation to align with the task objective: the feed-forward layers and the attention output projection. These results highlight the efficacy of L1RA in not only enhancing the efficiency of LLM fine-tuning, but also in providing valuable diagnostic information for model refinement and customisation. In conclusion, L1RA stands as a promising technique for advancing the performance and interpretability of LLM adaptation, particularly in scenarios where computational resources are constrained.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 13 of its 20 references that are in the map. First posted on arXiv 5 Sep 2025.

Builds on

13 of 20 references.

References · 13

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  4. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  5. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  6. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  7. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
  8. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 377
  9. 2023Fine-Tuning Language Models with Just Forward Passescited by 345
  10. 2023VeRA: Vector-based Random Matrix Adaptationcited by 300
  11. 2023A Rank Stabilization Scaling Factor for Fine-Tuning with LoRAcited by 243
  12. 2019Simple, Scalable Adaptation for Neural Machine Translationcited by 242
1 more
  1. 2022DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptationcited by 233

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 4.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025LoRA Is Slower Than You Think
  2. 2024LoRA Land: 310 Fine-tuned LLMs that Rival GPT-4, A Technical Report
  3. 2024LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameters
  4. 2026Strategic Over-Parameterization for Generalizable Low-Rank Adaptation
  5. 2025Rank Also Matters: Hierarchical Configuration for Mixture of Adapter Experts in LLM Fine-Tuning
  6. 2026Learning Rate Matters: Vanilla LoRA May Suffice for LLM Fine-tuning
  7. 2026ID-LoRA: Efficient Low-Rank Adaptation Inspired by Matrix Interpolative Decomposition
  8. 2026TLoRA: Task-aware Low Rank Adaptation of Large Language Models