SoLA: Leveraging Soft Activation Sparsity and Low-Rank Decomposition for Large Language Model Compression
Xinhao Huang, You-Liang Huang, Zeyi Wen
Abstract
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%.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext bcd473fe-6597-43d2-8cdf-785ed3cee3b6Cited by top-tier papers5
- COALA: Numerically Stable and Efficient Framework for Context-Aware Low-Rank ApproximationUliana Parkina, Maxim RakhubaNeurIPS 2025 · 6 citations
- PocketLLM: Ultimate Compression of Large Language Models via Meta NetworksYe Tian, Chengcheng Wang, Jing Han, Yehui Tang et al.AAAI 2026 · 2 citations
- TD-MoE: Tensor Decomposition for MoE ModelsYuebin XU, YANHONG WANG, Xuemei Peng, Hui Zang et al.ICLR 2026
- Channel-Aware Mixed-Precision Quantization for Efficient Long-Context InferenceChengxi Liao, Zeyi WenICLR 2026
- Representation Drift Compensation: A Near-Zero Inference Cost Enhancement for LLM DecompositionXinhao Huang, You-Liang Huang, Zeyi WenICML 2026
Builds on14
- Measuring Massive Multitask Language UnderstandingDan Hendrycks, Collin Burns, Steven Basart, Andy Zou et al.ICLR 2021 · 7,905 citations
- QLoRA: Efficient Finetuning of Quantized LLMsTim Dettmers, Artidoro Pagnoni, Ari Holtzman, Luke ZettlemoyerNeurIPS 2023 · 5,863 citations
- SparseGPT: Massive Language Models Can be Accurately Pruned in One-ShotElias Frantar, Dan AlistarhICML 2023 · 1,240 citations
- A Simple and Effective Pruning Approach for Large Language ModelsMingjie Sun, Zhuang Liu, Anna Bair, J. Zico KolterICLR 2024 · 794 citations
- SliceGPT: Compress Large Language Models by Deleting Rows and ColumnsSaleh Ashkboos, Maximilian L. Croci, Marcelo Gennari Do Nascimento, Torsten Hoefler et al.ICLR 2024 · 346 citations
Related papers
- Training-Free Activation Sparsity in Large Language ModelsJames Liu, Pragaash Ponnusamy, Tianle Cai, Han Guo et al.ICLR 2025
- R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM InferenceZhenyu Zhang, Zechun Liu, Yuandong Tian, Harshit Khaitan et al.ICLR 2025
- CGSVD: Cascaded Granular Singular Value Decomposition for Large Language Model CompressionYuli Chen, Shuhao Zhang, Jiale Han, Fanshen Meng et al.ICML 2026
- WINA: Weight Informed Neuron Activation for Accelerating Large Language Model InferenceSihan Chen, Dan Zhao, Jongwoo Ko, Colby Banbury et al.ICLR 2026 · 3 citations
- SeedLM: Compressing LLM Weights into Seeds of Pseudo-Random GeneratorsRasoul Shafipour, David Harrison, Maxwell Horton, Jeffrey Marker et al.ICLR 2025
