- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Dual-Latent World Model (Dual-WM), a hierarchical world model that separates short-horizon action execution and long-horizon goal planning into two distinct latent representations and dynamics models. The low-level model captures fine-grained action-conditioned transitions, while the high-level model uses learned macro-actions and a separate representation to support long-range planning. The two spaces are connected through a learned interface that enables high-level subgoals to guide low-level action refinement. The authors further introduce Long-Horizon Representation Learning with Weighted Rollout (LoRe), which supervises recursively generated predictions at both temporal scales using separately parameterized exponential horizon weights, together with Macro-Action Prior Shaping (MAPS) to improve the sampling properties of learned macro-actions. Experiments across five visual control tasks demonstrate improvements over several flat and hierarchical world-model baselines, particularly at longer goal offsets. Additional ablations and representation diagnostics support the benefits of the learned high-level representation, multi-step rollout supervision, and hierarchical planning.
Critical strengths
-
The paper introduces a useful architectural distinction between local execution and long-range planning by learning separate state representations and dynamics models for the two temporal scales. Unlike conventional hierarchical approaches that reuse a shared latent representation, Dual-WM employs a learned interface to map low-level latent windows into a dedicated high-level space for subgoal evaluation and refinement. The representation ablations provide encouraging evidence for this design. In particular, the proposed model substantially outperforms shared-identity, endpoint-based, and direct window-concatenation alternatives while retaining the same low-level checkpoint and hierarchical planning procedure. These results suggest that learning a distinct high-level representation provides benefits beyond simply introducing macro-actions or extending the prediction horizon, making the architectural contribution meaningful.
-
The paper evaluates Dual-WM across five visual control tasks spanning both continuous and discrete action spaces, with extensive comparisons against flat and hierarchical world models. The proposed method achieves consistent improvements at longer goal offsets, while the comparisons against the low-level-only variant using the same checkpoint provide evidence for the contribution of hierarchical planning. The component studies further investigate the effects of dual-scale rollout supervision, representation interfaces, and macro-action regularization. Importantly, the TwoRoom success–planning-time comparison shows that the full model can achieve higher planning success at comparable or lower computational latency than its low-level-only counterpart. Together with the representation and recursive prediction diagnostics, these results provide relatively strong support for the practical value of the proposed framework.
Critical weaknesses
-
Although the paper reports results over three planning seeds, these seeds primarily capture variation in evaluation-task sampling and planning randomness rather than independent world-model training runs. Consequently, the reported uncertainty does not fully characterize the sensitivity of Dual-WM to model initialization and optimization. Furthermore, the most important representation-interface and LoRe weighting ablations are concentrated on TwoRoom, leaving it unclear whether their conclusions generalize consistently to contact-rich manipulation tasks such as PushT and Cube-Single. Since the framework introduces multiple interacting components, including separate latent representations, macro-action modeling, and multi-step rollout supervision, additional experiments with independently trained checkpoints would be important for establishing the reliability and generality of the proposed design.
-
Dual-WM introduces additional high-level representation and dynamics modules, a macro-action encoder, and a multi-stage planning procedure, which potentially increase both training and inference costs compared with simpler world models. Although the paper provides a useful success–planning-time comparison on TwoRoom, it does not report comprehensive training time, total GPU-hours, or peak memory consumption for the full framework and its main baselines. Moreover, the planning-efficiency advantage has not been established on the more challenging manipulation tasks, where evaluating high-level subgoals and refining low-level action sequences may involve different computational trade-offs. A broader analysis of training and planning costs would strengthen the assessment of whether the reported performance gains justify the additional architectural complexity.
Questions for authors
-
How robust are the benefits of the learned dual-latent interface across training seeds and manipulation tasks? The current representation-interface and LoRe ablations provide encouraging evidence on TwoRoom, but most reported uncertainty comes from planning seeds rather than independently trained models. Could the authors repeat the main representation-interface comparison on PushT or Cube-Single using multiple independent training seeds, while keeping the low-level checkpoint shared across the variants within each seed? Reporting the variation in planning success and long-range goal discrimination would help determine whether the benefits of the separate high-level representation are consistent beyond the navigation setting and would materially strengthen my confidence in the architectural contribution.
-
What are the full computational trade-offs introduced by Dual-WM? Could the authors report training time, total GPU-hours, and peak GPU memory for the low-level and high-level components, together with comparable measurements for the main baselines? In addition, could they extend the existing success–planning-time analysis to at least one manipulation benchmark, such as PushT or Cube-Single, and report per-planning-call latency alongside the current amortized timing measurements? These results would help clarify whether the gains in long-horizon planning remain attractive when both the additional training cost and hierarchical inference overhead are considered.