arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.20191cs.LGcs.AIcs.CL

MoBiQuant: 面向令牌自适应任意精度LLM的混合比特量化

MoBiQuant: Mixture-of-Bits Quantization for Token-Adaptive Any-Precision LLM

University of Arizona(亚利桑那大学);Duke University(杜克大学);Sungkyunkwan University(成均馆大学);Panasonic AI Lab(松下人工智能实验室);Korea Advanced Institute of Science and Technology(韩国科学技术院)

Dongwei Wang, Jinhee Kim, Seokho Han, Denis Gudovskiy, Yohei Nakata, Tomoyuki Okuno, KhayTze Peong, Kang Eun Jeon, Jong Hwan Ko, Yiran Chen, Huanrui Yang

AI总结:

针对动态运行时约束下大语言模型任意精度量化的泛化性问题,提出基于令牌敏感度的混合比特量化框架MoBiQuant,通过多合一递归残差量化和令牌感知路由器实现灵活推理,在匹配或超越前沿单精度PTQ的同时显著节省内存并提升吞吐量。

摘要:

动态运行时延迟和内存约束要求灵活部署大语言模型(LLM),使得LLM能够根据可用计算资源以不同的量化精度进行推理。最近关于这种任意精度量化的工作要么依赖于硬件效率低下的向量量化,要么在切换位宽时引入额外的缩放因子。同时,现有的为固定低精度校准的后训练量化(PTQ)方法在运行时精度变化下表现出较差的泛化性。在这项工作中,我们将跨位宽泛化性差的根源归因于一种精度依赖的“异常迁移”现象,其中PTQ敏感令牌的分布随精度变化。受此观察启发,我们提出了 exttt{MoBiQuant},一种新颖的任意精度混合比特量化框架,它根据令牌敏感性调整权重精度以实现灵活的LLM推理。具体来说,我们提出了一种多合一递归残差量化方法,可以在运行时迭代重建更高精度的权重,并通过令牌感知路由器缓解“异常迁移”,动态选择每个令牌的最优推理精度。大量实验表明, exttt{MoBiQuant}在匹配或超越前沿单精度PTQ的同时表现出强大的弹性,与最先进的任意精度方法相比,实现了显著的内存节省和高达$1.34 imes$的吞吐量提升。

英文摘要:

Dynamic runtime latency and memory constraints necessitate flexible large language model (LLM) deployment, where an LLM can be inferred with various quantization precisions based on available computational resources. Recent work on such any-precision quantization either relies on hardware-inefficient vector quantization or induces additional scaling factors when switching between bit-widths. Meanwhile, existing post-training quantization (PTQ) methods calibrated for a fixed low precision show poor generalizability under runtime precision change. In this work, we attribute the source of poor generalization across bit-widths to a precision-dependent \textit{outlier migration} phenomenon where the distribution of PTQ-sensitive tokens changes across precisions. Motivated by this observation, we propose \texttt{MoBiQuant}, a novel any-precision Mixture-of-Bits quantization framework that adjusts weight precision for flexible LLM inference based on token sensitivity. Specifically, we propose a many-in-one recursive residual quantization that can iteratively reconstruct higher-precision weights at runtime and mitigates \textit{outlier migration} with a token-aware router to dynamically select the optimal inference precision of each token.Extensive experiments show that \texttt{MoBiQuant} matches or surpasses frontier single-precision PTQ while exhibiting strong elasticity, achieving significant memory savings and throughput gains of up to $1.34\times$ over state-of-the-art any-precision methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑