Fast Forwarding Low-Rank Training
Adir Rahamim, Naomi Saphra, Sara Kangaslahti, Yonatan Belinkov
TL;DR
Fast Forward presents a simple line-search-based acceleration for low-rank finetuning by alternating conventional Adam SGD steps with Fast Forward stages that extrapolate along the most recent weight update direction. By computing $ΔW = W_t - W_{t-1}$ and updating weights as $W_t + τ ΔW$ until the tiny validation loss stops improving, and by triggering these stages every $T_{interval} = 6$ steps, the method achieves substantial FLOPs and training-time reductions without harming final performance. Across three finetuning tasks and four models (1.4B–8B parameters), Fast Forward yields 41–87% FLOPs savings and 40–81% training-time reductions while preserving accuracy and standard benchmark results. The paper also analyzes why Fast Forward is ineffective for full-rank training, attributing it to the projection structure introduced by LoRA and suggesting directions for future optimizers and dynamic scheduling tailored to low-rank regimes.
Abstract
Parameter efficient finetuning methods like low-rank adaptation (LoRA) aim to reduce the computational costs of finetuning pretrained Language Models (LMs). Enabled by these low-rank settings, we propose an even more efficient optimization strategy: Fast Forward, a simple and effective approach to accelerate large segments of training. In a Fast Forward stage, we repeat the most recent optimizer step until the loss stops improving on a tiny validation set. By alternating between regular optimization steps and Fast Forward stages, Fast Forward provides up to an 87\% reduction in FLOPs and up to an 81\% reduction in train time over standard SGD with Adam. We validate Fast Forward by finetuning various models on different tasks and demonstrate that it speeds up training without compromising model performance. Additionally, we analyze when and how to apply Fast Forward.
