- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Action–Effect Contracts, a semantic interface designed to bridge high-level task intentions and low-level physical action execution in agentic robotic systems. The framework employs a fine-tuned Qwen3-VL-8B model to generate physical-effect requests, including approach, lift, transport, and place. A frozen π0.5 VLA generates multiple candidate action chunks, while an effect-conditioned ranker evaluates their compatibility with the requested physical effects. The ranker incorporates candidate-conditioned spatial attention and is trained using candidate-level classification and pairwise ranking losses, with supervision obtained from same-state counterfactual executions. The method is evaluated on nine LIBERO-90 tasks and four real-world manipulation tasks, achieving improvements over direct VLA execution and random candidate selection. Overall, the paper addresses a meaningful problem and proposes a practical framework for coordinating high-level reasoning with low-level robotic execution.
Critical strengths
- Meaningful problem formulation and practical Agent–VLA integration. The paper addresses an important limitation of hierarchical robotic systems, where high-level agents typically influence task-level decisions but have limited involvement in low-level action execution. The proposed Action–Effect Contracts establish an explicit interface between task intentions and physical action effects. This provides a practical mechanism for guiding action selection without modifying the pretrained VLA policy.
- Effective candidate-level supervision and encouraging empirical results. The same-state counterfactual supervision provides meaningful training signals by comparing the physical outcomes of different candidate actions under identical initial conditions. The method achieves consistent improvements over direct policy execution and random candidate selection in both simulation and real-world manipulation experiments. The ablation studies also support the contributions of the individual modules.
Critical weaknesses
- Insufficient comparisons with competitive baselines. My primary concern is the limited set of comparison methods. The main experiments compare the proposed approach only against direct execution of the frozen π0.5 policy and random selection among four candidate actions. Although these comparisons demonstrate that the proposed ranker is more effective than naive selection strategies, they are insufficient to establish its advantages over existing action-ranking, goal-conditioned scoring, or model-based planning approaches. The component ablations are useful, but they do not replace comparisons with independent and competitive alternatives. In particular, the authors should consider including: • A rule-based or finite-state effect-request generator combined with the same action ranker, to evaluate whether the high-level VLM provides benefits beyond conventional manipulation-stage estimation. • A goal-conditioned action ranker or learned value critic operating on the same frozen VLA candidates, with comparable training data and computational budgets. • A representative model-based or VLM-guided candidate-selection baseline, such as an appropriately adapted VLMPC-style approach, where a fair comparison is feasible. These comparisons would substantially strengthen the empirical justification for the proposed design.
- Moderate methodological novelty and limited generalization evidence. The overall framework primarily integrates existing components, including a pretrained VLM, a frozen VLA, a visual encoder, and a learned ranking network. While the explicit Action–Effect Contract is a useful interface, the classification and pairwise ranking objectives are relatively standard. The paper does not sufficiently demonstrate why this particular formulation is preferable to alternative goal-conditioned action evaluation methods. Furthermore, the experiments mainly focus on grasping and object-placement tasks. The limited task diversity makes it difficult to assess whether the four predefined effect categories generalize to more complex interactions or long-horizon manipulation scenarios. Therefore, the current evidence does not fully support broader claims about the general applicability of the framework.
Questions for authors
Q1. Comparison with stronger action-selection baselines Why are the main experiments limited to direct π0.5 execution and random candidate selection? Could the authors compare against a learned goal-conditioned action scorer or value-based candidate selector using the same frozen VLA, candidate pool, and training data? Such an experiment would help determine whether the observed improvements arise specifically from the proposed Action–Effect Contract formulation or from learned candidate ranking more generally. Q2. Necessity of the high-level VLM Since the effect vocabulary contains only four predefined manipulation stages, could the authors compare the fine-tuned Qwen3-VL agent against a rule-based or finite-state effect-request generator? This comparison is important for establishing the necessity of high-level vision-language reasoning in the proposed framework. Q3. Generalization and candidate-selection limitations How does the approach behave when none of the generated candidate actions can realize the requested effect? Could the authors report the frequency of such cases and evaluate whether the ranker can reliably distinguish feasible from infeasible candidate groups? This analysis would help clarify the practical limitations of the current action-selection mechanism.
2 comments
Thank you for your response. I maintain my original score.
Thank you for recognizing the Agent–VLA connection and same-state supervision. Our strongest evidence is improved task completion through request-conditioned selection with a frozen policy and matched candidate budget.
Q1. Value beyond generic reranking. Holding images, state, actions and request-matching targets fixed, providing the request raises SR from 40.79% to 51.27% (+10.48 pp). Candidate-dependent attention adds +8.73 pp over global pooling; ranking supervision adds +7.62 pp over classification alone. These ablations connect the effect target, visual evidence and selection objective to task success.
Supplementary prompt-conditioning and external-verification controls:
The ranker completes 21 more episodes than direct language conditioning and 19 more than Random. CoVer provides an independent verification reference using its public Bridge-trained scorer, with action/gripper conversion and history adaptation. Its result concerns that transferred component; the table does not establish statistical equivalence between scorers.
These rows share geometry requests, frozen pi05_libero, K=4, H=5, 1.5 cm thresholds and 30 episodes/task. The main study uses Qwen requests, 1 cm thresholds and 70 episodes/task. Comparisons remain within their respective protocols.
The contribution is a testable intermediate physical objective, linked to candidate evaluation through executed outcomes. A request-blind progress scorer instead targets any positive effect. A task-language value critic and VLMPC constitute different controls; the reported experiments do not establish superiority over those untested alternatives. The controlled request ablation directly supports the specific benefit of supplying the requested effect.
Q2. Role of the requester. Qwen generates requests from task language, two-round global/wrist images and robot state. A conventional, simulator-privileged geometry requester reaches 49.63% with the frozen ranker, demonstrating compatibility with different request sources.
The 10.48 pp main-study request-ablation gap establishes the value of the request input. The Qwen and geometry SR values come from different protocols, so they do not isolate the benefit of model size. Our empirical claim concerns the interface; a same-input, same-label lightweight comparison would separately test the choice of requester.
Q3. Candidate coverage and behavior without a match. For a valid request, the learned selector executes the highest-scoring candidate and updates its observation after five controls. If the pool contains no matching candidate, this relative-ranking rule still applies; scores are not used as calibrated rejection probabilities.
The last column is 100% minus coverage on the corresponding evaluated pools. Coverage bounds selector Hit when states, requests, candidates and label rules coincide; it is not a cross-trajectory success bound.
An independent 452-pool geometry diagnostic evaluates feasible-pool detection using the maximum ranker score. AUROC is 0.681 pooled and 0.548/0.891/0.762/0.667 by stage, with 336/60/45/11 pools. These measurements characterize stage-dependent discrimination, including the near-chance approach value and small placement sample. The deployed mechanism uses relative ranking; no validated feasibility-rejection threshold is assumed.
Scope and practical value. Ours improves over compute-matched Random on all nine simulation tasks (+48/630 successes) and all four robot objects (+14/120). These results support execution-time coordination for the evaluated grasping/placement tasks and real-world adaptation; the four effects are not claimed to cover every manipulation domain.
We hope the controlled ablations, independent comparisons and explicit coverage analysis address your questions, and would be grateful if you would consider raising your score.