- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work aims to improve CompDiffuser by addressing inconsistencies between generated trajectory chunks that can prevent them from being successfully merged in overlapping regions. To this end, the authors propose Selective Compositional Diffuser (SCD), which first uses CompDiffuser to generate multiple candidate plans. They then use a classifier to estimate reachability between candidate chunk boundaries and construct a graph based on these scores. Dijkstra’s algorithm selects a minimum-cost sequence of chunk segments, which are connected using diffusion-generated bridging trajectories. Finally, the assembled trajectory is refined. The experimental results demonstrate improvements over the original CompDiffuser.
Critical strengths
-
The overall idea of selecting and refining trajectories generated by CompDiffuser is interesting.
-
The experimental results demonstrate that the proposed method improves upon the original CompDiffuser.
Critical weaknesses
-
The overall novelty of the method appears limited, as its main contributions involve selecting and connecting trajectory segments generated by CompDiffuser. It remains unclear how much of the performance gain could be achieved by simply selecting the best complete trajectory from the same pool of CompDiffuser-generated candidates, without segment recombination or bridging.
-
Although the idea behind SCD is interesting, the motivation for its design requires further clarification. CompDiffuser has a straightforward rationale: decomposing long-horizon trajectory generation into overlapping chunks. For SCD, however, it is unclear why the newly generated bridges should be more reliable than the original overlapping regions. Could bridge generation introduce new infeasible transitions and compromise the connectivity of the selected segments? Additionally, could reducing CompDiffuser’s chunk horizon achieve similar improvements?
Questions for authors
Q1. Could the authors compare SCD with additional state-of-the-art diffusion-based planners, particularly hierarchical diffusion planners?
Q2. Could the authors also compare SCD with CompDiffuser using shorter chunk horizons to determine whether reducing the chunk horizon yields similar improvements?
2 comments
Dear Reviewer vZ7o,
We appreciate the time you spent on our paper. Below we list the parts of our response that relate to your comments:
- W1: We compared SCD with selecting the best single trajectory from the same candidate pool. Oracle selector also stays below SCD.
- W2: We compared bridges with averaging the overlaps, and bridges showed better results.
- Q1 (O2): We added comparisons with graph-guided and recent diffusion planners, including a hierarchical one, and SCD achieves the highest average success rate.
- Q2: We added CompDiffuser retrained with shorter chunks, which performs worse than the original.
Please let us know if there is any questions. We would be happy to discuss any remaining concerns before the discussion period ends.
We thank the reviewer for their detailed and thoughtful feedback. We hope our responses below address the reviewer’s concerns.
W1. Gain over selecting the best complete trajectory
Following the reviewer's question, we compare SCD with two ways of selecting a single complete trajectory from the same pool of 40 CompDiffuser candidates on AntMaze-Giant: selection with the same classifier cost as SCD (the sum of −logDϕ along the trajectory), and an oracle upper bound, which executes all plans and selects the best performance.
Classifier-based selection improves over CompDiffuser’s own selection (65 ± 3 → 83 ± 2) but remains below SCD (85 ± 2). We also evaluate without replanning to observe the maximum score CompDiffuser could independently achieve with an optimal selector. There, even the oracle reaches only 31% success and yields 44% feasibility, whereas SCD reaches 39% and 88%. Selection is thus bounded by the best trajectory in the pool, whereas recombining segments across candidates can also produce feasible plans that no single candidate contains.
We also note that CompDiffuser reports 27 ± 4 without replanning. Since the evaluation details for this setting are not specified in the released configuration, we evaluate all methods in the same environment and with the same executor, so the relative comparison is unaffected.
Table. Success rates on PointMaze-Giant
Table. Success rates on AntMaze-Giant
*Oracle selector is not reported with replanning, since it is challenging to track all outcomes that depend on all subsequent replanned choices.
We reflected this comparison in the revised manuscript, Appendix C.3 (Table 14).
W2. Using bridges rather than overlap averaging
To compare the two, we kept the selected segments and trajectory refinement fixed and changed only the connection method. Bridges yield more feasible connections (98.0% vs. 87.8% before refinement on AntMaze-Giant), while this gap can be absorbed by the refinement (98.5% vs. 97.7% on AntMaze-Giant). Nonetheless, bridges still achieve a higher success rate (85% vs. 81% on AntMaze-Giant, 83% vs. 81% on HumanoidMaze-Giant). We reflected this comparison in the revised manuscript, Table 7 and Appendix C.2 (Table 13).
Q1. Comparison with hierarchical diffusion planners
In the official comment, O2, we compare SCD with graph-guided baselines (XDiffuser [2], C-MCTD [3], GAS [4]) and hierarchical diffusion planners (DSP[5] and HD[6]). SCD achieves the highest average success rate across the nine tasks (92.22), maintaining a success rate above 80 on all nine tasks. Please refer to this official comment, O2, for further details.
Q2. CompDiffuser with shorter chunk horizons
Following the reviewer’s suggestion, we retrained CompDiffuser on AntMaze-Giant with halved chunk length. The result supports that reducing chunk length does not improve performance on generating long-horizon trajectories.
Table. Success rates over chunk horizons
[1] CompDiffuser, NeurIPS 2025
[2] XDiffuser, Hassidof et al., 2026 (arXiv:2605.16863)
[3] C-MCTD, Yoon et al., NeurIPS 2025
[4] GAS, Baek et al., ICML 2025
[5] DSP, Zhant et al., 2026 (arXiv:2609.34575)
[6] HD, Chen et al., ICLR 2024