RESEARCHMonitorNEXT 12 MONTHS
GPTQ-2D: Cubic-Time Two-Sided Adaptive Rounding
arXiv cs.LG — Machine Learning
Factual evidence
What the source reports
GPTQ-2D introduces a two-sided adaptive rounding method for quantizing large language models, improving on prior quadratic metric-based approaches.
Inspect the evidence
- Inclusion basis
- Enterprise AI
- Publisher and source type
- arXiv cs.LG — Machine Learning · RESEARCH
- Published by source
- 6 November 2026
- Collected by OneBench
- 30 Jul 2026, 09:36 UK
- Original headline
- GPTQ-2D: Cubic-Time Two-Sided Adaptive Rounding ↗
Stored source excerpt
arXiv:2607.27042v1 Announce Type: cross Abstract: Adaptive rounding methods such as GPTQ, or equivalently Babai's nearest plane algorithm, round a real matrix to integers under a…
Short excerpt from the collected text, not the full source. Use the source link to read it in context.
The factual summary is a OneBench synthesis, not a quotation or independent verification. Collection time is not publication time. Open the source for its full context; related reporting can share the same underlying announcement.