- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper aims to address the state-representation mismatch between largely static scene context and action-evolving execution state in open-loop planning for vision-language-action models. It proposes State-Space Visual Reasoning, which reuses the static visual-textual context and maintains a recurrent latent state updated by an action-conditioned GRU. Empirically, SSVR improves long-horizon planning and enables efficient multi-step inference, achieving up to 98.58× faster Maze decoding rollouts than baselines.
Critical strengths
- S1. Strong empirical performance on the evaluated open-loop tasks. SSVR consistently outperforms the compared baselines on FrozenLake, Maze, and MiniBehavior. Gains are especially large on Maze and MiniBehavior, suggesting that an action-conditioned latent state is effective for these open-loop planning problems.
- S2. Efficient inference. SSVR substantially reduces reported rollout latency compared with other reasoning methods, and its design is simple and practical.
Critical weaknesses
-
W1. The evaluated environments are too narrow to support broad VLA claims. FrozenLake and Maze are highly controlled: static visuals, deterministic transitions, and discrete actions. Even MiniBehavior is much simpler than realistic VLA settings. In real manipulation, observations change during execution due to camera motion, object motion, occlusion, and stochasticity. The initial image therefore may not be a sufficient persistent visual context. It remains unclear whether SSVR generalizes beyond cases where the state can be largely inferred from the initial observation and action history.
-
W2. The GRU state may be a bottleneck in long-horizon planning or detail-sensitive tasks. SSVR compresses the entire history into a single GRU state, so it is also lossy. The paper does not analyze long-horizon error accumulation or compare against Transformer long-context or external memory. The large performance drop on Maze Level 6 when the image is downscaled to 0.7 (Figure 4) suggests sensitivity to visual detail and state precision, but GRU capacity is not examined.
Questions for authors
Q1. What happens when the visual observation changes during execution? SSVR caches the initial visual context and only updates a latent state. How does it handle new visual information that cannot be recovered from the initial image and action history, such as camera motion, occlusion, or newly revealed objects?
Q2. How does performance scale to more realistic action spaces and longer horizons? The current experiments use mostly discrete actions and structured environments. Does the proposed representation still work for continuous actions, longer-horizon manipulation, stochastic transitions, and settings where observations change substantially over time?
Q3. How does SSVR scale beyond single-token discrete actions? Can it handle continuous, parameterized, or combinatorial actions while still reusing the LM head? How are tokenization and probability normalization handled then?
Q4. How important is the initial state design? The initial state is initialized from mean-pooled visual features. Does this lose spatial information? Have the authors compared attention pooling, learnable queries, or spatial token aggregation?
8 comments
Q2/Q3: Clarification of the single-token restriction, LM head reuse, and extension to continuous actions.
SSVR's state update takes a vector encoding of the action, so it does not require each environment action to correspond to a single token. A single token is the encoding choice for the discrete-action interface in the paper; parameterized or combinatorial actions can be extended to multi-token representations to reuse the LM head, while continuous actions can also be supported by discretizing them into tokens or using a regression head for output.
The encoding extension for parameterized or combinatorial actions can retain the LM head prediction and normalization mechanism already used in the paper. Specifically, an action can be represented as “action type + parameters or action components + end marker,” with continuous parameters first discretized. The LM head predicts each token sequentially, applying softmax over the candidate set permitted by the current format; the probability of the complete action is the product of the conditional probabilities at each step. Once the entire action has been generated, it is encoded and the state is updated once.
To further examine the extension from discrete-token output to continuous-value regression, we add a two-dimensional continuous navigation experiment. The model predicts displacement through a two-dimensional regression head, encodes the displacement for state updates, and is trained accordingly. During validation, it plans from the initial image under a common 32-step budget without execution feedback; success requires reaching the goal region without collisions, and path efficiency measures motion cost relative to the shortest feasible path, with failed samples assigned zero.
| Additional experiment | Success rate (%) | Path efficiency (%) |
|---|---|---|
| Two-dimensional continuous navigation, validation set (128 tasks) | 79.69 | 77.04 |
This result demonstrates that the same state-modeling architecture can extend from discrete action selection to continuous motion planning by adapting the action output and encoding interfaces.
Q4: Clarification of the state-initialization strategy and an additional attention-pooling comparison.
First, we clarify that the initialization method is a replaceable implementation component. Mean pooling was chosen to keep the implementation and overall framework simple, highlighting SSVR's core design: decoupling the high-dimensional scene context that remains valid throughout execution from the low-dimensional execution state that evolves with actions, thereby addressing the “state-representation mismatch.”
In SSVR, mean pooling is responsible only for constructing the initial execution state; the complete visual tokens and their spatial information remain in the cache and are continuously available for decision-making. Spatial details therefore do not need to be independently encoded in the pooled vector, and the model can reread the relevant visual information according to its current state.
To address the reviewer's question about initialization design, we further add a learnable-query attention-pooling comparison. The results on Maze are as follows:
| State initialization | EM (%) | PR (%) |
|---|---|---|
| Mean pooling | 96.3 | 97.98 |
| Learnable-query attention pooling | 97.4 | 99.18 |
Attention pooling improves EM and PR by 1.10 and 1.20 percentage points, respectively, indicating that more selective information aggregation can further improve planning accuracy.
Therefore, mean pooling provides an effective and simple default initialization, while attention pooling demonstrates the benefits of module optimization; our decoupling paradigm accommodates different initialization strategies and does not depend on a particular pooling method.
W1: Clarification of evaluation scenario selection and additional experiments extending VLA open-loop planning
We first wish to emphasize that this work studies pre-execution planning in VLA, whose core challenge is to make full use of available visual information and generate optimal action plans through successive internal simulation. We select evaluation scenarios around this challenge to examine whether scene–state decoupling can address the failure of existing paradigms to perform multi-step reasoning and planning in visual scenes with complex topology due to “state-representation mismatch.”
Using VPRL's FrozenLake, Maze, and MiniBehavior both ensures baseline comparability and allows the evaluation to directly address the principal failure modes of three existing paradigms:
-
Text space: jointly compressing scene and state leads to loss of spatial relationships. These tasks require precise preservation of holes, walls, and passage connectivity; omitting or blurring key topological relationships in a language summary directly affects subsequent planning.
-
Pixel space: repeatedly reconstructing the entire scene leads to redundant computation and accumulation of generation errors. The scene is largely persistent, while action-induced changes in position and interaction state are relatively compact, allowing these tasks to effectively examine the difference between “regenerating the entire image” and “reusing the scene while updating the state.”
-
Latent space: insufficient association between intermediate representations and task-state evolution leads to visual-representation bypass. Navigation, picking up, carrying, and placing require the intermediate state to be continuously updated with actions and to participate in subsequent visual readout and decision-making. These tasks can therefore directly examine whether intermediate representations actually serve a multi-step reasoning function.
To address questions about broader scenarios, we further add dynamic-view and continuous-action experiments, which, together with the original cross-task transfer results, examine the method's capacity for extension:
| Task or experiment | Capability examined | Results |
|---|---|---|
| FrozenLake, Maze, MiniBehavior | Risk avoidance, topological path finding, and phased object interaction | EM/PR (%): 99.5/99.6, 96.3/98.0, and 83.9/90.6, respectively |
| FrozenLake → Maze | Transfer across map structures without target-task training | EM/PR (%): SSVR 33.6/38.3; VPRL 6.8/7.2 |
| MazeFlip experiment | Simulation of predictable view changes without intermediate observations | 86.20% EM, 94.82% PR |
| Two-dimensional continuous navigation experiment | Obstacle-avoiding planning with continuous displacements, 128 validation tasks | 79.69% success rate, 77.04% path efficiency |
We reiterate that “pre-execution planning” and “adaptation during execution” are capability requirements at different stages of VLA. Focusing on pre-execution planning, the subject of this work, the current experiments already provide direct evidence at three levels:
-
The original tasks have already effectively demonstrated SSVR's ability to perform multi-step reasoning and planning in visual scenes with complex topology through scene–state decoupling.
-
The additional MazeFlip experiment further demonstrates SSVR's planning ability on dynamic maps.
-
The additional two-dimensional continuous navigation experiment also provides further validation of SSVR's planning ability in continuous action spaces.
Therefore, the original evaluation directly addresses the research question of this work, while the additional experiments further broaden the conditions of applicability; together, they support scene–state decoupling as an effective reasoning paradigm for pre-execution open-loop planning in VLA.
Response to Reviewer JrYR
We thank Reviewer JrYR for recognizing the planning performance, inference efficiency, and simplicity of the design. To address your concerns, we have added long-horizon state information retention analysis (App E.2), state-capacity (App E.2) and module comparisons (App E.1), and initialization ablations (App E.3), as well as MazeFlip (App E.6), continuous navigation (App E.7), and restricted-history generalization experiments (App E.5). We respond to each point below.
Q1: Clarification of the exclusion of partially observable settings and additional experiments with dynamic scenes
First, we clarify that this work studies “pre-execution planning” in VLA: making full use of available visual information before acting to simulate action consequences and generate a complete plan. The scenarios raised in the review that require receiving new observations, identifying unexpected outcomes, and revising plans examine “adaptation during execution.” These correspond to different stages of a task. Accordingly, SSVR uses a protocol with an initial observation and no execution feedback to directly evaluate the model's capacity for internal visual simulation.
Pre-execution planning can also encompass dynamic changes governed by known rules. To this end, we add the MazeFlip experiment: LEFT/RIGHT actions trigger a vertical flip of the subsequent view, while UP/DOWN actions trigger a horizontal flip. The model receives only the initial image and performs internal simulation based on action history and known rules, without intermediate observations. As shown below, SSVR achieves 86.20% EM and 94.82% PR, demonstrating its ability to plan in dynamic scenes without intermediate observations.
Therefore, the original evaluation directly addresses the research objective of pre-execution planning in VLA, and the additional MazeFlip experiment further demonstrates SSVR's planning ability under predictable dynamic views. Online adaptation driven by new observations constitutes closed-loop adjustment during execution and lies beyond the scope of this work.
Q2: Validation of generalization to longer planning sequences
SSVR's learned state updates can extend to longer planning processes. We add a restricted-history training experiment, restricting training action prefixes to at most 5 steps, retraining the model, and evaluating it on 166 Maze tasks requiring 6–8-step plans, with a model trained on the full history range as a reference. Plans of 7–8 steps require continued decisions after action prefixes longer than 5 steps. The results are as follows:
The restricted-history model generates complete optimal plans on 78.31% of the test tasks and achieves 92.96% PR.
These results show that the model can effectively generalize its learned state updates to longer action histories not covered by training supervision, supporting the generation of complete longer plans.