- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
FastKron proposes an efficient implementation of two-sided GPTQ-style adaptive rounding with Kronecker-factored curvature. By combining anti-diagonal parallelism with recursive divide-and-conquer, it reduces computational complexity from quartic to cubic while preserving the original rounding results. The paper also introduces a memory-efficient procedure for computing Kronecker-factored Hessian approximations.
Critical strengths
- FastKron reduces the rounding work from quartic to cubic complexity for square matrices, while proving that its recursive and anti-diagonal variants produce the same output as the underlying two-sided procedure.
- The benchmarks show that FastKron avoids the rapidly increasing cost of the earlier anti-diagonal implementation and remains within a constant factor of GPTQ’s core rounding time. The paper also presents a recursive Hessian-computation flow intended to reduce fast-memory requirements.
Critical weaknesses
- FastKron acknowledges GPTQ-2D (CoRR 2026), which also achieves cubic-time two-sided adaptive rounding, and explains that it uses a different algorithmic technique. However, the paper does not compare the two implementations directly. As a result, the relative runtime, memory use, and practical benefits of FastKron’s recursive construction over GPTQ-2D remain unclear. This limits how confidently I can assess the distinct practical value of the proposed algorithm.
- The proposed recursive Hessian-computation flow is not evaluated on an actual model. The paper analyzes its compute and memory complexity, but does not report measured peak memory or end-to-end quantization time for this flow. Those measurements would help establish whether the flow’s theoretical memory trade-off is useful in practice.
Questions for authors
- Can the authors clarify the practical and theoretical trade-offs between FastKron and GPTQ-2D (CoRR 2026)? How do they compare in terms of runtime constants, memory requirements, parallel depth, and implementation complexity?
- For the recursive Hessian-computation flow, can the authors provide measured peak memory and end-to-end quantization time on representative models, or clarify which parts of the reported memory and compute analysis are theoretical estimates rather than measured results?
3 comments
I appreciate the authors' response and the discussion in Appendix F.
While the appendix clarifies the algorithmic differences between FastKron and GPTQ-2D, my main concern about their substantial overlap remains. Both methods achieve the same asymptotic complexity, and the authors acknowledge that GPTQ-2D may have a lower constant factor. Without direct runtime and memory comparisons, the distinct practical advantages of FastKron remain unclear.
Furthermore, the new Hessian-computation results are still based on analytical estimates rather than actual measurements.
Overall, my concerns are not fully resolved. While I am not inclined to champion this paper, I will maintain my original borderline score.
We do not claim that there is a distinct practical advantage over GPTQ-2D, and similarly there is no distinct practical advantage of GPTQ-2D over FastKron. Both achieve the same runtime in theory and practice, developed independently. Also note that we have developed FastKron (and documented it on OpenReview) before GPTQ-2D was made available as a preprint.
In fact, one can see the existence of the independent research effort GPTQ-2D as further evidence of the importance of the problem. Presumably the authors of GPTQ-2D were running into the same computational bottlenecks as we did.
The recursive halving flow is another important ingredient for two-sided GPTQ and is only provided in this paper. While it is true that the numbers in the new table are technically estimates, we want to note that we have verified the model with actual implementations, in particular we ran the recursive halving flow on the mentioned language models and the estimated numbers accurately predict the measured quantization time. We can also provide measurements for the camera ready version.
Rebuttal
We thank the reviewer for their feedback. We will address all mentioned weaknesses and questions below.
W1/Q1: Please clarify trade-offs between FastKron and GPTQ-2D.
We have added a new appendix F that compares the two algorithms.
W2/Q2: Please provide end-to-end quantization time and memory.
We have added a new Table 4 at the end of the paper, which provides a realistic model (or at least lower bound, assuming an optimized implementation) of the time and memory requirements of the various flows. (While Table 3 is useful for understanding the theoretical complexity under simplified assumptions, Table 4 is a more realistic version of the same table.) In particular, for Table 4 we plug in values of two actual language models (Llama-3-8B and Qwen3-32B), which shows their time and memory requirements for the flow.
This only compares the flows and therefore demonstrates the advantage of the recursive halving flow. It does not contain the time required for rounding (running one of the FastKron-* algorithms). The rounding time can be extrapolated from the benchmarks. (In the most simple way, plug in an appropriate value for n and multiply the benchmark time by the number of linear modules.)
For example, FastKron-antidiagonal on 16x16 tiles (used by YAQA) needs 30 minutes on Llama-3-8B and 5 hours on Qwen3-32B, whereas our new FastKron algorithm only needs 30 seconds and 3 minutes, respectively.
We hope that this addresses the reviewer's questions/critique to their satisfaction, so that they can hopefully upgrade their rating to recommend clear acceptance of the paper.