- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
RAVEL adapts pretrained flow-based VLAs to asynchronous control. It maintains a rolling buffer with position-dependent noise levels, progressively refines future actions, and releases one buffer slot per action-expert update. VLM encoding runs independently; the expert receives the latest available semantic context and its temporal offset. An optional Fast Observation Pathway (FOP) supplies current visual and proprioceptive features. Training pairs older observations with shifted action horizons and matches the rolling noise profile. Evaluation covers LIBERO, RoboTwin, DOM, and two physical tasks.
Critical strengths
- The framework addresses a practical bottleneck and is demonstrated on multiple pretrained backbones. Median first-action latency decreases by 2.59x for X-VLA and 2.92x for pi0.5 while synchronous benchmark performance is largely preserved.
- Explicit context-age conditioning is a useful, identifiable addition. With the checkpoint and runtime fixed, using the correct offset achieves 44.89% DOM success versus 16.67% when the offset is reset upon receiving new context.
- Dynamic results are promising: RAVEL reaches 44.06% DOM success versus 35.50% for the best listed baseline, with FOP increasing this to 46.94%. The appendices explain implementation choices, training, and timing limitations.
Critical weaknesses
- The broad architectural novelty is limited. HiRT already combines a low-frequency VLM, a high-frequency visual policy, asynchronous reuse of semantic features, and training with older visual inputs (HiRT, Secs. 3.2-3.3; CoRL 2024). Thus, decoupling perception from control, bypassing the VLM with current visual features, and training for stale context are established ideas. RAVEL's stronger candidate contribution is their integration with rolling flow inference and explicit temporal-offset conditioning. The related-work discussion does not sufficiently explain what new knowledge this integration establishes.
- The experiments do not isolate this candidate contribution against a conventional fast/slow architecture using the same backbone. Sec. 4.4 holds rolling inference fixed and ablates its training components; the DOM FOP comparison only establishes FOP's incremental benefit within RAVEL. Neither tests asynchronous context reuse plus current-observation conditioning without rolling, or rolling with synchronous context updates, under comparable adaptation.
- Empirical attribution remains uncertain. DOM variants use different training scopes, batch sizes, and checkpoint-selection procedures (App. A.2); synchronous baselines do not receive equivalent extra adaptation (App. A.1). More training steps alone do not imply more data exposure. In table tennis, RAVEL additionally uses a tuned offset bias of 0.3, corresponding to 100 ms of lookahead for physical tracking lag. Equivalent execution-delay calibration for competing methods is not reported (Secs. 4.3-4.4; App. B.4).
- Real-world evidence is narrow: 20 trials per method on one robot, and grasping success equals naive asynchronous inference at 45%. DOM's completion-time comparison uses only 36 episodes successful for all six methods, rather than the full 1,800-episode benchmark. These limitations temper claims of broad practical superiority.
Questions for authors
- On one existing dynamic benchmark, can you compare asynchronous context reuse plus FOP with conventional full-chunk denoising against the rolling variant, using comparable data exposure and adaptation? A rolling variant with synchronous context updates would further clarify the two mechanisms' interaction.