通过数学优化提升大模型微调参数压缩效果
Enhancing Delta Compression in LLMs via SVD-based Quantization Error Minimization
- 将量化设计建模为可求解的数学优化问题
- 7B模型在AIME2024上比现有方法高22.3%
- 适合关注模型压缩与高效部署的研究者
监督微调(SFT)使大语言模型在特定任务上表现优异,但生成密集且高维的增量参数,带来严重的存储与分发挑战。基于奇异值分解(SVD)的压缩可提供紧凑表示,但现有方法采用启发式量化,缺乏理论依据,泛化能力差。本文提出PrinMix,一个基于SVD的严格框架,将量化建模为优化问题,从理论上推导量化误差并揭示关键的奇异值主导缩放机制,证明混合精度量化的必要性。进一步将量化方案建模为0/1整数线性规划(ILP)问题,获得受比特预算约束的最优解,无需经验假设。同时引入重建目标修正(RTC)方法,补偿V-then-U顺序量化带来的误差。大量实验表明,对于7B模型,PrinMix在挑战性基准上优于当前最优方法:AIME2024提升22.3%,GQA提升6.1%。
原文摘要 · Abstract (English)
Supervised Fine-Tuning (SFT) empowers Large Language Models (LLMs) with exceptional performance on specialized tasks, but it yields dense, high-dimensional delta parameters that pose severe storage and distribution challenges. Singular Value Decomposition (SVD)-based compression offers a compact representation for such delta parameters, but existing methods adopt heuristic quantization without clarifying underlying mechanisms, leading to poor generalizability. In this work, we propose PrinMix, a rigorous SVD-based framework that models quantization as an optimization problem, grounding the design in mathematical mechanisms. We first theoretically derive quantization error and identify a key singular-value-dominated scaling mechanism, which mathematically proves the necessity of mix-precision quantization. We then model the quantization scheme as a 0/1 Integer Linear Programming (ILP) problem, which yields optimal bit-budget-constrained solutions without empirical assumptions. Furthermore, PrinMix integrates a Reconstruction Target Correction (RTC) method to compensate for errors from the $\mathbf{V}$-then-$\mathbf{U}$ sequential quantization process. Extensive experiments confirm PrinMix performs well: for 7B LLMs, PrinMix outperforms SOTA Delta-CoMe on challenging benchmarks by 22.3% on AIME2024 and 6.1% on GQA.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。