- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies how a fixed budget of five complete CEM planner calls on a frozen visual world model should be split. The user selects a priori a number of planner calls of that budget, denoted r, that are allocated to planning from the initial observation, and the rest go to replanning from fresh observations after each execution. Call count and number of evaluated plans per call are matched across methods. Reserving calls helps a lot on Wall (r = 3 vs r = 5: ΔJ = −34.7, +31.6 pp success), has no significant effect on PointMaze, and gives a smaller gain on PushT (r = 4 vs r = 5). A matched control that replaces fresh observations with imagined latents attributes part of the Wall effect to feedback, and iCEM, DecentCEM-style and JEPA-WM variants on Wall go in the same direction.
Critical strengths
- Methods are compared fairly under a clean protocol. There is no data leak since the model and scorer are frozen, r is chosen on a separate pilot set, and inference is done per scene.
- The cached-latent ablation is a well-designed control for isolating the value of fresh observations.
- Negative results (adaptive selectors, restart controls, repair attempts) are reported openly, and the claims are appropriately restrained.
Critical weaknesses
- The motivation for this setup is unclear. It seems like the actual execution loop and the way to the budget is allocated can be done in many different ways and this one is not justified.
- The main result comes down to open-loop execution failing on Wall. Every schedule that replans (r = 1–4) reaches J ≈ 9–12, and only r = 5 collapses (Table 4). It is well known that closed-loop control is far more robust.
- The paper gives no actionable guidance. r shows no effect on PointMaze, and PushT is non-monotone (r = 3 is worse than r = 5 in some cases), so "task-dependent" says little about how to choose r.
- The scope is narrow: only K = H = 5, three simple tasks and one main model, and the experiment code is not released.
- The writing contains a lot of hedging, which hides a simple main finding among the words.
Questions for authors
- Why did you choose K=5? It seems arbitrary and unjustified. Do you have any results for other budgets or horizons?
- Why does r = 5 collapse on Wall specifically, and how do your r = 1 and r = 5 numbers compare with the published DINO-WM open-loop and MPC results?
- Can you please clarify what macro-actions are being performed in each environment and how they are implemented?
- What about taking multiple steps between intermediate planner calls? There is already extensive research on that, and this work seems to be a subset of this.
2 comments
Response to Reviewer 7kVa (2/2)
Q1 and W4: "Why did you choose K=5?" and scope
K = 5 was not tuned. It equals the official DINO-WM planning horizon (H = 5 macro-actions), and K = H is the smallest budget at which per-step MPC is possible. New Wall panels at H = 10 and 15, with K from 1 to H, give the two-call result above at all three horizons (details in our reply to smeF; Sec. 3, p. 4). The evidence covers three tasks and two model families (Sec. 7). The updated supplementary zip contains the anonymized end-to-end code (general response).
W1 and Q4: motivation, and "taking multiple steps between intermediate planner calls"
Each complete CEM call is expensive: 7.5 s on Wall and 65.5 s on PushT on one H100 with the official settings. A deployed controller therefore has a call budget, and when K < H it must choose when to spend the calls. The (b, F) notation separates the two choices such a schedule makes: how many searches before acting, and after which macro-actions to replan.
Multi-step execution between planner calls is a mature topic. The revision cites action chunking (ACT, Diffusion Policy), real-time chunking (RTC), Bidirectional Decoding, online replanning triggers such as AdaReP, regret-guided update scheduling (Musavi et al., 2026), and replanning budgets for LLM-based embodied agents (BRACE) (Sec. 2, p. 3). These works set chunk lengths, decide online when to replan, or schedule a limited number of updates. We fix the number of complete calls of a frozen world-model planner, compare search with feedback at matched calls and work, and separate new observations from re-optimization with the sham. Replanning every m steps is now an explicit baseline: at equal call counts, late placement and uniform spacing do not differ significantly in mean J (Holm p ≥ 0.19 in all five comparisons at H = 10 and 15). Late placement uses 33% to 44% less work at H = 15 (App. Table 9).
W5: hedging
Agreed. The abstract, introduction, and conclusion now state the finding and its strongest numbers first. Protocol terms (registered endpoint, two-way sensitivity interval) moved to the appendix, and disclaimers are collected in Sec. 7. The scope of the claims is unchanged.
Q3: macro-actions
All three released DINO-WM checkpoints use frameskip 5. For each macro-action, the planner proposes a 10-dimensional vector that the official code splits into five 2-D primitive actions, de-normalizes, and executes for five environment steps without reading observations (App. A.1, Table 2).
| Task | Primitive action | One macro-action |
|---|---|---|
| Wall | 2-D displacement; the agent moves by twice the action, and the central wall can only be crossed through the door | 5 displacements (H = 5: 25 environment steps) |
| PointMaze | 2-D force on the two ball actuators, clipped to [−1, 1], held for 5 MuJoCo substeps | 5 actions, 25 substeps |
| PushT | 2-D target displacement relative to the agent, tracked by a PD controller for 0.1 s | 5 actions, 0.5 s |
We hope these answers help in reassessing the paper.
Response to Reviewer 7kVa (1/2)
Thank you for the review, and for noting the clean protocol, the cached-latent sham, and the openly reported negative results. We kept the protocol and the restraint of the claims, and rewrote the text to state the main finding directly (W5). Notation: a schedule (b, F) runs b searches from the initial observation, then one feedback call after each macro-action index in F; the r schedules are (r, {r, …, H−1}), and one terminal correction is (1, {H−1}). Differences are in task cost J (lower is better) with 95% CIs.
W2: "The main result comes down to open-loop execution failing on Wall"
We agree that closed loop beating open loop is not, by itself, a finding, and the revised introduction says so. The revision reports where the value of feedback sits and what cannot replace it (Wall, DINO-WM).
No intermediate r is significantly better than per-step MPC (App. Table 7), and the revision no longer claims one.
W3: "The paper gives no actionable guidance"
Sec. 6.7 (p. 9) now gives three rules, each tied to evidence:
The PushT non-monotonicity came from the 24-reset and 39-instance development panels (App. Tables 25 and 31). On the 128-unit confirmation bank, per-step MPC beats r = 5 by −7.21 [−10.34, −3.77]. On PointMaze, a single search fails in only 13 of 64 new scenes, consistent with low open-loop drift (0.041 against 0.098 on Wall).
Q2: "Why does r = 5 collapse on Wall specifically, and how do your r = 1 and r = 5 numbers compare with the published DINO-WM open-loop and MPC results?"
Why. The agent must pass through a door in the central wall, and open-loop latent drift rises from 0.024 after the first macro-action to about 0.10 from the third on. Best-of-5 changes the predicted cost of the selected plan by −0.092 but its realized cost by only −0.033 [−0.067, 0.003]: picking among more candidates is consistent with exploiting model error rather than correcting it. Failures concentrate at the end. On the original panel, r = 5 fails in 116 cells; r = 4, which replaces the fifth search with a terminal correction, repairs 95 of them and breaks 1 (App. Table 15).
Published numbers. We ran the released DINO-WM planning code and Wall configuration on 50 pairs from its official generator and seed. Official MPC reaches 0.58 cumulative success after its first round, which executes one open-loop CEM plan, and 0.94 after five rounds. Each round executes a full five-step plan, and the episode stops on success. Our evaluator on the same pairs executes exactly five macro-actions and scores the end: single open-loop search 0.56 (−0.02 [−0.11, 0.07] against official round 1), best-of-5 open loop (r = 5) 0.60, per-step MPC (r = 1) 0.81, and one terminal correction 0.83. The DINO-WM paper reports 0.74 for open-loop CEM and 0.96 for MPC. More CEM updates do not close this gap: with three times the updates, single-search success on the sham panel is 0.47 against 0.49 (one seed; App. Table 12). We report the gap as found (App. A.1, Tables 3 and 4).
(continued in 2/2)