arXiv:2601.07892cs.LGcs.AI2026-01ACL被引 5

让大模型在边缘设备上高效运行,1.25比特量化还能提速25%

Sherry: Hardware-Efficient 1.25-Bit Ternary Quantization via Fine-grained Sparsification

  • 四权重量化为五比特,实现1.25比特规则对齐,减少硬件浪费
  • 在LLaMA-3.2上零精度损失,10亿参数模型节省25%比特,速度提升10%
  • 新设计的训练机制防止权重坍缩,适合部署在普通CPU上的轻量级模型

将大语言模型部署到资源受限的边缘设备面临内存和计算需求过高的挑战。虽然三值量化将权重压缩至{-1, 0, +1}具有吸引力,但现有方法与主流硬件存在根本性不匹配:要么采用2比特对齐打包导致比特浪费,要么使用1.67比特非规则打包降低推理速度。为此,我们提出Sherry,一种硬件高效的三值量化框架。Sherry引入3:4细粒度稀疏结构,将四个权重打包进五个比特,实现规则化的1.25比特宽度,恢复2的幂次对齐。此外,我们发现稀疏三值训练中存在权重捕获问题,导致表征坍缩。为此,Sherry提出Arenas——一种渐进式残差突触机制,在训练中保持表征多样性。在五个基准测试上对LLaMA-3.2的实证评估表明,Sherry达到当前最佳三值性能,同时显著减小模型尺寸。特别地,在Intel i7-14700HX CPU上,我们的1B模型相比最先进基线实现零精度损失,比特节省25%,速度提升10%。代码已开源于https://github.com/Tencent/AngelSlim。

原文摘要 · Abstract (English)

The deployment of Large Language Models (LLMs) on resource-constrained edge devices is increasingly hindered by prohibitive memory and computational requirements. While ternary quantization offers a compelling solution by reducing weights to {-1, 0, +1}, current implementations suffer from a fundamental misalignment with commodity hardware. Most existing methods must choose between 2-bit aligned packing, which incurs significant bit wastage, or 1.67-bit irregular packing, which degrades inference speed. To resolve this tension, we propose Sherry, a hardware-efficient ternary quantization framework. Sherry introduces a 3:4 fine-grained sparsity that achieves a regularized 1.25-bit width by packing blocks of four weights into five bits, restoring power-of-two alignment. Furthermore, we identify weight trapping issue in sparse ternary training, which leads to representational collapse. To address this, Sherry introduces Arenas, an annealing residual synapse mechanism that maintains representational diversity during training. Empirical evaluations on LLaMA-3.2 across five benchmarks demonstrate that Sherry matches state-of-the-art ternary performance while significantly reducing model size. Notably, on an Intel i7-14700HX CPU, our 1B model achieves zero accuracy loss compared to SOTA baselines while providing 25% bit savings and 10% speed up. The code is available at https://github.com/Tencent/AngelSlim .

量化大模型部署边缘计算

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