QR-LoRA: QR-Based Low-Rank Adaptation for Efficient Fine-Tuning of Large Language Models

๐Ÿ“… 2025-08-29
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
To address the excessive number of trainable parameters in large language model (LLM) fine-tuning, this paper proposes QR-LoRA, a low-rank adaptation method based on column-pivoted QR decomposition. Unlike standard LoRA or SVD-initialized variants, QR-LoRA efficiently constructs an orthogonal basis for pretrained weights via QR decomposition and represents adaptation updates as sparse linear combinations within this basisโ€”optimizing only a small set of coefficients. This design jointly enhances computational efficiency and interpretability. QR-LoRA is the first to integrate a structured orthogonal basis into the low-rank adaptation framework. On the GLUE benchmark, it matches or surpasses full fine-tuning, standard LoRA, and SVD-LoRA in performance. With as few as 601 trainable parameters, it reduces parameter count by over 1,000ร— compared to full fine-tuning and by 77ร— relative to typical LoRA, achieving substantial gains in parameter efficiency.

Technology Category

Application Category

๐Ÿ“ Abstract
The growing scale of Large Language Models (LLMs) has necessitated the development of parameter-efficient fine-tuning techniques. Low-Rank Adaptation (LoRA) has emerged as a promising approach, reducing the number of trainable parameters by applying low-rank updates to pretrained weights. While standard LoRA learns both update factors directly, several recent variants first initialize those matrices via an SVD of the pretrained weights -- an operation that can be expensive on large models and yields singular vectors that are not always easy to interpret. In this work, we extract an orthonormal basis from the pretrained weight matrix using QR decomposition with column pivoting, and then express the LoRA update as a linear combination of these basis vectors -- training only the scalar coefficients, which imposes clear structure on adaptation and drastically reduces parameter count. Experiments across GLUE tasks show that QR-LoRA matches or exceeds the performance of full fine-tuning, standard LoRA, and SVD-LoRA (LoRA with update matrices initialized via singular value decomposition) with as few as 601 parameters -- a reduction of over 1000x compared to full fine-tuning and 77x fewer than typical LoRA setups.
Problem

Research questions and friction points this paper is trying to address.

Reduces trainable parameters in large language models
Improves efficiency over standard LoRA fine-tuning methods
Uses QR decomposition instead of SVD for better interpretability
Innovation

Methods, ideas, or system contributions that make the work stand out.

QR decomposition for orthonormal basis extraction
Linear combination of basis vectors for updates
Training only scalar coefficients to reduce parameters
J
Jessica Liang
University of Pennsylvania
A
Anirudh Bharadwaj
University of Pennsylvania