- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces an algorithm that generate useful subgoals during exploration, aka a search policy, represented by Python programs.
Critical strengths
- The work resonates with code-as-policy (also a critical missing reference) and, in some way, can be thought of as code-as-search-policy, which is an interesting domain to study.
- The replay scoring (4.2) is a neat idea.
- The reporting of results, interpretations, and claims are sound and careful.
Critical weaknesses
- The main concern is the task difficulty, and due to the simplicity of the evaluated tasks, some claims are weakened. The three tasks (Sokoban, Minigrid, BoxDelivery) are too simple so 1) no transfer baseline solves them quickly as well; 2) it is uncertain how the method would generalize to more challenging and interesting domains, such as those in mainstream EAI benchmarks. My understanding is that BoxDelivery is the only domain that fits your assumptions: contact-rich, hence imperfect low-level controls, but there are only two boxes and the instances only differ by their poses.
- Needs ablation studies on critical designs; given the tasks, it shouldn't be too difficult to do so.
Questions for authors
My main concern is about tasks; see above.
Thank you for the rebuttal, i appreciate the effort. The paper would improve with the new evidence, i think this is an interesting direction, but overall the paper remains under the bar for acceptance. Keeping my score