CoSpaDi: Compressing LLMs via Calibration-Guided Sparse Dictionary Learning
About
Post-training LLM compression often relies on low-rank approximations, which force all columns of a projection matrix to share a single low-dimensional subspace. We propose CoSpaDi, a training-free compression framework that replaces this single-subspace assumption with a union-of-subspaces model via sparse dictionary learning. CoSpaDi factorizes each weight matrix into a dense dictionary and column-sparse coefficients, allowing different columns to select different subsets of dictionary atoms at the same storage budget. To preserve model behavior, we use calibration activations to transform functional reconstruction into a standard dictionary learning problem. Across Llama and Qwen models, CoSpaDi improves accuracy--compression and perplexity--compression trade-offs over SVD-based and structured pruning baselines at 20--40\% compression ratios, while naturally supporting sparse--dense computation and post-training quantization of sparse coefficients.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Commonsense Reasoning | HellaSwag | Accuracy66.5 | 1896 | |
| Question Answering | ARC Challenge | Accuracy39.3 | 906 | |
| Mathematical Reasoning | MATH | Accuracy4.2 | 882 | |
| Instruction Following | IFEval | -- | 854 | |
| Reasoning | BBH | Accuracy54.2 | 770 | |
| Language Modeling | WikiText | PPL11.7 | 740 | |
| Physical Commonsense Reasoning | PIQA | Accuracy59.3 | 724 | |
| Question Answering | ARC Easy | Accuracy67.4 | 597 | |
| Question Answering | PIQA | Accuracy75.2 | 589 | |
| Question Answering | ARC-E | Accuracy66.5 | 544 |