- Rating
- 2(+1)
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
This paper proposes building a hierarchical world model adapted from the Matryoshka representation learning (MRL) approach of Kusupari et al., to be used in planning tasks where planning is done using trajectory optimization with CEM in an MPC setting. In a nutshell, a single encoder of the observations is learned, but several levels of prediction are obtained by associating various models of the dynamics to increasing sizes of the prefix of the codes used for prediction, allowing the allocation of different levels of resources to CEM iterations and rollout steps. At a very high level, this appears to be a reasonable approach and to give good results.
But many crucial parts of the proposed approach (planning algorithm, evaluation protocol, schedule construction, ...) are supposed to be found in an appendix, which is not part of the submitted pdf. Without this appendix, it is impossible to fully evaluate the paper. Thus is cannot be accepted in its current form.
Critical strengths
The representation learning part of the paper is a direct adaptation of MRL to a hierarchical JEPA-style approach to planning, but I have not seen this applied to this domain before. The idea of allocating different resources to different parts of the planning task is reasonable as well. At a high level, the proposed approach thus appears to be reasonable, and to give good results.
Critical weaknesses
Although the basic ideas of the paper are simple, the details are quite hard to follow, with many things never defined (e.g., the key concept of fidelity, or the loss and regularizer used during learning), even excluding those that are supposed to be in appendix.
Most papers can be read without referring to their appendix, but not this one. For example, in Section 3.2, the scheduling scheme proposed by the authors is supposed to increase fidelity across CEM iterations and decrease it along rollouts, which is a key idea of the paper. Putting aside the fact that fidelity is never defined, the scheduling scheme itself is not explained, and relegated to the appendix, making it impossible to judge its merits.
The same can be said with other key parts of the approach (planning algorithm, experimental protocol, etc.).
Questions for authors
No questions.
2 comments
THank you for your response. that addresses some of my main concerns.
Response to Reviewer psj3
Comment: “Many crucial parts … are supposed to be found in an appendix, which is not part of the submitted PDF. Without this appendix, it is impossible to fully evaluate the paper.”
Response: Thank you for your feedback. The appendix is included in the submitted supplementary material, rather than appended to the main PDF, as ICLR requires. It contains the experimental protocol in Appendix A.1, schedule construction and a worked example in Appendix A.2, and the planning procedure in Algorithm 1. We respectfully ask that these materials be considered when reassessing the submission, since their perceived absence appears central to the recommendation.
We recognize that the nested scheduling mechanism is technically dense and aim to produce a concise and readable summary within the main text. We were gratified to see that reviewers XgLw and yXv7 rated the presentation “clear and easy to follow”. But we understand that the current explanation could still be improved. We appreciate your suggestions in this regard and will take them seriously when we revise. In particular, we will use the additional page available in the camera-ready version to bring more explanatory content from the supplement into the main paper and make the presentation more self-contained.