- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes an extension to the action-candidate scoring in the CEM planning procedure of LeWM. An additional action-free next-state predictor is trained and used at test time to complete the predicted state sequence towards the goal beyond the reach of the fixed horizon action-conditioned prediction. This approach that builds on LeWM, named HAS, is compared to the standard LeWM on 2D visual tasks and outperforms it when the goal is not within the reach of the fixed-horizon action-conditioned planning horizon.
Critical strengths
None
Critical weaknesses
This paper does not pass the bar for an ICLR submission in my opinion.
The main reasons for my evaluation are detailed in the following:
Use of Privileged Information for Planning
The proposed candidate scoring method leverages the (already questionable) evaluation protocol which samples trajectory segments from the training data and selects initial-state and goal images within a known fixed temporal timestep distance. This known timestep distance is privileged information that is not available in standard goal-conditioned planning settings but the method relies on. Overall, the evaluation does not test the most basic form of generalization to in-distribution test trajectories and the validity of the state-only predictor relies strongly on this protocol.
Limited Scope of the Study
This paper proposes a modification to LeWM action candidate scoring mechanism. As stated above, it relies on privileged information and a very specific evaluation protocol. The method is only compared to LeWM on the full task suite. The environments are all 2D. In my opinion, the scope of this paper does not pass the bar for an ICLR contribution.
Lack of References to Prior Related Work
This paper lacks proper positioning and references to related work. The number of references (13) is exceptionally low and most focus on very recent papers from a small subset of authors.
Questions for authors
None
2 comments
I appreciate your effort in addressing my concerns.
In my review I tried to make my opinion clear that the paper needs significantly more work to meet the bar for an ICLR submission.
It seems that you have made many changes and additions. As I see it, these are more than is acceptable in the scope of revisions during a rebuttal period. For me to assess them, I would have to essentially review the paper all over again.
I will thus maintain my rating.
Response to Reviewer tGM9
Thank you for the detailed assessment. Your concerns prompted us to separate HAS from its original timing rule, broaden the comparisons, and clarify its relationship to established planning methods. We have uploaded a revised manuscript and updated the abstract. All references below point to this revision.
1. Temporal information and evaluation protocol (W1).
Your concern led us to revisit our existing depth experiments. On PushT at the 75-step reference interval, the tested fixed positive depths achieve at most 4.0%, versus 40.4% for the decreasing schedule. On TwoRoom, fixed k=5 exceeds k=10 by 37.6 percentage points at the same interval. These results suggest that useful continuation depends on the task and planning stage, rather than simply extending predictions farther. Appendix G.2, Table 7, reports these experiments.
We consequently introduced HAS (adaptive), which advances candidates together and selects a shared depth from improvements in their minimum goal distance. Candidates are scored at the best visited depth, including k=0. The rule does not read the reference offset, elapsed time, or interaction budget, and uses the same stopping parameters across tasks. Section 4.3 describes the rule, and Appendix D provides pseudocode.
Adaptive HAS improves mean success over LeWM in 11 of 12 longer-offset conditions. For goals sampled 100 steps ahead along reference trajectories, it achieves 90.0% on TwoRoom, versus 20.8% for LeWM, 59.2% for TRM-Hybrid, and 11.2% for the best transferred value score. Section 5.3 analyzes depth selection, Figures 3-4 show performance and planning behavior, and Table 4 gives full results.
Section 4.2 clarifies that F learns local five- and ten-step predictions, rather than directly fitting the evaluated 25-100-step start-goal relations. The experiments retain LeWM's trajectory-based protocol and do not establish generalization to trajectories excluded from world-model training.
2. Breadth of baselines and tasks (W2).
Your concern motivated expanding both the comparison methods and task coverage. Beyond LeWM's latent-distance score, we added goal-conditioned value functions adapted from GCIVL, QRL, and CRL-V, and extended TRM to all four tasks. TRM is evaluated both as a replacement score and combined with latent distance. Together with LeWM and the two HAS depth rules, these form eight scoring variants under the same frozen world model and CEM settings.
These comparisons test two approaches to terminal evaluation: directly learning a goal-related score, or predicting continuation before applying latent goal distance. Section 5.1 motivates the baseline selection, and Appendix C specifies the terminal-score adaptations. We evaluate these methods as scoring components within the shared planner, rather than as reproductions of their original full systems.
On PushT with goals sampled 50 steps ahead along reference trajectories, HAS with the known offset achieves 68.0%, versus 36.8% for TRM-Hybrid and 24.8% for the best transferred value score. Adaptive HAS achieves the highest mean at every TwoRoom and Cube interval, while GCIVL and QRL perform strongly on Reacher. Section 5.2 and Figure 3 discuss these comparisons, and Table 4 gives full results. The longer-action-horizon controls additionally compare HAS with expanding action search itself (Section 5.4, Table 6).
To broaden task coverage, we added 3D single-object Cube manipulation. At the 100-step reference interval, adaptive HAS achieves 64.0%, compared with 60.8% for LeWM, 52.4% for TRM-Hybrid, and 48.8% for QRL. Appendix B specifies the OGBench environment and LeWM trajectory-goal protocol, which differs from official OGBench task-goal evaluation. Section 6 identifies multi-object scenes, independently specified goals, and other world-model backbones as remaining directions.
3. Related-work positioning (W3).
Your feedback prompted us to organize the related work around the design question rather than nearby world models alone. Section 2 now connects terminal values in POLO and TD-MPC, predictive representations, goal-conditioned value functions in UVFA and TDMs, and learned world-model scores to HAS. The bibliography has expanded from 13 to 32 references.
This discussion develops the distinction underlying HAS: learning local continuation on predicted endpoints, then composing that predictor before applying latent goal distance. Sections 4.1-4.2 explain the construction and training objective, and Section 5.1 connects this distinction to the selection of temporal and value-function baselines.