跳到正文
arXiv cs.AI· Jinho Park, Se Young Chun, Mingoo Seok·· 11 小时前AI 评分29

DictLLM:用字典核实现大语言模型训练后压缩

DictLLM: Post-training Compression of Large Language Model with Dictionary Kernels

AI 导读

DictLLM 是一种基于字典的训练后压缩方案,将分组层内的权重矩阵分解为共享字典与层特定稀疏系数,无需额外训练即可从预训练模型直接获得。在 LLaMA-7B 上,DictLLM 实现 5.1x 压缩,WikiText-2 困惑度仅上升 2.9 点,压缩率比当前最优低秩方法高 3.6x。该方法在语言建模与零样本推理基准上持续优于现有训练后低秩压缩方法,并推进了模型大小与性能之间的帕累托前沿。

正文 · 原文

View PDF HTML (experimental)

Abstract:Efficient deployment of large language models (LLMs) on mobile devices requires balancing performance with compute and memory constraints. Post-training compression is an effective approach to managing this trade-off, while requiring much less computation than in-training counterparts. We propose DictLLM, a dictionary-based compression scheme in which weight matrices within grouped layers are decomposed into a shared dictionary and layer-specific sparse coefficients, directly obtained from a pre-trained model without further training. Specifically, we cast DictLLM as a four-step post-training optimization. First, we obtain shared dictionaries via singular value decomposition (SVD) of input-scaled weight matrices, amortizing rank across grouped layers; second, we sparsify the layer-specific coefficients to the target compression ratio using a dictionary-aware Hessian; and third, we refine the dictionaries given the resulting sparse coefficients. Finally, we aggressively quantize both components using factor-specific Hessian information: input covariance for the dictionaries and the dictionary-aware Hessian for the coefficients. The resulting representation reduces memory footprint by storing a single shared dictionary per layer group, along with sparse layer-specific coefficients. On language modeling and zero-shot reasoning benchmarks, DictLLM consistently outperforms existing post-training low-rank compression methods and pushes the Pareto frontier between model size and performance. DictLLM compresses the original LLaMA-7B model by 5.1x with only a 2.9-point increase in WikiText-2 perplexity, achieving a 3.6x higher compression ratio than the state-of-the-art low-rank method.
Comments: NeurIPS 2026. Project page: this https URL
Subjects: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
Cite as: arXiv:2611.08082 [cs.AI]
  (or arXiv:2611.08082v1 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2611.08082

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Jinho Park [view email]
[v1] Thu, 5 Nov 2026 14:31:12 UTC (537 KB)

来源:arXiv cs.AI · arxiv.org