返回全部动态
GPTQ-2D:立方时间双边自适应舍入算法
原标题:GPTQ-2D: Cubic-Time Two-Sided Adaptive Rounding
AI 摘要
本文提出GPTQ-2D算法,用于在二次度量下将实数矩阵舍入为整数,处理左右两侧均有基矩阵的双边自适应舍入问题。该算法以立方时间产生与四时间方法相同的舍入矩阵,通过反对角线顺序并行舍入独立条目。
以上摘要由 AI 生成,可能存在误差。事实请以原文为准。
正文节选
GPTQ-2D: Cubic-Time Two-Sided Adaptive Rounding Abstract Adaptive rounding methods such as GPTQ, or equivalently Babai's nearest plane algorithm, round a real matrix to integers under a quadratic metric. They process the entries in a fixed order, one at a time, propagating each rounding error to the entries not yet processed through a triangular feedback matrix. We study the two-sided version of this task, in which fixed nonsingular basis matrices act on both the left and the right of the residu
发布时间:—
抓取时间:2026-08-04 17:28
来源机构:Hugging Face