- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
Since the modern latent world models often optimize their planning trajectories via Euclidean distance, the planning often has to rely on some unrealizable path that shows shorter Euclidean distance. The authors’ idea is to attach a lightweight head that measures “reachability”, which measures how many steps are required to go from a latent to another. It reflects the quasi-symmetric nature of the norm of reachability while satisfying triangular inequality, which seems to be a source of extrapolation capability that authors insist.
Critical strengths
- The motivation is very sound and makes a good sense.
- Essentially the way “reachability” is realized in this paper is to treat a distance between the two latents from an observed (s_t, a_t, s_{t+1}) triplet shorter than those not connected with an action in the train data, which sounds like an elegant and simple idea to me.
- The results on longer-horizon tasks seem convincing.
Critical weaknesses
- I do not necessarily think this method should bind to LeWM, as there are many other latent planning papers (e.g., [1, 2]) published recently. The training will not be heavy since it is primarily a framework attached on a pre-trained network and rely on simpler objective. Expanding this paper’s application and showing generalizability would have made this paper much stronger.
- The reason for bringing “quasimetric” property of the measure isn’t really convincing; in the author’s claim in Sec 3.4, the asymmetric property of the distance does not seem to be an essential element. If so, please clarify.
[1] A Frame is Worth One Token: Efficient Generative World Modeling with Delta Tokens (Kerssies et al., CVPR 2026)
[2] Planning in 8 Tokens: A Compact Discrete Tokenizer for Latent World Model (Kim et al., CVPR 2026)
Questions for authors
My question is primarily about its ability of extrapolation. The paper attributes the head’s extrapolation beyond the 3-block training window to the triangle inequality propagating the local constraint along trajectories, grounded in the QRL characterization of Wang et al. (2023). But:
- Eq. (4) is a relaxation of that constrained program (fixed , push), while the direction of the fixed-point deviation is unknown.
- The matched-capacity unstructured head (Table A10) fails by collapsing to a trivial distance, not by violating the triangle inequality.
- Such result supports “the MRN form excludes a degenerate solution” more directly than “the triangle inequality propagates local constraints”. Yet, Sec 3.3 claims the latter as its primary source of extrapolation.
Regarding above,
- Which of the two mechanisms are the authors claiming, and is the claim from Sec. 3.3 compatible with what Sec. M shows?
- Is there a control separating them, e.g., a head with the triangle inequality removed but and non-collapse enforced otherwise?
- On held-out trajectories, is the fitted actually a lower bound on recorded path length at long range (the chain bound ?