mlsanityData to 7 Oct 2026

AILoRA: Function-Aware Asymmetric Initialization for Low-Rank Adaptation of Large Language Models

arXiv 2510.08034 ↗First posted 9 Oct 2025cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Parameter-efficient finetuning (PEFT) aims to mitigate the substantial computational and memory overhead involved in adapting large-scale pretrained models to diverse downstream tasks. Among numerous PEFT strategies, Low-Rank Adaptation (LoRA) has emerged as one of the most widely adopted approaches due to its robust empirical performance and low implementation complexity. In practical deployment, LoRA is typically applied to the WQ and WV projection matrices of self-attention modules, enabling an effective trade-off between model performance and parameter efficiency. While LoRA has achieved considerable empirical success, it still encounters challenges such as suboptimal performance and slow convergence. To address these limitations, we introduce AILoRA, a novel parameter-efficient method that incorporates function-aware asymmetric low-rank priors. Our empirical analysis reveals that the projection matrices WQ and WV in the self-attention mechanism exhibit distinct parameter characteristics, stemming from their functional differences. Specifically, WQ captures task-specific semantic space knowledge essential for attention distributions computation, making its parameters highly sensitive to downstream task variations. In contrast, WV encodes token-level feature representations that tend to remain stable across tasks and layers. Leveraging these insights, AILoRA performs a function-aware initialization by injecting the principal components of WQ to retain task-adaptive capacity, and the minor components of WV to preserve generalizable feature representations. This asymmetric initialization strategy enables LoRA modules to better capture the specialized roles of attention parameters, thereby enhancing both finetuning performance and convergence efficiency.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 40 of its 53 references that are in the map. First posted on arXiv 9 Oct 2025.

Builds on

40 of 53 references.

References · 40

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2022Training language models to follow instructions with human feedbackcited by 15,712
  4. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  5. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  6. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  7. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  8. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  9. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  10. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  11. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  12. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
28 more
  1. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  2. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  3. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  4. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  5. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  6. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
  7. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,219
  8. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  9. 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
  10. 2018Neural Network Acceptability Judgmentscited by 952
  11. 2023Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotationscited by 895
  12. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
  13. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 724
  14. 2020Pre-trained Models for Natural Language Processing: A Surveycited by 504
  15. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 365
  16. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 317
  17. 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
  18. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 261
  19. 2023A Rank Stabilization Scaling Factor for Fine-Tuning with LoRAcited by 231
  20. 2023Camels in a Changing Climate: Enhancing LM Adaptation with Tulu 2cited by 227
  21. 2023LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Modelscited by 195
  22. 2023Scaling Down to Scale Up: A Guide to Parameter-Efficient Fine-Tuningcited by 171
  23. 2022KronA: Parameter Efficient Tuning with Kronecker Adaptercited by 130
  24. 2023The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reductioncited by 120
  25. 2024MiLoRA: Harnessing Minor Singular Components for Parameter-Efficient LLM Finetuningcited by 89
  26. 2024DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distributioncited by 41
  27. 2024Scaling Laws for Forgetting When Fine-Tuning Large Language Modelscited by 36
  28. 2022Efficient Fine-Tuning of BERT Models on the Edgecited by 29

Built on by

Not cited yet.