When Can Depth Replace Precision? A Resource Theory of Quantized Neural Computation
arXiv:2607.23390
2026
Architecture
2 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
This paper provides a resource-theoretic way to reason about low-bit residual networks: extra depth can reduce synthesis error only down to the distance from the target map to the closed relaxed reachable set of the declared operation library. The most directly transferable mechanism is increment error feedback, which prevents quantization errors from accumulating linearly across residual steps and instead yields a telescoping carry term. Its explicit decomposition of structural, scheduling, metadata, and execution-arithmetic errors also suggests a practical pre-training feasibility screen that can avoid training architectures incapable of meeting a target accuracy. The strongest initial experiments should compare ordinary quantized residual write-back against lattice-compatible error-feedback residual blocks, and use the paper's bounds to select depth before optimization.
Ideas from this paper
✓✓ Beats tuned baseline
2026
Replace full-state quantized write-back in a deep low-bit residual stack with quantized increment error feedback. The residual branch quantizes the proposed increment after adding the previous carry, while the carry stores the exact discrepancy; this makes the total error telescope instead of accumulating approximately once per layer.
Useful8/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Use computable upper and lower error bounds to reject quantized-depth configurations that cannot reach the desired accuracy before training. The planner separates irreducible library mismatch from finite-depth synthesis, codebook metadata, and execution errors, then selects the smallest depth and metadata budget whose estimated bound passes the target.
Useful7/10
Difficulty5/10
Novelty7/10