mlsanityData to 7 Oct 2026

TaRA: Training-Aware Low-Rank Adaptation Initialization

arXiv 2609.02639 ↗First posted 2 Sep 2026cs.CL cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Low-Rank Adaptation (LoRA) has become a de facto standard for parameter-efficient fine-tuning (PEFT), yet its performance is highly sensitive to initialization due to the information bottleneck imposed by low-rank decomposition. Existing approaches attempt to construct high-quality LoRA initializations by exploiting principal components of pretrained weights, activations, or gradients. However, these methods do not directly account for the training dynamics of the full-rank model. In this paper, we propose Training-aware Low-Rank Adaptation Initialization (TaRA), a method that initializes LoRA such that the gradients induced by the low-rank factors closely approximate the gradient of the corresponding full-rank weight matrix. Derived from a mathematical formulation, TaRA improves gradient fidelity at the start of training while introducing negligible computational overhead. Across diverse and challenging fine-tuning tasks, TaRA consistently outperforms prior state-of-the-art methods, establishing a simple, robust, and scalable solution for effective LoRA initialization.

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

Builds on

40 of 57 references.

References · 40

  1. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  2. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  3. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  4. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  5. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  6. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  7. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  8. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  9. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  10. 2021Program Synthesis with Large Language Modelscited by 3,509
  11. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  12. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
28 more
  1. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  2. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  3. 2018Neural Network Acceptability Judgmentscited by 952
  4. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
  5. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
  6. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
  7. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
  8. 2014New insights and perspectives on the natural gradient methodcited by 435
  9. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
  10. 2024OpenCodeInterpreter: Integrating Code Generation with Execution and Refinementcited by 242
  11. 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
  12. 2020AdapterDrop: On the Efficiency of Adapters in Transformerscited by 223
  13. 2021WARP: Word-level Adversarial ReProgrammingcited by 220
  14. 2018Gradient Descent Happens in a Tiny Subspacecited by 208
  15. 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 207
  16. 2022Language model compression with weighted low-rank factorizationcited by 192
  17. 2024Lessons from the Trenches on Reproducible Evaluation of Language Modelscited by 172
  18. 2024LoRA-GA: Low-Rank Adaptation with Gradient Approximationcited by 134
  19. 2022ATTEMPT: Parameter-Efficient Multi-task Tuning via Attentional Mixtures of Soft Promptscited by 85
  20. 2023Conditional Adapters: Parameter-efficient Transfer Learning with Fast Inferencecited by 69
  21. 2024The Impact of Initialization on LoRA Finetuning Dynamicscited by 53
  22. 2024OLoRA: Orthonormal Low-Rank Adaptation of Large Language Modelscited by 39
  23. 2025LoRA-One: One-Step Full Gradient Could Suffice for Fine-Tuning Large Language Models, Provably and Efficientlycited by 35
  24. 2022Numerical Optimizations for Weighted Low-rank Estimation on Language Modelcited by 14
  25. 2022Tiny-Attention Adapter: Contexts Are More Important Than the Number of Parameterscited by 12
  26. 2025Generalized Fisher-Weighted SVD: Scalable Kronecker-Factored Fisher Approximation for Compressing Large Language Modelscited by 7
  27. 2024MiSS: Revisiting the Trade-off in LoRA with an Efficient Shard-Sharing Structurecited by 6
  28. 2025SVDq: 1.25-bit and 410x Key Cache Compression for LLM Attentioncited by 6

Built on by

Not cited yet.