- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes ASW, a test-time compilation approach for efficient planning with world models. Instead of planning over the entire world model, ASW dynamically compiles a compact, task-specific “small world” for each query, including only the relevant state factors, action effects, and rewards necessary for the current decision. It uses dependency closure to automatically supplement missing but required preconditions, ensuring executability. Planning is performed in this reduced model, and candidate plans are verified in the original full model under a shared transition budget. Theoretical analysis shows that query-specific abstractions can drastically reduce the state space compared to static abstractions, with bounded loss in expected reward. Experiments demonstrate that ASW achieves better success rate–computation trade-offs than static abstractions, query-based masking, and traditional planners.
Critical strengths
I believe this paper is novel within its field. Strengths: The writing is well-organized, the theoretical analysis is sound, and the experimental results support the authors' claims.
Critical weaknesses
In my opinion, while ASW presents an interesting approach, it may have limited impact on the practical advancement of world models. As the authors themselves note, the quality of the dependency graph plays a crucial role, and this remains a common challenge in related domains. I am not fully convinced that simple automatic methods or manually crafted rules can effectively address this issue, or that they can easily scale to a broader range of tasks and environments beyond the evaluation datasets.
Additionally, compared to recent work such as SLAP, it is unclear how the authors are able to outperform such strong baselines without employing reinforcement learning. If this improvement is achieved without any training, it may fundamentally alter the experimental assumptions, which makes the comparison with baselines less meaningful.
Questions for authors
a) How can it be demonstrated that the construction of the dependency graph is generalizable? b) Regarding the constructed small world model, how can its quality be evaluated?
2 comments
Appreciate your response. I prefer to maintain my rating.
Rebuttal response
Thank you for recognizing the novelty, theoretical soundness, and empirical support. Your questions helped us sharpen the practical contribution: ASW improves how an available model and skill library are used for each query, including when the skills are learned through reinforcement learning.
Weakness 1 / Question (a). Dependency generalization and practical impact
Thank you for highlighting this central issue. As specified in Sec. 3.2 and Appendix C.4, the graph contains support-filtered relations among task and action records from training traces. Its role is to recover useful prerequisites; full-model verification checks proposed execution. The learned relations contribute useful planning information. The graph diagnostic gives:
The learned graph improves success by 10.0 points over disabling it, with fewer calls. Shuffling the relations while preserving their types loses this benefit.
The construction also transfers. We exclude the test corridor layout and both composite query templates during bank construction, then evaluate the frozen bank on 50 fresh held-out worlds × ten queries. ASW reaches 64.6% success, versus 64.0% for the static control. Deleting 30% of runtime edges preserves ASW's result across three corruption seeds. These complementary tests show that the dependency structure matters, can transfer to unseen layouts and compositions within the task vocabulary, and need not be complete to remain useful. The learned visual-model and PPO-skill extensions further test the use of learned interfaces.
Weakness 2. SLAP and the role of training
We appreciate this fairness concern. Skill learning supplies useful actions; query-time compilation organizes their search. ASW adds no RL training phase and can operate on exactly the same learned skills as SLAP.
We use SLAP's official shortcut-discovery and PPO pipeline with three training seeds. Within each row below, both searches receive the same skill bank, simulator, 50 fresh continuous starts, and 1,024-call cap:
The base-skill row provides a solved reference; the shortcut row tests how each planner searches an expanded learned action library. With identical RL-trained skills, ASW gains 4.0 points and uses 50.6% fewer model calls. At the predeclared 512-call cap, success is 99.3% versus 4.0%. Appendix E.7, Fig. 4(b), shows the complete tested budget range and individual seeds. The 1,024-call result demonstrates that the call reduction persists when both searches achieve high success.
These within-bank comparisons keep training fixed and test how the available skills are used. This native-domain experiment complements the benchmark-specific adaptations in the submitted Table 1 and directly addresses the concern about different training assumptions.
Question (b). Quality of the constructed small world
Thank you for this useful suggestion. We assess the proposals supplied to verification, the size of the selected working set, and the resulting execution. The coverage and regret measures below are diagnostics within the evaluated candidate pool; downstream task success provides a separate measure of decision quality:
Closure improves proposal executability and best-candidate coverage while lowering candidate-pool regret. The matched closure component selects an average of 11.82 of 558 option records, linking these gains to a compact working set.
Separately, all 10,563 verified ASW prefixes replay without dead ends or public-state trace mismatches. On 50 preselected reference tasks, ASW solves 43/50 using 52.1 model calls, versus static's 42/50 using 63.1. Together, these diagnostics connect the retained structure to proposal quality, consistent checked execution, and task success under a finite budget.
We hope these targeted controls address your concerns about practical applicability, dependency generalization, and comparison fairness, and would appreciate your reconsideration based on the new evidence.