DipSVD: Dual-importance Protected SVD for Efficient LLM Compression
Not on the map. Why?
Abstract (arXiv)
The ever-increasing computational demands and deployment costs of large language models (LLMs) have spurred numerous compressing methods. Compared to quantization and unstructured pruning, SVD compression offers superior hardware compatibility and theoretical guarantees. However, existing SVD-based methods focus on the overall discrepancy between the original and compressed matrices while overlooking the protection of critical components within the matrix, which leads to inferior performance in the compressed models. This paper proposes a dual-level importance protection mechanism to enhance SVD-based compression methods: (1) local importance protection: preserving the most critical singular vectors within each weight matrix through channel-weighted data whitening; and (2) global importance protection: enabling less important layers to bear a greater portion of the compression burden through either a heuristic or optimization-based approach, thereby minimizing the impact of compression on critical layers. Extensive experiments demonstrate that DipSVD outperforms existing SVD-based compression approaches across multiple benchmarks, achieving superior model performance especially at high model compression ratios.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 20 of its 28 references that are in the map. First posted on arXiv 25 Jun 2025.
Builds on
20 of 28 references.
References · 20
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 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
- 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 662
- 2023Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoningcited by 391
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2022Selection-Inference: Exploiting Large Language Models for Interpretable Logical Reasoningcited by 334
8 more
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
- 2023Large Language Model Guided Tree-of-Thoughtcited by 221
- 2022Language model compression with weighted low-rank factorizationcited by 195
- 2015Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applicationscited by 162
- 2024GTBench: Uncovering the Strategic Reasoning Limitations of LLMs via Game-Theoretic Evaluationscited by 120
- 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
- 2021ActNN: Reducing Training Memory Footprint via 2-Bit Activation Compressed Trainingcited by 61
- 2025Sliding-Window Merging for Compacting Patch-Redundant Layers in LLMscited by 9
Built on by
Citing papers per year: 2025: 1; 2026: 7.
8 papers.
- 2026SAES-SVD: Self-Adaptive Suppression of Accumulated and Local Errors for SVD-based LLM Compressioncited by 12
- 2026AA-SVD : Anchored and Adaptive SVD for Large Language Model Compressioncited by 7
- 2026Pruning as a Cooperative Game: Surrogate-Assisted Layer Contribution Estimation for Large Language Modelscited by 3
- 2026Different Prompts, Different Ranks: Prompt-aware Dynamic Rank Selection for SVD-based LLM Compressioncited by 1
- 2025NeuronMLP: Efficient LLM Inference via Singular Value Decomposition Compression and Tiling on AWS Trainiumcited by 0
- 2026SAFE-SVD: Sensitivity-Aware Fidelity-Enforcing SVD for Physics Foundation Modelscited by 0
- 2026Per-Matrix Optimality Is Not Enough: Three-Level Optimization for Low-Rank LLM Compressioncited by 0
- 2026The Functional Structure of Post-Compression Recovery in Low-Rank LLMscited by 0
- 2026The Functional Structure of Post-Compression Recovery in Low-Rank LLMs4 Oct 2026
- 2026Per-Matrix Optimality Is Not Enough: Three-Level Optimization for Low-Rank LLM Compression14 Sep 2026
- 2026SAFE-SVD: Sensitivity-Aware Fidelity-Enforcing SVD for Physics Foundation Models18 May 2026
- 2026Different Prompts, Different Ranks: Prompt-aware Dynamic Rank Selection for SVD-based LLM Compression9 May 2026
- 2026AA-SVD : Anchored and Adaptive SVD for Large Language Model Compression2 Apr 2026
- 2026Pruning as a Cooperative Game: Surrogate-Assisted Layer Contribution Estimation for Large Language Models8 Feb 2026
- 2026SAES-SVD: Self-Adaptive Suppression of Accumulated and Local Errors for SVD-based LLM Compression3 Feb 2026
- 2025NeuronMLP: Efficient LLM Inference via Singular Value Decomposition Compression and Tiling on AWS Trainium29 Oct 2025
Similar, not cited
Close in wording, no citation either way
- 2026Swift-SVD: Theoretical Optimality Meets Practical Efficiency in Low-Rank LLM Compression
- 2025AdaSVD: Adaptive Singular Value Decomposition for Large Language Models
- 2026Differentiable Bit-Widths: Co-optimizing Pruning and Quantization via SVD for Ultra-Efficient LLM Compression
- 2025Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectives
- 2026IO-SVD: Input-Output Whitened SVD for Adaptive-Rank LLM Compression
- 2026GA-SVD: Generation-aware Singular Value Decomposition for LLM Compression
- 2025Enhancing Delta Compression in LLMs via SVD-based Quantization Error Minimization
- 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models