mlsanityData to 7 Oct 2026

Post-Optimization Adaptive Rank Allocation for LoRA

arXiv 2604.27796 ↗First posted 30 Apr 2026cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Exponential growth in the scale of modern foundation models has led to the widespread adoption of Low-Rank Adaptation (LoRA) as a parameter-efficient fine-tuning technique. However, standard LoRA implementations disregard the varying intrinsic dimensionality of model layers and enforce a uniform rank, leading to parameter redundancy. We propose Post-Optimization Adaptive Rank Allocation (PARA), a data-free compression method for LoRA that integrates seamlessly into existing fine-tuning pipelines. PARA leverages Singular Value Decomposition to prune LoRA ranks using a global threshold over singular values across all layers. This results in non-uniform rank allocation based on layer-wise spectral importance. As a post-hoc method, PARA circumvents the training modifications and resulting instabilities that dynamic architectures typically incur. We empirically demonstrate that PARA reduces parameter count by 75-90% while preserving the predictive performance of the original, uncompressed LoRA across multiple vision and language benchmarks. Code will be published upon acceptance.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 14 of its 41 references that are in the map. First posted on arXiv 30 Apr 2026.

Builds on

14 of 41 references.

References · 14

  1. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  2. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  3. 2020Scaling Laws for Neural Language Modelscited by 6,411
  4. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  6. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  7. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  8. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  9. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  10. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  11. 2014Learning Ordered Representations with Nested Dropoutcited by 81
  12. 2024DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distributioncited by 41
2 more
  1. 2025PHLoRA: data-free Post-hoc Low-Rank Adapter extraction from full-rank checkpointcited by 5
  2. 2021A Simple Approach to Jointly Rank Passages and Select Relevant Sentences in the OBQA Contextcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.