ERC-SVD: Error-Controlled SVD for Large Language Model Compression
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have demonstrated impressive capabilities in a wide range of downstream natural language processing tasks. Nevertheless, their considerable sizes and memory demands hinder practical deployment, underscoring the importance of developing efficient compression strategies. Singular value decomposition (SVD) decomposes a matrix into orthogonal components, enabling efficient low-rank approximation. This is particularly suitable for LLM compression, where weight matrices often exhibit significant redundancy. However, current SVD-based methods neglect the residual matrix from truncation, resulting in significant truncation loss. Additionally, compressing all layers of the model results in severe error propagation. To overcome these limitations, we propose ERC-SVD, a new post-training SVD-based LLM compression method from an error-controlled perspective. Specifically, we leverage the residual matrix generated during the truncation process to reduce truncation loss. Moreover, under a fixed overall compression ratio, we selectively compress the last few layers of the model, which mitigates error propagation and improves compressed model performance. Comprehensive evaluations on diverse LLM families and multiple benchmark datasets indicate that ERC-SVD consistently achieves superior performance over existing counterpart methods, demonstrating its practical effectiveness.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 49 of its 61 references that are in the map. First posted on arXiv 26 May 2025.
Builds on
49 of 61 references.
References · 49
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2025Qwen3 Technical Reportcited by 8,820
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Improved Baselines with Visual Instruction Tuningcited by 4,418
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
37 more
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
- 2023Mistral 7Bcited by 3,164
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,919
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2023Evaluating Object Hallucination in Large Vision-Language Modelscited by 1,729
- 2019Towards VQA Models That Can Readcited by 1,718
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 662
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2023FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPUcited by 575
- 2024A Survey on Knowledge Distillation of Large Language Modelscited by 284
- 2023A Survey on Model Compression for Large Language Modelscited by 269
- 2024A Comprehensive Survey of Hallucination Mitigation Techniques in Large Language Modelscited by 269
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
- 2024A Survey on Efficient Inference for Large Language Modelscited by 205
- 2022Language model compression with weighted low-rank factorizationcited by 195
- 2022The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrinkcited by 184
- 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 169
- 2024BiLLM: Pushing the Limit of Post-Training Quantization for LLMscited by 144
- 2025Efficient Reasoning Models: A Surveycited by 95
- 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 64
- 2024Compressing Large Language Models using Low Rank and Low Precision Decompositioncited by 59
- 2024Survey on Knowledge Distillation for Large Language Models: Methods, Evaluation, and Applicationcited by 56
- 2023ZipLM: Inference-Aware Structured Pruning of Language Modelscited by 49
- 2024Basis Sharing: Cross-Layer Parameter Sharing for Large Language Model Compressioncited by 35
- 2024ARB-LLM: Alternating Refined Binarizations for Large Language Modelscited by 31
- 2023LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compressioncited by 26
- 2024Dual-Space Knowledge Distillation for Large Language Modelscited by 25
- 2024DISP-LLM: Dimension-Independent Structural Pruning for Large Language Modelscited by 24
- 2025AdaSVD: Adaptive Singular Value Decomposition for Large Language Modelscited by 15
- 2025Poison as Cure: Visual Noise for Mitigating Object Hallucinations in LVMscited by 9
Built on by
Citing papers per year: 2025: 5; 2026: 2.
7 papers.
- 2025RewardMap: Tackling Sparse Rewards in Fine-grained Visual Reasoning via Multi-Stage Reinforcement Learningcited by 21
- 2025OBS-Diff: Accurate Pruning For Diffusion Models in One-Shotcited by 19
- 2025Layer-wise dynamic rank for compressing large language modelscited by 8
- 2025WARP: Weight Teleportation for Attack-Resilient Unlearning Protocolscited by 1
- 2025CALR: Corrective Adaptive Low-Rank Decomposition for Efficient Large Language Model Layer Compressioncited by 0
- 2026Per-Matrix Optimality Is Not Enough: Three-Level Optimization for Low-Rank LLM Compressioncited by 0
- 2026BELT : BEhavior-Aligned Low-Rank KV Cache Compression with Learned Top-k Rank Allocationcited by 0
- 2026BELT : BEhavior-Aligned Low-Rank KV Cache Compression with Learned Top-k Rank Allocation13 Oct 2026
- 2026Per-Matrix Optimality Is Not Enough: Three-Level Optimization for Low-Rank LLM Compression14 Sep 2026
- 2025WARP: Weight Teleportation for Attack-Resilient Unlearning Protocols29 Nov 2025
- 2025OBS-Diff: Accurate Pruning For Diffusion Models in One-Shot8 Oct 2025
- 2025RewardMap: Tackling Sparse Rewards in Fine-grained Visual Reasoning via Multi-Stage Reinforcement Learning2 Oct 2025
- 2025Layer-wise dynamic rank for compressing large language models30 Sep 2025
- 2025CALR: Corrective Adaptive Low-Rank Decomposition for Efficient Large Language Model Layer Compression21 Aug 2025