LoRA-Squeeze: Simple and Effective Post-Tuning and In-Tuning Compression of LoRA Modules
Ivan Vulić, Adam Grycner, Quentin de Laroussilhe, Jonas Pfeiffer
TL;DR
LoRA-Squeeze addresses the challenge of selecting and deploying fixed-rank LoRA adapters by proposing an overparameterized training paradigm: fine-tune with a high source rank $r_{src}$ to capture rich task updates $\Delta W$, then compress to a lower deployment rank $r_{tgt}$ using Randomized SVD. The method yields two operational modes—Post-Squeeze (post-hoc compression) and In-Squeeze (in-tuning rank annealing)—and includes a memory-efficient variant that avoids materializing the full $\Delta W$. Across 13 text tasks and 10 vision-language tasks on the Gemma-3 family, Post-Squeeze often matches or exceeds directly trained $r_{tgt}$-rank LoRA adapters, while In-Squeeze provides the best size–performance trade-offs, with Cont-Squeeze enabling quick recovery after aggressive compression. By decoupling training and deployment ranks and reducing per-rank hyperparameter sweeps, LoRA-Squeeze simplifies deployment and enhances parameter efficiency in practical PEFT settings, with potential extensions to other LoRA variants and automatic rank-selection strategies.
Abstract
Despite its huge number of variants, standard Low-Rank Adaptation (LoRA) is still a dominant technique for parameter-efficient fine-tuning (PEFT). Nonetheless, it faces persistent challenges, including the pre-selection of an optimal rank and rank-specific hyper-parameters, as well as the deployment complexity of heterogeneous-rank modules and more sophisticated LoRA derivatives. In this work, we introduce LoRA-Squeeze, a simple and efficient methodology that aims to improve standard LoRA learning by changing LoRA module ranks either post-hoc or dynamically during training}. Our approach posits that it is better to first learn an expressive, higher-rank solution and then compress it, rather than learning a constrained, low-rank solution directly. The method involves fine-tuning with a deliberately high(er) source rank, reconstructing or efficiently approximating the reconstruction of the full weight update matrix, and then using Randomized Singular Value Decomposition (RSVD) to create a new, compressed LoRA module at a lower target rank. Extensive experiments across 13 text and 10 vision-language tasks show that post-hoc compression often produces lower-rank adapters that outperform those trained directly at the target rank, especially if a small number of fine-tuning steps at the target rank is allowed. Moreover, a gradual, in-tuning rank annealing variant of LoRA-Squeeze consistently achieves the best LoRA size-performance trade-off.
