mlsanityData to 14 Oct 2026

DenseLoRA: Dense Low-Rank Adaptation of Large Language Models

arXiv 2505.23808 ↗First posted 27 May 2025cs.CL cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Low-rank adaptation (LoRA) has been developed as an efficient approach for adapting large language models (LLMs) by fine-tuning two low-rank matrices, thereby reducing the number of trainable parameters. However, prior research indicates that many of the weights in these matrices are redundant, leading to inefficiencies in parameter utilization. To address this limitation, we introduce Dense Low-Rank Adaptation (DenseLoRA), a novel approach that enhances parameter efficiency while achieving superior performance compared to LoRA. DenseLoRA builds upon the concept of representation fine-tuning, incorporating a single Encoder-Decoder to refine and compress hidden representations across all adaptation layers before applying adaptation. Instead of relying on two redundant low-rank matrices as in LoRA, DenseLoRA adapts LLMs through a dense low-rank matrix, improving parameter utilization and adaptation efficiency. We evaluate DenseLoRA on various benchmarks, showing that it achieves 83.8% accuracy with only 0.01% of trainable parameters, compared to LoRA's 80.8% accuracy with 0.70% of trainable parameters on LLaMA3-8B. Additionally, we conduct extensive experiments to systematically assess the impact of DenseLoRA's components on overall model performance. Code is available at https://github.com/mulin-ahu/DenseLoRA.

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

Builds on

27 of 37 references.

References · 27

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  5. 2022Large Language Models are Zero-Shot Reasonerscited by 4,374
  6. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  7. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  8. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  9. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  10. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  11. 2022DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generationcited by 3,300
  12. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
15 more
  1. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  2. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  3. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
  4. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
  5. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  6. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
  7. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 650
  8. 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 460
  9. 2023VeRA: Vector-based Random Matrix Adaptationcited by 300
  10. 2023Navigating Text-To-Image Customization: From LyCORIS Fine-Tuning to Model Evaluationcited by 109
  11. 2023Residual Prompt Tuning: Improving Prompt Tuning with Residual Reparameterizationcited by 64
  12. 2024LoFiT: Localized Fine-tuning on LLM Representationscited by 57
  13. 2024Mixture-of-Subspaces in Low-Rank Adaptationcited by 47
  14. 2024Advancing Parameter Efficiency in Fine-tuning via Representation Editingcited by 37
  15. 2024NoRA: Nested Low-Rank Adaptation for Efficient Fine-Tuning Large Modelscited by 13

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 4.

4 papers.