- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper converts a pretrained LeWorldModel into a recurrent-depth JEPA while preserving its original effective encoder and predictor depths. It averages pretrained layers into shared bases, initializes depth-specific low-rank adapters from truncated-SVD residuals, and jointly uptrains the adapters and predictor AdaLN with prediction, SIGReg, and teacher-distillation losses. It also proposes a training-free gate that compares predicted latent displacements with a recent lower-median motion scale, then softly clamps and blends unusually large steps. On PushT, TwoRooms, Cube, and Reacher with CEM planning, the paper reports that the loop model uses 43–47% fewer stored parameters than the official model while modestly improving ungated mean success; the gate further improves planning for both looped and untied models.
Critical strengths
-
The method shares weights across layers to reduce stored parameters, while using depth-specific low-rank adapters to approximate the differences between the original pretrained layers. Figure 3 and Table 2 support the importance of recovery training and retaining these adapters. Table 1 reports that one configuration reduces stored parameters by 43–47% while improving mean success by 1.8 points over Official, although this result alone does not establish a practical deployment benefit.
-
The Self-Correction Gate is training-free and can be applied independently of depth sharing. With fixed gate settings, Table 1 reports a higher cross-task mean for all eight Loop schedules, while Table 4 shows gains on all four tasks for the untied Official model. Figure 2(b) also reports lower 95th-percentile latent step magnitudes during free rollouts.
Critical weaknesses
-
The practical motivation and efficiency case are under-established. The paper reports 43–47% fewer stored parameters, but does not identify a concrete memory constraint this resolves or measure whether the conversion reduces inference FLOPs, peak memory, prediction latency, or end-to-end CEM planning time. Since effective encoder/predictor depth is preserved and depth-specific adapters plus the gate add computation, parameter reduction alone cannot establish faster or more deployable planning. The modest mean-success gain is promising, but its robustness and runtime trade-off are not quantified.
-
The gate improves planning success, but its effect on accumulated prediction error remains unclear. In the main five-step planning setup, the gate can first act on the fifth and final prediction (Section 4.1). It can therefore change which action sequence the planner selects, but no later prediction within that sequence uses the corrected state. Figure 2(b) shows smaller latent steps in longer rollouts; smaller steps alone do not show that predictions are closer to the true trajectory. The evidence should therefore more clearly establish whether feeding corrected states into subsequent predictions improves accuracy, beyond the demonstrated planning benefit.
-
Presentation could be more concise. The reference list includes URLs for nearly every entry, making it visually dense. The authors should check the venue’s bibliography style and remove links that are unnecessary under that style.
-
Some elementary steps are over-formalized in the main text. For example, Equations (7) and (8) express the gate’s thresholding and displacement clamp, which could first be explained more simply in prose or pseudocode. Keeping the exact definitions for reproducibility while moving some implementation detail to an appendix would make the central idea easier to follow.
Questions for authors
-
What concrete deployment constraint is the 43–47% reduction in stored parameters intended to address? Please report or clarify the corresponding inference FLOPs, peak memory, prediction latency, and end-to-end planning time for the compared models, including the overhead of adapters and the gate, and explain whether the reported success-rate gain persists at comparable runtime or resource budgets.
-
Does feeding corrected states into subsequent predictions reduce prediction error over longer rollouts, compared with leaving those states uncorrected? The main five-step planning experiment cannot establish this because the gate can first act on the final prediction. Please clarify whether the controls in Appendix F.2 provide evidence of this benefit.
-
Could you review the formal presentation throughout the paper and simplify equations where a concise explanation would be clearer?