- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper organizes global tokens and regional tokens at three spatial scales into a hierarchical sequence and designs a matching autoregressive factorization: global tokens are generated individually, followed by parallel generation of each regional level conditioned on all coarser levels. The default configuration retains all 240 tokens while reducing sequential sampling to 16+3=19 rounds. The tokenizer and generator are jointly trained through a straight-through estimator, with additional decoder-side DINOv2 representation alignment and distribution-alignment post-training of the generator. On ImageNet 256×256, the authors report gFID of 1.21 for the Large model with CFG. They also provide an extension to 512×512, baselines with matched training conditions, measured speed and memory use, token-group interventions, and ablations.
Critical strengths
-
Joint design of representation structure and generation dependencies produces clear, measurable benefits.
Under matched end-to-end training conditions, Table 1 in Section 5.2 reduces the flat baseline's rFID from 4.82 to 2.63 and gFID from 38.06 to 27.10, while increasing throughput from 4.43 to 49.57 images/s. This result holds before auxiliary alignment, showing that the structural contribution does not arise solely from the additional training used in the final system.
-
Efficiency evidence extends beyond sampling-round counts, with competitive quality.
Table 5 in Appendix B measures performance on the same RTX 4090 in FP32 at batch size 16. The Large model achieves 17.68 images/s, uses 6.44 GB of memory, and obtains gFID of 1.21. For comparison, VAR-d30 achieves 18.10 images/s, uses 15.46 GB, and obtains gFID of 1.92.
Together with the 512×512 extension in Table 4, this establishes a meaningful trade-off among quality, speed, and memory, beyond a formal reduction in decoding rounds.
Critical weaknesses
-
The structural benefit under the complete training recipe has not been directly isolated.
Table 1 on page 8 reduces gFID from 38.06 to 27.10 under matched end-to-end training, supporting the joint spatial-pyramid and prediction design. However, Table 3 on page 9 shows that decoder alignment and distribution post-training further reduce gFID from 27.10 to 11.44 and 4.60. The main results additionally use a 150-epoch training configuration, and the 1.21 result in Table 2 comes from the larger Large model.
A flat Vanilla baseline with matched model scale, training budget, both alignment components, and sampling settings is missing. It is therefore unclear how much structural benefit remains under the full recipe, or whether the representations benefit similarly from the auxiliary objectives. Table 1 remains positive evidence, but cannot independently explain the competitiveness of the final main result.
This control affects the size of the explicit spatial hierarchy's contribution within the complete system, rather than the legitimacy of auxiliary training itself.
-
The quality cost of parallel regional prediction has not been sufficiently separated from representation benefits.
Equation (9) generates tokens within a regional level conditionally independently given all coarser levels, and Equation (13) thereby reduces sampling of 240 tokens to 19 sequential rounds. The paper explicitly describes this independence as a modeling choice, and the masks and Algorithm 1 support its implementation.
However, Table 1 changes both representation organization and prediction factorization. The Parallel/Masked/Causal comparisons in Table 3 primarily change how global tokens are generated; they do not directly compare token-wise and parallel regional generation on the same hierarchical representation.
The results therefore support the quality and speed benefits of the joint design, but do not quantify the quality cost of omitting within-level dependencies or how much a better hierarchical representation compensates for that cost. This matters for applicability at different quality requirements and for assessing the central 19-round sampling design.
-
The main generation metrics are closely coupled to the post-training objective, with insufficient independent quality validation.
Appendix F.2 explicitly updates the generator through frozen Inception-v3 features and a Fréchet-distance objective, while the main generation metrics in Appendix I, gFID and IS, also depend on Inception. Directly optimizing a related feature distribution is not itself an error or evidence of data leakage. Nevertheless, these metrics alone make it difficult to assess whether the advantage of 1.21 over nearby methods also appears in semantic correctness, detail realism, and diversity.
Appendix I states that final gFID uses reference statistics provided by JiT, but the relationship between the real-image statistics used for post-training and the final reference, including data splits and preprocessing, could be clearer. Image examples and reconstruction metrics also do not replace independent validation of the generated distribution.
It is therefore necessary to check whether gains before and after post-training persist under evaluation criteria not used in the training objectives, to clarify the practical meaning of the main metric improvement.
Questions for authors
-
Attribution under the complete training recipe:
What is the gap between Vanilla and the spatial-pyramid model after matching model scale, training budget, both alignment components, and sampling settings?
At one representative scale, could you establish whether the structural advantage in Table 1 persists after adding decoder alignment and distribution post-training, or whether the result primarily depends on one representation benefiting more from the auxiliary objectives?
If corresponding checkpoints or ablations already exist, please report them; retraining at every scale is unnecessary.
-
Quality–speed trade-off of the prediction factorization:
On the same hierarchical representation, could you compare token-wise prediction and the current parallel regional prediction in gFID, throughput, and sampling rounds?
You could fix the tokenizer to isolate the generator factorization, or use matched joint-training controls while specifying any differences in settings.
Table 3 already compares generation strategies for global tokens. The question here is the quality cost of parallelizing the regional levels themselves and the benefits and limitations of the 19-round design relative to more complete dependency modeling.
-
Post-training objective and independent evaluation:
Which data split and preprocessing are used for the real-image statistics in post-training, and how do they relate to the final gFID reference statistics from JiT described in Appendix I?
Could you check whether gains from before to after post-training persist in a feature space not used in the training objectives, or in a blinded human-preference evaluation, considering whether realism and diversity improve together?
The priority is validating the incremental effect of post-training, rather than extending the evaluation to a new task.
-
Comparison with PAR, FAR, and BAR:
Beyond the existing results for VAR, xAR, RAR, and other methods, could you add experimental comparisons and methodological discussion of PAR (Wang et al., 2025), FAR (H. Yu et al., 2025), and BAR (Tang et al., 2026)? Would like to see additional ImageNet comparisons with all four methods in gFID, parameter count, token count, sampling rounds, and measured generation-plus-decoding latency or throughput. Even if time constraints prevent additional experiments, I would still appreciate a detailed comparative discussion of the methods above.