- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes LaRA-WM, a robotic manipulation framework that performs reward-guided test-time search in a learned latent action space. The method combines frozen DINOv2 and CLIP encoders, a conditional variational latent action model, an action decoder, an auxiliary feature-transition model, and a learned reward scorer. At deployment, the Cross-Entropy Method (CEM) refines candidate latents before decoding a motor command. Experiments on 12 RoboTwin tasks report improved in-distribution and out-of-distribution success relative to behavior-cloning, action-chunking, diffusion, and VLA baselines, with ablations examining latent modeling, reward supervision, and refinement.
Critical strengths
-
Coherent integration of representation learning and test-time action selection: The framework provides a clear mechanism for revising an action before execution, while avoiding pixel-level future generation. Separating expensive visual encoding from lightweight candidate scoring is a sensible design for batched test-time search (Sections 3.2–3.4).
-
Consistent gains across the evaluated manipulation tasks: Tables 1–2 report an average OOD success rate of 0.37 versus 0.27 for OpenVLA-oft. Importantly, Table 3 also includes a stronger latent/world-model variant without refinement, which reaches 0.24; the improvement to 0.37 provides more informative evidence for refinement than comparison with the minimal latent bottleneck alone.
-
Useful component diagnostics and measured inference cost: The ablations distinguish feature-prediction accuracy from closed-loop task performance rather than assuming they are equivalent. Appendix E reports five CEM iterations with 64 candidates each and approximately 52 ms policy latency on H200, within the evaluated 10 Hz control budget.
Critical weaknesses
-
The supervision and reliability of the reward scorer are insufficiently established: Equations (5)–(6) regress immediate rewards from expert demonstrations, but the manuscript does not specify the actual reward construction, whether dense shaping is used, or whether failed/suboptimal transitions provide coverage beyond expert behavior. CEM nevertheless evaluates hypothetical latent actions outside the observed demonstrations. The aggregate reward–environment correlation in Table 3 does not establish that the scorer correctly ranks alternative actions at the same state. Moreover, Algorithm 1 uses neither predictive rollouts nor a return/value target. Consequently, the link between immediate-reward optimization, reliable candidate ranking, and completion of multi-stage tasks remains under-explained.
-
The claimed advantage of latent-space search over raw-action search is not isolated: The introduction contrasts LaRA-WM with raw-action verifiers, but the experimental tables contain no budget-matched raw-action search baseline. Table 4 specifies a 32-dimensional latent and a 7-dimensional motor action, so the advantage is not dimensional compression of the motor command itself. A learned representation could still improve search geometry, but KL regularization alone does not establish that CEM avoids poor local optima or remains within physically plausible actions. The current results also do not distinguish iterative CEM refinement from simply scoring more independently sampled candidates.
-
Important implementation and evaluation details remain incomplete: Although Appendix E supplies the iteration count, sample count, latency, and three-seed rollout protocol, the PDF does not specify the elite count, the value of the KL coefficient, or the complete feature-transition objective and its weighting. Appendix B describes the types of OOD shifts but not their numerical ranges or exact held-out asset/configuration lists. Tables 1–3 provide no uncertainty estimates despite the reported repeated runs. These omissions make the magnitude and reproducibility of the robustness gains difficult to assess independently.
Questions for authors
-
What exact reward labels supervise the scorer, and what coverage of unsuccessful or suboptimal behavior is available? On a small set of held-out states, can the authors check whether the scorer's ranking of sampled candidate actions agrees with their realized rewards or downstream outcomes?
-
On two representative tasks, how does latent CEM compare with raw-action CEM using comparably trained scorers and the same evaluation budget, and with a single-round best-of-320 latent sampler? Reporting success and policy latency would help distinguish representation benefits from search-budget effects.
-
Can the authors provide the complete training objective, missing CEM/regularization settings, and precise OOD configuration, together with per-seed dispersion or confidence intervals from the already completed evaluation runs?