SoLA: Leveraging Soft Activation Sparsity and Low-Rank Decomposition for Large Language Model Compression
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have demonstrated impressive capabilities across various tasks, but the billion-scale parameters pose deployment challenges. Although existing methods attempt to reduce the scale of LLMs, they require either special hardware support or expensive post-training to maintain model quality. To facilitate efficient and affordable model slimming, we propose a novel training-free compression method for LLMs, named "SoLA", which leverages Soft activation sparsity and Low-rAnk decomposition. SoLA can identify and retain a minority of components significantly contributing to inference, while compressing the majority through low-rank decomposition, based on our analysis of the activation pattern in the feed-forward network (FFN) of modern LLMs. To alleviate the decomposition loss, SoLA is equipped with an adaptive component-wise low-rank allocation strategy to assign appropriate truncation positions for different weight matrices. We conduct extensive experiments on LLaMA-2-7B/13B/70B and Mistral-7B models across a variety of benchmarks. SoLA exhibits remarkable improvement in both language modeling and downstream task accuracy without post-training. For example, with a 30% compression rate on the LLaMA-2-70B model, SoLA surpasses the state-of-the-art method by reducing perplexity from 6.95 to 4.44 and enhancing downstream task accuracy by 10%.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 16 of its 24 references that are in the map. First posted on arXiv 12 Mar 2026.
Builds on
16 of 24 references.
References · 16
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 252
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
4 more
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 226
- 2022Language model compression with weighted low-rank factorizationcited by 195
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
- 2022Bidirectional Language Models Are Also Few-shot Learnerscited by 48
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Rethinking the Role of Tensor Decompositions in Post-Training LLM Compressioncited by 4
- 2026Understanding Calibration and Truncation Error Propagation in Training-Free Low-Rank Compression for LLMscited by 2
- 2026DeInfer: Efficient Parallel Inferencing for Decomposed Large Language Modelscited by 0
- 2026Learning Functional Subspaces for Neural Network Compressioncited by 0
- 2026Learning Functional Subspaces for Neural Network Compression30 Sep 2026
- 2026Understanding Calibration and Truncation Error Propagation in Training-Free Low-Rank Compression for LLMs9 Aug 2026
- 2026Rethinking the Role of Tensor Decompositions in Post-Training LLM Compression2 Jun 2026
- 2026DeInfer: Efficient Parallel Inferencing for Decomposed Large Language Models20 Apr 2026