- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper aims to address inference cost in dual-system VLAs, where the VLM backbone dominates per-call latency. The authors proposes Latent Bridge, a small DiT that predicts changes in the representations consumed by their action heads between consecutive inference calls. It predicts feature deltas for GR00T and per-layer, pre-RoPE KV deltas for with supervised training followed by DAgger refinement. Longer-horizon GR00T tasks additionally use action-head LoRA and adaptive refresh scheduling. On LIBERO, RoboCasa and ALOHA-sim report 95-100% average success retention with 50-75% fewer backbone calls and a 1.55-1.73× net episode speedup.
Critical strengths
-
Predicting the full per-layer KV interface rather than only a final feature tensor makes the result useful. The large improvement over matched period stale reuse in Table 1 validates the value of learned prediction beyond simply reducing VLM frequency.
-
Speedup is reported as wall-clock with an episode-length correction and per-component latencies, and the weak pruning baselines are explained by an Amdahl argument.
Critical weaknesses
-
Appendix H uses an identical refresh mask at every layer and describes savings as limited to K/V projections, but the original VLA-Cache includes task-relevant token exclusion and layer-adaptive reuse and its default similarity threshold is 0.996 instead of the 0.90 criterion described here. Its applicability is not limited to single-system architectures since it also evaluates CogACT. These differences may affect both success and latency.
-
Section 4.1 calculates speedup from inference latency multiplied by mean successful episode length, which means it measures episode inference compute but not the demonstrated end-to-end robot completion time (it excludes failures and physical execution time).
Questions for authors
-
How does each bridge behave when the scene is perturbed between VLM calls (e.g., the target object is displaced)?
-
For GR00T LIBERO-10, what are the speed and success of scheduling alone, caching with the same action-head adaptation, and the full bridge under matched refresh schedules? I'm curious about how much benefit comes from delta prediction.
7 comments
Q1: scene perturbed between VLM calls. The two instantiations differ. The π0.5 bridge runs SigLIP on every step and takes the embedding difference as input, so a displaced object changes the bridge input immediately; on held-out real streams its advantage over stale reuse grows with motion, from +0.002 cosine in the slowest tercile to +0.012 in the fastest (Appendix K). The GR00T bridge has no fresh vision on bridge steps: it predicts from the last features, state and previous action, so a displacement is seen at the next backbone call, at most f−1 calls later. In both cases the exposure is bounded by f. We ran this test on π0.5 (LIBERO-Goal, f=4, 3 seeds × 20 episodes per task): before the sixth policy call, a bridge step, a movable task object is displaced by 3 cm in a random horizontal direction, identically for every method. Sync reaches 91.5%, the bridge 90.3% and stale reuse 30.8% (97.0 / 97.3 / 68.8 without the displacement, Table 1). The bridge sees the displaced object on the same call; stale reuse acts on pre-displacement features for three more calls (Appendix F).
Q2: GR00T LIBERO-10 decomposition. We ran the two configurations the reviewer asks for, scheduling alone and caching with the same action-head adaptation. They were run on a second machine, so reference rows were re-run there and are shown next to the paper's values (3 seeds × 20 episodes per task; sync and bridge R1 at f=3: one seed).
| Configuration | VLM calls | SR, paper | SR, re-run |
|---|---|---|---|
| Sync | 100% | 93.00 | 95.0 |
| Stale reuse, f=3 | 33% | 42.33 | 9.8 |
| Stale reuse + LoRA, f=3 | 33% | – | 12.2 |
| Bridge R1, f=3 | 33% | 67.17 | 66.5 |
| Bridge R1 + LoRA, f=3 | 33% | 73.17 | – |
| Stale reuse, phase-aware | 40% | – | 27.3 |
| Stale reuse + LoRA, phase-aware | 39% | – | 30.7 |
| Bridge R1, phase-aware | 42% | 88.83 | – |
| Bridge R1 + LoRA, phase-aware | 42% | 89.17 | 84.0 |
Both columns give the same ordering, and the bridge is well above stale reuse at every matched setting. In the re-run:
- Scheduling alone lifts stale reuse from 9.8 to 27.3 at 40% of the calls.
- The same action-head adaptation adds 2–3 points to stale reuse under either schedule.
- The full bridge under the same schedule and adaptation reaches 84.0, +53 points over stale reuse (30.7); at fixed f=3 it is +54 points over stale reuse + LoRA (66.5 vs 12.2).
Per-step latency follows the call rate: 48–49 ms at f=3 and 52–55 ms under the phase-aware schedule for both methods, against 90 ms for sync (the bridge network adds 2 ms on skipped steps). On π0.5, which uses a fixed f=4 and no adaptation stage, the bridge reaches 93.67 on LIBERO-10 against 52.67 for stale reuse at the same call budget (Table 1).
Section 3 now states the text-token handling on π0.5 precisely: the text-token KV entries are zero-filled on bridge steps (they are carried over on GR00T), and the action expert reads the instruction through the image-token KV. A controlled replay shows the comparisons do not depend on this (action deviation from sync 0.277 vs 0.275 for stale reuse and 0.075 vs 0.063 for the bridge, zero-filled vs carried over; Appendix F), and no reported number changes.
Changes in the revised PDF.
- Appendix H: the faithful VLA-Cache port on π0.5 (components, success rates, token fractions, timing) in its own table; the threshold of the Table 1 port stated; the Table 1 footnote marks its rows as the simplified port.
- Section 3: the text-token handling on π0.5 corrected (text KV zero-filled on bridge steps; the action expert reads the instruction through the image-token KV).
- Section 4.1 and Table 1: the speedup defined as net inference-time speedup, per-call latency × calls per successful episode.
- Appendix F: the scene-perturbation test (object displaced on a bridge step; sync / stale reuse / bridge).
- Appendix F: GR00T LIBERO-10 with stale reuse under the phase-aware schedule and with the action-head LoRA, next to re-run reference rows.
- Related Work: Leap-VLA, Acting While Understanding and AC²-VLA cited.
- Figures 1–3 redrawn as vector figures in one style.
Dear Reviewer SMrF,
Thank you again for the constructive review.
As the discussion period closes today, we wanted to confirm that our rebuttal addresses your concerns. We are happy to expand any of the above if that would help the discussion. If we have resolved your issues, we sincerely hope that you can raise the rating score.
Best regards,
The authors
Dear Reviewer SMrF,
Thank you for the careful reading of Appendix H and of the speedup definition. A revised PDF is uploaded together with this response (changes listed at the end of Part 2/2). In brief:
W1: VLA-Cache adaptation. Appendix H is corrected on three points. (i) The port used for Table 1 is a simplified one: it uses the released static-patch selection, removes the selected tokens at the first pruning layer with a fixed reuse fraction, reads their K/V from the previous step, and ports neither task-relevant token exclusion nor the entropy-based per-layer schedule. (ii) Its cosine threshold is 0.90, chosen from a sweep over 0.95 / 0.90 / 0.80 (0.95 gave higher success with under 5% latency reduction); the released default is 0.996, which the faithful port below uses. (iii) VLA-Cache also evaluates CogACT.
To settle what these differences cost, we re-implemented VLA-Cache on π0.5 from the released code with all three components (static patches at the default threshold 0.996 with the two-view top-k of the released OpenVLA-OFT setting, task-relevant exclusion by the previous call's layer-15 text-to-vision attention, entropy-based per-layer reuse proportions, pruning at the released layers; text tokens never reused) and evaluated it on the same stack as sync (3 seeds × 20 episodes per task):
The faithful port loses no success rate (0.5 pp from sync, within seed noise) and gives no speedup: the exclusion and the entropy schedule reuse only a fraction of the 137–166 reusable tokens per call, so 94–95% of the prefix is still computed and the attention statistics the method needs cost more than the 5% it saves (1.18× sync per call on the same H200; per-step action deviation from sync 0.01). The simplified port reuses more and trades success for a 14% latency reduction. Either way the conclusion holds for a structural reason: a method that keeps the backbone on every step is bounded by the untouched action head (at most 1.33× per step on π0.5 even at the 1.7× VLA-Cache reports as its best), whereas the bridge skips the backbone call (1.55×). The revision reports both ports in Appendix H and marks the Table 1 row as the simplified port.
W2: what the speedup measures. The reviewer's reading is correct, and the revision says so: the metric is inference time per completed episode, per-call latency × calls per successful episode, now named net inference-time speedup. Physical execution time is set by the control rate and is common to all methods. Failed episodes run to the step cap under every method, so counting them would measure the cap; the metric charges the bridge for its longer successful episodes. With the GR00T schedule corrected and RoboCasa and ALOHA added, the net speedup is 1.47–1.67× across the four settings.