- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces Control-Geometry Straightening (CGS), an auxiliary loss that matches pairwise cosine similarities among actions to those among corresponding latent differences. The goal is to learn planner-friendly representations where the geometry exposed to action optimization is well-conditioned. Under linear dynamics, the paper provides theoretical analysis connecting CGS to temporal straightening and balanced terminal-cost curvature, yielding finite-budget guarantees for MPPI, local contraction results for CEM, and convergence bounds for gradient descent. Experiments on PushT, Cube, TwoRooms, and Reacher show success-rate gains up to 20 and 12.6 percentage points over LeWM and LeWM+TS, respectively, with sampling-based planners using 128 candidates per update.
Critical strengths
a. Making representations easier to plan in, not just accurate, is an important and underexplored direction. The CGS loss is simple to implement and applies to any world model architecture. The probing analysis (Table 2) provides valuable insights into when action-only vs. state-conditioned references matter.
b. The paper provides finite-budget guarantees for MPPI, local contraction results for CEM, and convergence bounds for gradient descent under linear dynamics. The analysis connecting local geometry (CGS loss) to global planning curvature (planning Hessian) is rigorous and informative. The -CGS bounds (Corollary 4.3) and the Hessian perturbation bound (Theorem 4.4) are particularly well-done.
c. The paper evaluates multiple planners (MPPI, CEM, GD), budget sweeps (K = 1 to 256), ablations (ramp fraction, history length, SIGReg weight, CGS weight), and probing analyses. The DINO-WM comparison in the appendix, while mixed, shows that CGS can apply to different architectures.
Critical weaknesses
a. CGS is a pairwise cosine similarity matching loss, which is a standard technique from knowledge distillation (Tung & Mori, 2019). The paper applies this to actions vs. latent differences, which is a reasonable application but not a fundamental algorithmic advance. The "control geometry" terminology makes it sound more novel than it is. The paper would benefit from a clearer discussion of what is genuinely new vs. what is a straightforward application of existing techniques.
b. The theoretical analysis is limited to linear dynamics, which is a significant gap. The paper provides rigorous guarantees under linear dynamics but experiments on nonlinear systems. While the paper acknowledges this limitation, it doesn't provide any analysis of when or why the linear theory carries over to nonlinear practice. A discussion of the conditions under which the linear approximation is valid (e.g., local linearity, small perturbations) would strengthen the theoretical contribution.
c. The paper compares against LeWM and LeWM+TS, but doesn't compare against other objectives that might also improve planning geometry (e.g., contrastive learning, inverse dynamics, DeepMDP, CURL). This makes it unclear whether CGS is the best approach or just one of many viable options. A comparison with at least one alternative objective would strengthen the empirical contribution.
d. On Reacher, CGS provides minimal improvement for MPPI (65.3% → 66.7%) and actually decreases CEM performance (83.3% → 80.7%). The paper attributes this to state-dependence but doesn't provide a deeper analysis. Understanding when CGS fails is as important as understanding when it succeeds.
Suggestion: At 50+ pages, some sections could be condensed. The core contribution could be presented more concisely. The extensive appendix, while thorough, makes the paper feel bloated.
Questions for authors
-
Can you provide a comparison with other representation learning objectives (e.g., contrastive learning, inverse dynamics, DeepMDP) to establish whether CGS is the best approach or just one of many viable options?
-
Can you provide a more detailed analysis of when CGS fails (e.g., on Reacher)? What properties of the task or dynamics make CGS less effective?
-
Can you bridge the gap between the linear theory and nonlinear practice? For example, can you provide empirical evidence that the planning Hessian is better-conditioned under CGS on the nonlinear tasks?
-
Can you provide more cross-architecture validation in the main text? The DINO-WM results in the appendix are mixed, and it would be valuable to understand when CGS helps vs. hurts with different backbones.
7 comments
Part 2/5
W2: “The theoretical analysis is limited to linear dynamics, which is a significant gap.”
Q3: “Can you bridge the gap between the linear theory and nonlinear practice? For example, can you provide empirical evidence that the planning Hessian is better-conditioned under CGS on the nonlinear tasks?”
Thank you for asking us to clarify the connection between our linear theory and nonlinear practice. We now provide both explicit conditions for the local linear interpretation and measurements of the actual nonlinear predictor's planning curvature (Remark 4.8, pp. 6–7; Fig. 5, p. 8; Table 13, p. 32).
For smooth dynamics, a local linear approximation captures first-order control responses when candidate rollouts remain in a neighborhood where the state and action Jacobians vary little. For the nonlinear terminal prediction , let and . The exact Hessian of is
=\underbrace{J_H^\top J_H}_{G_H^{\mathrm{GN}}} +\sum_j e_{H,j}(\mathbf{a})\nabla_{\mathbf{a}}^2 e_{H,j}(\mathbf{a}).$$ The first-order response determines Gauss–Newton curvature. It also approximates full curvature when the residual-weighted second-order term is small relative to it, as can occur with weak rollout nonlinearity or small terminal residuals and bounded second derivatives. **We directly measure Gauss–Newton and full-Hessian conditioning in the nonlinear transformer predictor used for planning**, testing whether the geometric benefits identified by our linear analysis also appear in practice. The table reports effective condition numbers computed from the largest $d_a$ singular values. Entries follow **LeWM / TS / CGS** for PushT, Cube, and TwoRooms, and **LeWM / TS / CGS-C / CGS-S** for Reacher. CGS-C and CGS-S use concatenated and summed action references, respectively; their comparison is discussed below in our response to **W4/Q2**. | Metric ↓ | PushT | Cube | TwoRooms | Reacher | | --- | --- | --- | --- | --- | | $\kappa_{\mathrm{eff}}^{d_a}(G_H^{\mathrm{GN}})$ | 2.24 / 2.18 / **1.65** | 680.84 / 138.19 / **25.78** | 3.27 / 2.03 / **1.78** | **1.23** / 1.60 / 1.60 / 1.31 | | $\kappa_{\mathrm{eff}}^{d_a}(G_H^{\mathrm{full}})$ | 7.52 / 7.69 / **5.82** | 38.15 / **7.56** / 14.92 | 17.78 / 7.57 / **7.18** | 11.55 / 7.66 / 8.97 / **4.12** | | $\kappa_{\mathrm{eff}}^{d_a}(G_H^{\mathrm{full,w}})$ | 2.80 / 2.87 / **2.06** | 243.68 / 102.87 / **56.00** | 3.26 / 2.76 / **1.92** | **1.29** / 1.61 / 1.63 / 1.31 | The superscript $w$ denotes evaluation at expert action sequences plus Gaussian noise with standard deviation $0.05$ (Eq. 29). In this near-expert regime, the full planning Hessian more closely matches its Gauss–Newton approximation. **CGS improves both Gauss–Newton and full-Hessian conditioning on PushT and TwoRooms.** On Cube, it substantially improves Gauss–Newton conditioning, while TS has better full-Hessian conditioning at the standard probe points; CGS has the best full-Hessian conditioning near perturbed expert actions. On Reacher, CGS-S yields the clearest full-Hessian improvement, which will be discussed in our response to **W4/Q2** in detail. Fig. 5 relates these measurements to MPPI success, with CEM/GD results in Appendix C.5.4. They support curvature balance as a contributing mechanism and identify where other limitations matter. Similar condition numbers near expert actions do not, by themselves, establish Gauss–Newton dominance; that would require comparing both Hessian terms at the same action sequence.Part 3/5
W3: “The paper compares against LeWM and LeWM+TS, but doesn't compare against other objectives that might also improve planning geometry (e.g., contrastive learning, inverse dynamics, DeepMDP, CURL).”
Q1: “Can you provide a comparison with other representation learning objectives (e.g., contrastive learning, inverse dynamics, DeepMDP) to establish whether CGS is the best approach or just one of many viable options?”
Thank you for suggesting this comparison. We added both inverse-dynamics and temporal-contrastive comparisons under the same JEPA training and planning setup; CGS achieves the highest mean success across all three planners on PushT. The definitions and results are now in Appendix C.5.6 (pp. 33–34), Table 14.
Inverse dynamics (LDAD). Following Delta-JEPA (Zhang et al., 2026b), a training-only decoder reconstructs actions from latent displacements:
=\frac{1}{BTd_a}\sum_{b=1}^{B}\sum_{t=0}^{T-1} \left\\|D_{\psi}(z_{b,t+1}-z_{b,t})-a_{b,t}\right\\|_2^2.$$ We test weight 10, following Delta-JEPA, and the larger value 100. Accurate action decoding preserves action information but **does not itself ensure that latent similarities reflect action similarities or that planning curvature is well conditioned**. **Temporal contrastiveness (TC).** Following the comparison in TS ([Wang et al., 2026b, Appendix B.5](https://arxiv.org/html/2603.12231v3)), we use $\mathcal{L}_{\mathrm{TC}}=\operatorname{InfoNCE}(z_{\mathrm{pos}},z_{\mathrm{neg}})$, with other frames within a temporal window of length $N$ as positives and frames outside that window in the same trajectory as negatives. This encourages temporal proximity in the representation, but **can incorrectly separate similar states revisited later in a trajectory**. The table reports mean success (%) over three evaluation seeds, with 50 episodes each. CEM/MPPI use $K=128$, $I=30$; GD uses 100 steps. We retain the LeWM ([Maes et al., 2026](https://arxiv.org/abs/2603.19312)) backbone, prediction loss, and SIGReg objective. | Method | Weight | CEM | MPPI | GD | | --- | --- | --- | --- | --- | | LeWM | — | 89.3 | 64.0 | 85.3 | | TS | 0.01 | 86.7 | 64.7 | 82.7 | | CGS | 0.01 | **92.0** | **77.3** | **89.3** | | LDAD | 10 | 87.3 | 70.7 | 83.3 | | LDAD | 100 | 80.7 | 58.0 | 70.0 | | TC | 0.001 | 90.7 | 63.3 | 88.0 | | TC | 0.01 | 84.0 | 53.3 | 76.7 | LDAD improves MPPI, and TC improves CEM and GD at the smaller weight, showing that these objectives can also help. **CGS achieves the highest mean across all three planners**, and larger weights degrade both alternatives. These results support explicitly shaping control geometry beyond action recoverability or temporal proximity, consistent with our analysis of balanced planning curvature. DeepMDP ([Gelada et al., 2019](https://proceedings.mlr.press/v97/gelada19a.html)) jointly models rewards and latent transitions, while CURL ([Laskin et al., 2020](https://proceedings.mlr.press/v119/laskin20a.html)) combines contrastive representation learning with off-policy RL. Our added baselines isolate inverse-dynamics and temporal-contrastive objectives within reconstruction-free, reward-free JEPA training. This provides a controlled comparison of auxiliary representation objectives under the same supervision and model class.
Part 1/5
Thank you for the constructive review and for recognizing the importance of planner-friendly representations, the geometry-to-planning analysis, and the breadth of our evaluation. CGS identifies a local action–transition constraint that shapes finite-horizon planning curvature, with a linear-model analysis connecting this geometry to finite-budget planning. It uses a single auxiliary loss on observation–action transitions without reward, goal, or image-reconstruction supervision for training. Your questions helped us clarify this contribution and strengthen its empirical support: the revision adds alternative-objective comparisons, nonlinear curvature measurements, deeper Reacher diagnostics, and expanded DINO-WM results in the main text.
Thank you for asking us to clarify our contribution. CGS translates the goal of improving JEPA planning-Hessian geometry into a local training target, with theoretical connections to finite-budget optimization and empirical improvements in planning efficiency.
Our starting point was the insight from TS (Wang et al., 2026b) that near-identity latent dynamics can improve planning. For zt+1=Azt+Bat, however, even A=I leaves the anisotropy of B⊤B unconstrained. We therefore worked backward from the desired finite-horizon planning curvature to identify a local geometric surrogate for its elegance and computation efficiency, avoiding direct Hessian regularization through an H-step predictor rollout.
Under the stated linear-model, fixed-radius, and coverage assumptions, our analysis shows that local action–transition Gram matching jointly controls temporal drift, drift–control coupling, and action anisotropy: A≈I, (A−I)⊤B≈0, and B⊤B≈cI. These constraints yield finite-horizon curvature bounds and corresponding MPPI, CEM, and GD guarantees (Sec. 4; Appendix D). The practical cosine objective expresses this local angular relation: latent transitions remain aligned when actions align and turn when actions turn. The pairwise similarity-matching form has precedents in similarity-preserving knowledge distillation (Tung & Mori, 2019). Our contribution is to identify local action–transition matching as a training target for shaping planning geometry and establish its connection to finite-horizon curvature and finite-budget optimization.
The original submission evaluated this principle across four environments and three planners, with sampling-based success gains up to 20.0 and 12.6 percentage points over LeWM and TS at K=128. The revision strengthens this evidence through direct nonlinear-Hessian measurements, alternative-objective comparisons, expanded DINO-WM evaluation, and Reacher reference/history analyses, clarifying both the mechanism and its applicability.
The name Control-Geometry Straightening reflects this extension of Temporal Straightening: from straightening latent trajectories to shaping how action effects accumulate into the finite-horizon planning Hessian. The revised Sec. 4 (pp. 4–7) makes the inherited framework and our additional contributions explicit.