Saved in:
Bibliographic Details
Main Authors: Han, Henry, Liu, Xiyang, Wang, Xiaodong, Han, Fei, Li, Xiaodong
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2602.13595
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909008215932928
author Han, Henry
Liu, Xiyang
Wang, Xiaodong
Han, Fei
Li, Xiaodong
author_facet Han, Henry
Liu, Xiyang
Wang, Xiaodong
Han, Fei
Li, Xiaodong
contents Neural scaling laws provide a predictable recipe for AI advancement: reducing numerical precision should linearly improve computational efficiency and energy profile ($E \propto \mathrm{bits}$). In this paper, we demonstrate that this scaling law breaks in the context of multi-hop reasoning. We reveal a 'quantization trap' where reducing precision from 16-bit to 8/4-bit paradoxically increases net energy consumption while degrading reasoning accuracy. We provide a rigorous theoretical decomposition that attributes this failure to hardware casting overhead, the hidden latency cost of dequantization kernels, which becomes a dominant bottleneck in sequential reasoning chains, as well as to a sequential energy amortization failure. As a result, scaling law breaking is unavoidable in practice. We formalize a Critical Model Scale $N^*$ that predicts when the trap dissolves or deepens as a function of model size, batch size, and hardware configuration, validated across a 120$\times$ range (0.6B--72B) on six GPU architectures. Our findings suggest that the industry's "smaller-is-better" heuristic is mathematically counterproductive for complex reasoning tasks.
format Preprint
id arxiv_https___arxiv_org_abs_2602_13595
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle The Quantization Trap: Breaking Linear Scaling Laws in Multi-Hop Reasoning
Han, Henry
Liu, Xiyang
Wang, Xiaodong
Han, Fei
Li, Xiaodong
Artificial Intelligence
Neural scaling laws provide a predictable recipe for AI advancement: reducing numerical precision should linearly improve computational efficiency and energy profile ($E \propto \mathrm{bits}$). In this paper, we demonstrate that this scaling law breaks in the context of multi-hop reasoning. We reveal a 'quantization trap' where reducing precision from 16-bit to 8/4-bit paradoxically increases net energy consumption while degrading reasoning accuracy. We provide a rigorous theoretical decomposition that attributes this failure to hardware casting overhead, the hidden latency cost of dequantization kernels, which becomes a dominant bottleneck in sequential reasoning chains, as well as to a sequential energy amortization failure. As a result, scaling law breaking is unavoidable in practice. We formalize a Critical Model Scale $N^*$ that predicts when the trap dissolves or deepens as a function of model size, batch size, and hardware configuration, validated across a 120$\times$ range (0.6B--72B) on six GPU architectures. Our findings suggest that the industry's "smaller-is-better" heuristic is mathematically counterproductive for complex reasoning tasks.
title The Quantization Trap: Breaking Linear Scaling Laws in Multi-Hop Reasoning
topic Artificial Intelligence
url https://arxiv.org/abs/2602.13595