mlsanityData to 14 Oct 2026

ERC-SVD: Error-Controlled SVD for Large Language Model Compression

arXiv 2505.20112 ↗First posted 26 May 2025cs.CL cs.AIcited by 7

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

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
  4. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  5. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  6. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  7. 2025Qwen3 Technical Reportcited by 8,820
  8. 2020Scaling Laws for Neural Language Modelscited by 6,586
  9. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
  10. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  11. 2023Improved Baselines with Visual Instruction Tuningcited by 4,418
  12. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
37 more
  1. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
  2. 2023Mistral 7Bcited by 3,164
  3. 2016Pointer Sentinel Mixture Modelscited by 3,096
  4. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  5. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  6. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  7. 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,919
  8. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  9. 2023Evaluating Object Hallucination in Large Vision-Language Modelscited by 1,729
  10. 2019Towards VQA Models That Can Readcited by 1,718
  11. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
  12. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  13. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  14. 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 662
  15. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  16. 2023FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPUcited by 575
  17. 2024A Survey on Knowledge Distillation of Large Language Modelscited by 284
  18. 2023A Survey on Model Compression for Large Language Modelscited by 269
  19. 2024A Comprehensive Survey of Hallucination Mitigation Techniques in Large Language Modelscited by 269
  20. 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
  21. 2024A Survey on Efficient Inference for Large Language Modelscited by 205
  22. 2022Language model compression with weighted low-rank factorizationcited by 195
  23. 2022The Carbon Footprint of Machine Learning Training Will Plateau, Then Shrinkcited by 184
  24. 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 169
  25. 2024BiLLM: Pushing the Limit of Post-Training Quantization for LLMscited by 144
  26. 2025Efficient Reasoning Models: A Surveycited by 95
  27. 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 64
  28. 2024Compressing Large Language Models using Low Rank and Low Precision Decompositioncited by 59
  29. 2024Survey on Knowledge Distillation for Large Language Models: Methods, Evaluation, and Applicationcited by 56
  30. 2023ZipLM: Inference-Aware Structured Pruning of Language Modelscited by 49
  31. 2024Basis Sharing: Cross-Layer Parameter Sharing for Large Language Model Compressioncited by 35
  32. 2024ARB-LLM: Alternating Refined Binarizations for Large Language Modelscited by 31
  33. 2023LORD: Low Rank Decomposition Of Monolingual Code LLMs For One-Shot Compressioncited by 26
  34. 2024Dual-Space Knowledge Distillation for Large Language Modelscited by 25
  35. 2024DISP-LLM: Dimension-Independent Structural Pruning for Large Language Modelscited by 24
  36. 2025AdaSVD: Adaptive Singular Value Decomposition for Large Language Modelscited by 15
  37. 2025Poison as Cure: Visual Noise for Mitigating Object Hallucinations in LVMscited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 2.

7 papers.