- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes the pixel spatial diffusion framework PixSGR, which aims to balance global structure modeling, detail recovery, and computational cost. The model first learns a compact representation through a low-channel bottleneck with auxiliary supervision, then expands the channels, and utilizes the attention map from the previous coarse-scale stage to select sparse global interaction objects for the fine-scale stage.
Critical strengths
-
By using coarse-scale attention to guide fine-scale computation, cross-patch interactions can be introduced while controlling computational load, providing a reasonable solution for detail recovery in pixel diffusion.
-
Results at two resolutions support the effectiveness of the framework and also demonstrate that the method has a certain resolution scaling capability.
-
The ablation experiments are comprehensive. The authors analyzed bottleneck supervision, attention forms, top-k budgets, mapping strategies, and training objectives.
Critical weaknesses
-
The paper cites SiD2 but does not include it in the results table. Publicly available results for SiD2 achieve FID values of 1.38 and 1.48 on ImageNet 256×256 and 512×512, respectively, which are lower than the results presented in this paper.
-
In Table 2(e), with the improved architecture fixed and IG disabled, changing the training objective reduced FID from 68.4 to 33.9, indicating that the training formulation had a significant impact. Currently, there is a lack of JiT controls using the same pseudo-Huber, LPIPS, REPA, and sampling settings, making it difficult to fully determine how much of the final advantage comes from the new architecture.
-
The paper primarily reports GFLOPs, parameter count, and training epochs, without providing end-to-end latency, throughput, GPU memory usage, or training time. The complete architecture in Table 2(e) has 51.44 GFLOPs, slightly higher than JiT's 50.51 GFLOPs, directly supporting quality improvements at similar computing power. The overhead of dynamic selection, indexing, and data transfer needs to be confirmed through actual measurements.
Questions for authors
-
Compared to QuadTree Attention and BiFormer, what are the key technical differences in reusing coarse-scale attention across layers? Could you add a comparison with an existing dynamic routing method using the same backbone and budget?
-
Given the same hardware, precision, batch size, and number of sampling steps, what are the actual latency, throughput, and peak VRAM usage? Do the timing measurements include top-k operations, index generation, data movement, and IG (index-guided) processes?