DipSVD: Dual-importance Protected SVD for Efficient LLM Compression

Xuan Ding, Rui Sun, Yunjian Zhang, Xiu Yan, Yueqi Zhou +4 more
6/25/2025
cs.LGcs.AI

No official code found. Best implementation: 920927/DipSVD (3 stars, Apache-2.0, last commit 2026-01-24).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

920927/DipSVDCommunity60%
Apache-2.0

DipSVD: Dual-importance Protected SVD for Efficient LLM Compression

30C, C++Oct 18, 20259 months agoApache-2.0

Similar Papers

Cite this paper

@article{ding2025dipsvd,
  title  = {DipSVD: Dual-importance Protected SVD for Efficient LLM Compression},
  author = {Xuan Ding and Rui Sun and Yunjian Zhang and Xiu Yan and Yueqi Zhou and Kaihao Huang and Suzhong Fu and Chuanlong Xie and Yao Zhu},
  year   = {2025},
  eprint = {2506.20353},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.20353v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.20353.svg)](https://codeofpaper.com/paper/2506.20353)

Discussion