- Rating
- 2
- Confidence
- 2(+1)
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies global semantic failures in compositional diffusion. While existing methods can generate coherent long-horizon outputs by jointly denoising overlapping windows, they often repeat objects or events because every window receives the same condition. The paper proposes Hierarchical Latent Cascades (HLC), a training-free method that first generates a coarse global sample, uses its attention maps to assign parts of the condition to different regions, and then refines the result through a hierarchy of overlapping windows. Experiments cover panorama generation, long-video generation, and long-horizon robotic planning.
Critical strengths
1.The paper identifies an important and underexplored problem. The distinction between global coherence and global semantic correctness is clear and practically relevant: existing compositional methods can produce seamless outputs while still violating object counts, positions, or event order. 2.The proposed method is intuitive and broadly applicable. Using the pretrained model's own attention to route conditions to local windows is elegant and does not require additional training, external detectors, or an explicit language-model planner. 3.The cross-domain perspective is valuable. Applying the same general idea to images, videos, and robotic trajectories suggests that semantic repetition is a broader issue in compositional diffusion rather than a domain-specific artifact.
Critical weaknesses
1.The evaluation is too small to support the paper's broad claims: the panorama experiment uses only 25 prompts with one seed each, and the video evaluation contains only two stories and six events, making results sensitive to prompt selection and sampling variance. 2.Absolute semantic performance remains limited. On panoramas, HLC reaches only 0.24 detector-based and 0.48 VLM-based full-prompt success, well below the external planner. It reduces repetition but does not yet reliably preserve the requested global semantics. 3.The evaluation relies heavily on automatic judges, and the sizeable gap between detector- and VLM-based results suggests the metrics are not fully stable. The small human validation does not replace a direct human evaluation of counting, placement, and overall prompt satisfaction. 4.The benefits come with understated trade-offs: HLC worsens panorama style consistency, yields lower video subject consistency than some baselines, and takes roughly 10 minutes per video versus about 3.5 minutes for reported alternatives. Moreover, in planning, root-only results match or exceed the full cascade, leaving the contribution of hierarchical refinement unclear.
Questions for authors
1.Can the authors provide results over a larger prompt set and multiple random seeds, particularly for long videos, where the current conclusions are based on only two stories? 2.How well do the detector and VLM metrics agree with human judgments on the complete evaluation set? Could the authors include a direct human evaluation of count, position, event order, and overall quality? 3.Why is AccDiffusion not included as a quantitative panorama baseline? It appears closely related in its use of attention for local prompt assignment. 4.In the planning experiments, why does the full hierarchy not improve over the root-only solution? Can the authors isolate when hierarchical refinement is actually necessary and provide a clearer ablation of decomposition versus cascading?
2 comments
Gentle reminder
Dear Reviewer qPYG,
Thank you again for your time and thoughtful feedback. As the discussion period closes on November 18, we would appreciate any feedback on our response above, particularly whether any concerns remain that we could clarify before the deadline.
We would be happy to address any further questions. Thank you for your consideration.
We sincerely thank the reviewer for the kind and thoughtful review. We are glad that the reviewer finds the distinction between global coherence and global semantic correctness important and underexplored, and that using the model’s own attention without extra training, detectors or a planner is seen as elegant. We share this view, and the revision is built around making the evidence for it stronger.
W1 / Q1. Evaluation size.
We agree, and we have scaled up the evaluation substantially (see the general response). Panoramas now use 100 prompts for every method and 50 prompts × 3 seeds for the controlled comparison. Videos use 50 stories at 40 s, beyond what LTX-2.5 generates in one pass, plus a seed check with three seeds. Every difference is reported with a paired bootstrap 95% confidence interval.
W2. Absolute semantic performance.
Part of the low absolute numbers came from the judges of the submission. The OWLv2 detector counts malformed fragments as objects and misses small or unusual ones, which also explains the gap between the detector and the VLM that the reviewer noted. We therefore re-scored everything with a stronger judge, Qwen3.8-27B, and checked all three judges against blind human labels (general response, item 2). With the new judge, HLC succeeds on 45% of the 100 prompts, against 0% for coherence-oriented samplers, and is not significantly different from the external planner (−4 [−15, 6]). The change of judge does not change the ranking of the methods (Table 6 in Appendix D), and we release every image, video and judge output so that the results can be checked directly. We agree that the problem is not solved: more than half of the prompts still fail, and we say so in the conclusion.
W3 / Q2. Agreement with human judgement.
We labelled 102 objects on 57 panoramas by hand without seeing any judge output and without the method names, using a rule fixed in advance: an instance counts only if a person recognises it as the requested object. Against these labels, agreement is 82% for OWLv2, 80% for Qwen2.5-VL-7B and 87% for Qwen3.8-27B (Cohen’s κ 0.60 / 0.57 / 0.70). We did not run a full human study of every output, which we list as a limitation. For videos we do not score event order: many stories list events separated by commas, which does not state an order, and several events may legitimately overlap (Appendix D).
W4. Trade-offs.
We report the standard coherence and quality metrics of the field, but they do not measure the failure we study. I-Style and NIQE reward windows that look alike, so a sampler that repeats one scene in every window scores well. A panorama that follows the prompt must show different objects in different places and cannot match a replicated one on these measures. Even so, HLC stays close to SyncDiffusion on all three measures and has the lowest I-LPIPS (Table 2). On video, with the stronger LTX-2.5 backbone, HLC now has the highest subject consistency (0.932 vs 0.923 for one-pass; Table 3). The trade-offs are real, and we now state them in the limitations: the style is less uniform than in samplers that repeat one scene, and on video HLC is about twice as slow as window-based samplers because the levels of the tree are sampled one after another (Table 3, Appendix G).
Q3. AccDiffusion.
We added it. We ported the AccDiffusion selector into our tree, so that only the allocation rule differs from HLC, and tuned it. Its best variant reaches 26% success against 45% for HLC (+19 [11, 28]; Table 2 and Table 10 in Appendix F).
Q4. Hierarchy in planning, and decomposition vs. cascading.
In planning, the diffusion planner run once as the root turned out to be surprisingly robust beyond its trained horizon, and the cascade does not improve on it at these lengths. We do not claim HLC is the best planner for robot manipulation. Planning is included to show that the same procedure transfers unchanged to a third domain, where it clearly beats start–goal conditioning and broadcasting. Section 4.4 now states this scope. To separate decomposition from cascading, we ran both ablations on panoramas:
Decomposition: with the same root and tree, removing the decomposition (full prompt in every window) drops success from 45% to 0% (Table 2). The semantics come from the decomposition. Cascading: at 1:14.5, a binary tree and a depth-1 flat variant (n children) with the same root and allocation do not differ significantly in success (30% vs 38%, −8 [−24, 10]). The tree scores higher on learned quality measures (CLIP-IQA and MANIQA), while the flat variant is more uniform in style (Table 9 in Appendix E.2). The hierarchy is therefore needed for fidelity when the output is refined far beyond the root’s resolution, not for semantics.
Thank you again for the encouraging review. We would be glad to answer any further question.