Shears: Unstructured Sparsity with Neural Low-rank Adapter Search
J. Pablo Muñoz, Jinjie Yuan, Nilesh Jain
TL;DR
Shears addresses the cost and performance barriers of fine-tuning large language models by fusing unstructured sparsification with a Neural Low-Rank Adapter Search (NLS) to optimize elastic LoRA adapters on a sparsified base model. The method prunes the base model with Wanda, freezes the pruned weights, and trains a super-adapter network whose sub-adapters are discovered via NLS and a lightweight sub-adapter search. Across math and commonsense tasks on LLaMA and MPT models, Shears achieves high sparsity (up to 50–60% in some setups) with accuracy comparable to or exceeding traditional PEFT baselines and substantially better than full fine-tuning in many cases, while requiring far less compute and memory. This yields practical, deployment-friendly PEFT with compression, enabling efficient fine-tuning and inference on limited hardware, with code and models made available for reproducibility.
Abstract
Recently, several approaches successfully demonstrated that weight-sharing Neural Architecture Search (NAS) can effectively explore a search space of elastic low-rank adapters (LoRA), allowing the parameter-efficient fine-tuning (PEFT) and compression of large language models. In this paper, we introduce a novel approach called Shears, demonstrating how the integration of cost-effective sparsity and a proposed Neural Low-rank adapter Search (NLS) algorithm can further improve the efficiency of PEFT approaches. Results demonstrate the benefits of Shears compared to other methods, reaching high sparsity levels while improving or with little drop in accuracy, utilizing a single GPU for a pair of hours.
