- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper addresses a limitation of world-model-based planning: candidate actions are evaluated solely by the distance between the predicted terminal state and the goal, with no check on whether the predicted transitions are actually consistent with the actions. To address this, the paper proposes ACID. The method uses a separately trained inverse dynamics model to infer actions from the state transitions predicted by the world model, and treats the discrepancy between these inferred actions and the original candidate actions as a consistency cost. This cost is combined with the goal cost through adaptive weighting to improve the selection of candidate action sequences, without any modification to the world model itself. Under a locally linear dynamics assumption, the paper analyzes the connection between this cost and a component of the prediction error. The approach is evaluated on simulated control and manipulation, visual navigation, and real-robot manipulation tasks. The experiments report performance gains across different world models, and ablation studies examine the effects of the adaptive weighting, the sampling budget, and errors in the inverse dynamics model.
Critical strengths
-
The paper studies the use of world models as outcome predictors and selectors for a policy's candidate actions, and identifies an important gap in existing work: current world models tend to focus only on the generated goal image, potentially overlooking whether the actions can actually produce the predicted transitions. Building on this observation, the authors propose a cost targeting the consistency of intermediate actions, which effectively mitigates this issue.
-
Unlike most prior work, which uses an inverse dynamics model (IDM) as an action generator or a pseudo-label generator, this paper employs the IDM as a verifier at the planning stage. It directly influences the selection of candidate actions and forms a closed loop with the world model's forward prediction. I find this idea quite interesting.
Critical weaknesses
1. The action-consistency criterion relies on a strong action-identifiability assumption, and its practical scope remains unclear.
The paper treats the discrepancy between the IDM-inferred action and the original action as a signal of inconsistent predicted transitions, but this interpretation holds only if the action is uniquely determined by the start and end states. Although the theoretical analysis makes this condition explicit through the locally linear dynamics assumption and the requirement that B has full column rank, the extent to which it holds in practical settings with visual latents and action chunks has not been sufficiently verified. Different actions or action sequences may produce identical or nearly identical observable transitions. In such cases, even if the world model's prediction is accurate, the IDM may return a different but equally valid action, causing the consistency cost to wrongly penalize a feasible candidate. The residual may therefore conflate world-model prediction error with the inherent ambiguity of inverse dynamics, and the paper should more explicitly qualify the conditions under which it serves as a valid feasibility signal.
2. The technical novelty is relatively limited and amounts mainly to an extension of an existing planning cost.
ACID retains the established pipeline of world-model prediction and CEM/MPC planning, and its main technical increment is an IDM-based action-consistency cost combined with the goal cost through adaptive weighting. It leaves CEM's candidate sampling, elite selection, and distribution update unchanged, so the contribution is essentially an improvement to the planning objective. While this design has practical value, the paper's emphasis on the overall framework should be commensurate with the scope of what is actually new. CEM is already introduced in §3.1 and the accompanying pseudocode, but the paper could more clearly distinguish the existing planning pipeline from the newly added module, so that the boundary of the contribution is easier to see.
3.The navigation experiments with video-generation world models provide limited support for the related performance claims.
In the goal-conditioned visual navigation experiments with NWM/CompACT, ACID reduces ATE and RPE by only 2.3% and 1.5% relative to the baseline. These are modest gains, and describing them as a "notable performance improvement" in the main text is somewhat overstated. More importantly, these metrics measure how closely the planned trajectory matches the reference trajectory in the dataset, and this setting involves no closed-loop execution in an environment. Being closer to the reference trajectory does not directly translate into a higher goal-reaching success rate, nor does it fully capture obstacle avoidance or the ability to replan under execution errors. The current results therefore mainly show that the method reduces offline trajectory error in this setting, and are insufficient to demonstrate improved closed-loop navigation performance. The authors should either temper the corresponding claims or add closed-loop experiments with metrics such as navigation success rate that directly reflect task completion.
Questions for authors
1. What is the new contribution of this paper relative to existing IDM-based action-consistency metrics?
CompACT[1] already uses an IDM to infer actions from generated frames and evaluates the action consistency of the generated results via the error between the inferred and input actions. I would like the authors to clarify more explicitly how ACID relates to and differs from such existing methods. Beyond turning this signal from an evaluation metric into a planning cost and introducing adaptive weighting, what substantive technical contributions does the paper make? Clarifying this would help readers more accurately understand the scope of the novelty.
2. Does ACID detect world-model prediction errors, or deviations of candidate actions from the behavior patterns in the training data? Could this preference limit generalization?
Since the IDM is trained on offline data, a large action-reconstruction error may arise either from inaccurate world-model predictions or from candidate actions that lie outside the behavior distribution familiar to the IDM. Appendix J evaluates ranking ability using reference actions and their noise-perturbed versions, but the fact that the method tends to select the reference action does not seem sufficient to distinguish between these two explanations. Could the authors provide more direct evidence that the consistency cost indeed reflects the discrepancy between prediction and actual execution? Furthermore, when an action is not uniquely determined by the state transition, an action that differs from the training demonstrations may still produce a correct and valid transition. Would ACID wrongly penalize such an action because the IDM fails to reconstruct it, thereby biasing selection toward the behavior patterns in the training data? In policy-guided planning in particular, could this filtering suppress valid novel behaviors that the policy would otherwise generate, and thus limit generalization to new scenarios? I would appreciate it if the authors could discuss this risk, as well as how the method performs when the action-identifiability assumption does not hold.
3. Why do the standalone Diffusion Policy and the full system use different data budgets on PickPlace?
According to the appendix, the DP on PickPlace is trained on only 30 demonstrations, whereas the WM and IDM are trained on 200. The improvement of the full system over standalone DP therefore conflates the effect of additional training data with that of inference-time candidate search, making it difficult to disentangle their respective contributions. Why was the standalone DP not also trained on all 200 demonstrations, and what is its success rate in that setting? I would encourage the authors to add this comparison, so that readers can assess how much benefit planning and consistency-based filtering provide under the same data budget.
[1] Dongwon Kim, Gawon Seo, Jinsung Lee, Minsu Cho, and Suha Kwak. Planning in 8 Tokens: A Compact Discrete Tokenizer for Latent World Model. arXiv preprint arXiv:2603.05438, 2026.