- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
Q-Transport introduces a mechanism for adapting pretrained flow-based VLA policies by learning critic-guided edits at intermediate flow states rather than modifying only the source noise or final generated action. The method performs well on the paper's five real-robot insertion/manipulation tasks, achieving 83.2% mean success rate versus 70.0% for the strongest competitor, and the real-world evaluation is a major strength. At the same time, the evidence for broad VLA adaptation is limited because the tasks occupy a relatively narrow contact-rich insertion regime, the implementation is computationally heavy, and success drops to only 18% under held-out initial configurations.
Critical strengths
Interesting and technically clean adaptation interface. Editing partially formed flow states exploits the pretrained model as a nonlinear transport operator rather than simply treating it as a frozen action generator.
Strong real-world results. Five physical manipulation tasks are evaluated, and Q-Transport outperforms the compared methods on every task by roughly 10–16 percentage points, averaging +13.2 points over the strongest competitor.
Practical ablations are useful. The paper demonstrates that critic-guided editing provides most of the improvement, quantifies the contribution of base-policy consolidation, and identifies four flow steps as a sensible computation/performance knee.
Critical weaknesses
Generalization remains poor. On held-out initial configurations, all systems degrade sharply and Q-Transport achieves only 18% success, despite outperforming baselines. This substantially qualifies the claim of robust task adaptation.
Computational demands are substantial. Training the π0.5-based methods uses eight A100 80GB GPUs plus another A100 for rollout collection, while inference evaluates multiple base and edited candidates through repeated flow evaluations. This makes the method less obviously attractive when the motivation includes efficient real-world adaptation.
The experimental scope is narrower than the VLA framing suggests. Flower insertion, cable insertion, charger insertion, and two USB insertion variants are all contact-rich manipulation/insertion problems with comparatively small pose variation. More semantically diverse and longer-horizon VLA tasks would be needed to support broader claims.
Questions for authors
See Weaknesses above.
Additionally:
How does this compare to continual learning results such as this one: CLARE: Continual Learning for Vision-Language-Action Models via Autonomous Adapter Routing and Expansion (2026)?
Can you further evaluate your method in broader simulation experiments to support the claims around the potential and the limitations of this work?
2 comments
Response to Reviewer VfFv (2/2)
W2. Computational Demands and Efficiency
The real-robot π0.5-based setup uses eight A100 80 GB GPUs for training and a separate A100 80 GB for rollout collection. Appendix A.5 and Table 4 separate approximately seven hours of shared data collection and SFT initialization from approximately two hours of online adaptation per task. The total budget is approximately nine hours when the shared initialization is charged to each method. QT and EXPO-FT both use 16 candidates for action selection and TD backups, whereas DSRL, SAC-Flow and HG-DAgger use one. Each QT edited candidate applies three successive corrections. During editor training, the value gradient passes through one frozen x-prediction per update, giving the short gradient path shown in Figure 5.
Table 4 reports range-derived latency estimates as midpoint ± half-width. The current configuration is estimated at 390 ± 80 ms per decision for QT and 375 ± 75 ms for EXPO-FT; after prefix de-duplication, the estimates are 120 ± 30 ms and 110 ± 30 ms, respectively. The table accounts for candidate counts and method-specific update quotas alongside these latency estimates.
Q1. Relation to CLARE and Continual Learning
CLARE [1] studies sequential task acquisition with adapter expansion and autonomous routing, retaining earlier skills while learning each new task. Q-Transport studies reward-guided adaptation within a task: it edits intermediate action states and uses replay to improve the task-conditioned flow policy. Each task is adapted separately from its task-specific initialization.
The two evaluation protocols measure different aspects of adaptation. CLARE evaluates new-task acquisition and retention across a task sequence. Our simulation evaluates learning progress and stability across checkpoints within each task; the FWT/NBT/AUC quantities in Appendix D are defined for that within-task protocol.
[1] Römer, Zhang, Li, and Schoellig. CLARE: Continual Learning for Vision-Language-Action Models via Autonomous Adapter Routing and Expansion. IEEE Robotics and Automation Letters, 2026.
Response to Reviewer VfFv (1/2)
We thank you for your constructive review. Revisions to the main manuscript are highlighted in orange. We add four supplementary real-robot tasks and four non-insertion simulation tasks, and below we clarify the precision-manipulation setting, SFT initialization, additional results, computational cost, and connection to continual learning.
W1 & Q2. Generalization and Scope
Why is SFT performance low?
We deliberately selected difficult, high-precision manipulation tasks for which demonstration-only training is difficult to bring to reliable autonomous convergence under the available data budget. Small errors in alignment or contact can cause task failure even when the overall motion resembles the demonstrations. With 25 human-demonstration episodes per task, offline SFT achieves a 2.0% mean success rate on the five original tasks. We therefore first use human-in-the-loop online BC to establish a stronger common initialization, reaching 37.2% mean success. All compared online adaptation methods start from this task-specific BC checkpoint; QT then reaches 83.2%, compared with 70.0% for EXPO-FT (Section 4.1; Table 1). These results show the benefit of online adaptation beyond the shared BC initialization.
Broader real-robot task coverage
Appendix B.4 adds bottle placement in an open drawer, cup placement on a coaster, bottle-opener hanging, and bimanual sweeping. Each method is evaluated over 50 autonomous trials per task, with training seed 42. Table 7 reports the following success rates (%):
QT achieves the highest four-task mean, 71.5%, compared with 65.5% for HG-DAgger and 65.0% for EXPO-FT. These experiments cover four additional task families on the same robot platform. The drawer task evaluates bottle placement in an already-open drawer, with QT refining the placement phase.
Broader simulation evaluation
We added RoboTwin 2.0 (SAPIEN) experiments on stamp_seal, place_a2b_left, stack_blocks_two, and hanging_mug, covering precision placement, relative placement, stacking, and hanging. Appendix D specifies the same π0.5-based observation/action interface and task-specific SFT initialization for QT, EXPO, DSRL, and SAC-Flow. The protocol uses three training seeds per task and method (48 RL units), 100 paired evaluation seeds per task, and 11 checkpoints. The online training budget is 1,020 updates and 340 episodes (Table 12). Table 13 reports the following four-task mean success rates at step-1020:
At step-1020, QT achieves 71.0% mean success, compared with 65.0% for EXPO, 51.3% for DSRL, and 40.0% for SAC-Flow. QT improves on EXPO by 6.0 percentage points. The paired SFT baseline for this RL protocol averages 38.8%; its stamp_seal baseline is 20% (Table 13).
Evaluation setting
These additions extend the evaluation beyond the original insertion tasks. The real-robot experiments measure adaptation to each task’s nominal setup; success on held-out initial configurations is 18% (Section 4.4). The simulation evaluates precision-critical key stages from scripted initial states, with fixed scene appearance and expert-feasible seeds for one selected arm per task.