- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes Structured Latent Reasoning (SLR), which organizes continuous latent tokens into semantically explicit reasoning units and supervises them with an auxiliary text decoder strictly during training. It introduces Transition-Adaptive Learning (TAL) to dynamically reweight each unit's loss based on its relevance to the action policy at each control step. Experiments demonstrate that SLR achieves a 73.7% success rate on SIMPLER and 79.0% on real-robot tasks with strong OOD generalization, while running at 341 ms/step—over 16× faster than explicit CoT.
Critical strengths
The paper’s primary strength lies in its Structured Latent Reasoning (SLR) framework, which elegantly solves the trade-off between reasoning quality and execution speed. This design preserves structured intermediate semantics while achieving an inference latency of just 341 ms/step (over 16× faster than explicit text CoT), making it genuinely viable for real-time robotic control. SLR also demonstrates exceptional out-of-distribution generalization, proving that structured latent representations boost both control performance and policy robustness.
Critical weaknesses
-
W1. Overclaim on “Consistent Improvements” Across Sub-Tasks. The paper claims consistent improvements over existing baselines. However, in the SIMPLER evaluation (Table 1), SLR’s overall lead over LaRA-VLA (73.7% vs. 68.8%) is driven almost entirely by a single task—Stack block (54.2% vs. 25.0%). On Put spoon and Put carrot, SLR actually underperforms LaRA-VLA (83.3% vs. 95.8% and 58.3% vs. 62.5%, respectively). The claim of “consistent improvements” is therefore not supported by the per-task results and should be revised to reflect the task-dependent nature of the gains.
-
W2. Limited Flexibility and Scalability of the Fixed Latent Architecture. The model uses a rigid, hardcoded 8-slot latent architecture with a fixed semantic order. This static capacity may be suboptimal for simpler single-step primitives, where many slots could be redundant, or for highly complex multi-stage tasks, where eight slots may be insufficient. The paper does not provide ablations on the number of latent units or their ordering, nor does it discuss how the architecture could be adapted to tasks of varying complexity. This limits the claimed generality of the approach.
Questions for authors
-
Q1. Localized Performance Gains. In Table 1, SLR's margin over LaRA-VLA (73.7% vs. 68.8%) is almost entirely driven by a single sub-task (Stack block: 54.2% vs. 11.5%), while SLR underperforms LaRA-VLA on Put spoon and Put carrot. Could the authors clarify why the performance gains are so highly localized to block stacking?
-
Q2. Robustness to Annotation Noise. SLR relies on a complex synthetic pipeline (Qwen, Grounding DINO, OWL-ViT) to generate targets for all 8 slots. Given that synthetic labels inherently contain bounding-box noise or LLM hallucinations, how robust is SLR to label noise during training?
-
Q3. Completeness and Justification of the 8-Slot Design. The architecture hardcodes a fixed 8-slot topology with pre-assigned semantics. Could the authors provide theoretical or empirical justification for the completeness and necessity of this specific 8-slot breakdown, rather than leaving the latent space unconstrained or dynamically sized?
Minor:
- Figure 2 retains a visible red spell-check squiggly line under text.