🤖 AI Summary
To address the high computational cost and limited acceleration potential in large language model (LLM) fine-tuning, this paper proposes an efficient fine-tuning method leveraging context-aware sparsity. Unlike parameter-efficient approaches such as QLoRA and DoRA—which solely reduce parameter count—our method introduces, for the first time, a training-agnostic lightweight SVD-based sparsity estimator. It integrates context-aware sparsification, SVD-driven dynamic weight selection, hierarchical sensitivity modeling, and adaptive sparsity control to dynamically skip redundant computations during both forward and backward passes. Experiments demonstrate up to a 2.2× reduction in FLOPs and a 1.6× speedup in actual training time, with zero accuracy degradation across diverse downstream tasks—including commonsense reasoning, arithmetic reasoning, code generation, and instruction following.
📝 Abstract
Fine-tuning LLMs is both computationally and memory-intensive. While parameter-efficient fine-tuning methods, such as QLoRA and DoRA, reduce the number of trainable parameters and lower memory usage, they do not decrease computational cost. In some cases, they may even slow down fine-tuning. In this paper, we introduce SparseLoRA, a method that accelerates LLM fine-tuning through contextual sparsity. We propose a lightweight, training-free SVD sparsity estimator that dynamically selects a sparse subset of weights for loss and gradient computation. Also, we systematically analyze and address sensitivity across layers, tokens, and training steps. Our experimental results show that SparseLoRA reduces computational cost by up to 2.2 times and a measured speedup of up to 1.6 times while maintaining accuracy across various downstream tasks, including commonsense and arithmetic reasoning, code generation, and instruction following.