arXiv:2605.15626cs.LG2026-05

提出IO-SVD压缩方法,实现低秩模型高效部署。

IO-SVD: Input-Output Whitened SVD for Adaptive-Rank LLM Compression

论文配图:IO-SVD: Input-Output Whitened SVD for Adaptive-Rank LLM Compression
图 1 · 摘自论文原文
  • 构建输入输出双侧白化空间,融合激活统计与预测敏感度
  • 在50%参数压缩下,多数任务性能下降<1.5%
  • 适合需要高效推理的边缘设备部署场景

大型语言模型在语言和推理任务中表现优异,但其存储与计算成本仍是资源受限和延迟敏感场景部署的主要障碍。基于SVD的训练后压缩通过低秩分解提供硬件无关的模型压缩方案。然而,现有方法常依赖仅输入侧白化、均一秩分配或无损启发式策略,限制了在激进压缩下的模型质量保持能力。本文提出输入-输出白化SVD(IO-SVD),构建一个基于KL散度感知的双侧白化空间。通过在前K个词元概率上对KL损失进行二阶展开,构建捕捉预测敏感度的输出端度量,同时输入白化保留激活统计特性。进一步提出一种高效的异构秩分配策略,利用一阶校准损失估计评分,并在全局预算下剪除最不敏感的奇异分量。受先前将SVD截断与量化结合工作的启发,通过损失感知重映射改进混合SVD-量化压缩,基于量化带来的预测损失变化,选择适合8比特量化的低秩因子行。在多种大模型和视觉语言模型家族上的广泛实验及推理时分析表明,IO-SVD在极小性能损失下实现实用的推理加速。代码已开源:https://github.com/mint-vu/IO-SVD.git

原文摘要 · Abstract (English)

Large language models deliver strong performance across language and reasoning tasks, but their storage and compute costs remain major barriers to deployment in resource-constrained and latency-sensitive settings. SVD-based post-training compression offers a hardware-agnostic way to reduce model size and improve inference efficiency through low-rank factorization. However, existing methods often rely on input-only whitening spaces, homogeneous rank allocation, or loss-agnostic allocation heuristics, limiting their ability to preserve model quality under aggressive compression. We propose Input-Output Whitened SVD (IO-SVD), a post-training compression method that forms a KL-aware double-sided whitening space for model weights. Using a second-order expansion of the KL loss over the top-K token probabilities, IO-SVD constructs an output-side metric that captures predictive sensitivity, while input whitening captures activation statistics. We further introduce an efficient heterogeneous rank-allocation strategy that scores whitened singular components using first-order calibration loss estimates and prunes the least sensitive components under a global budget. Inspired by prior work that combines SVD truncation with quantization, we improve hybrid SVD-quantization compression through loss-aware remapping, which selects low-rank factor rows for 8-bit quantization based on the predicted loss change incurred by quantizing them. Extensive experiments across diverse LLM and VLM families, and inference-time analysis shows that IO-SVD compresses LLMs with minimal performance degradation while delivering practical inference speedups. Code is available at https://github.com/mint-vu/IO-SVD.git

模型压缩SVD低秩推理加速

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。