- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
Vision–language–action (VLA) policies with billions of parameters are too costly to run on a mobile robot's own hardware and add communication and inference delay when queried from a remote server. The authors propose VLA-ULAP, which leaves the VLA unchanged on the server and lets a small on-device predictor, trained by behavior cloning on task demonstrations or on successful rollouts of the VLA, take a fixed fraction of the action-chunk decisions from fresh camera observations and proprioception. The claimed contributions are the split-inference framework itself, a reduction in server queries of roughly half to three quarters at small or no loss in task success across simulated benchmarks and two physical tasks, improved success over the base policy when VLA inference is delayed, and an estimated reduction in per-episode inference time and energy derived from separately profiled per-call costs.
Critical strengths
-
The question is relevant to deployment of large robot policies: whether a small onboard model that reads fresh observations can take over a fraction of the decisions of a large remote policy. The method requires no access to VLA internals, and the authors apply it to six base policies with different action heads (GR00T N1.7, VLA-JEPA, Cosmos-Policy, X-VLA, , and SmolVLA in Appendix E).
-
The simulation protocol is careful. Training and evaluation initial states are disjoint (with an explicit audit for VLA-JEPA and LIBERO-Safety), call reduction in simulation is counted over all episodes including failures, full sweeps over are shown rather than single operating points, and per-suite, per-task, and per-depth results are reported (Figures 12–15). The authors also report a negative result (adaptive scheduling gives no consistent gain, Appendix D) and design ablations on the state branch, action history, backbone scale, and token pooling (Appendix C).
-
The comparisons in Figure 7 and Appendix E address the main alternatives for reducing VLA calls: a different local model under the same schedule and corpus (ACT), action extrapolation without fresh observations (SP-VLA), standalone retrieval (RT-Cache), and longer open-loop execution of each VLA chunk (SmolVLA). ULAP gives the best observed success–cost frontier against all four.
Critical weaknesses
-
The latency and onboard-energy trade-off that motivates the paper is not measured. The abstract and Figure 1 frame the problem as remote inference adding communication delay and onboard inference draining the battery, but apart from separate per-call profiles of each policy on an RTX A6000 and of ULAP on a Jetson Orin Nano, the experiments measure neither communication delay and energy, nor the robot's energy per episode, nor the cost of onboard VLA inference. Execution in Sections 4.1–4.3 is synchronous. Section 4.5 is presented as the one experiment in which the simulator keeps stepping during a modeled VLA delay, which implies that elsewhere it does not, and physical control is synchronous at a target 30 Hz while GR00T's profiled per-call latency is 289 ms (Appendix B.5). The success curves in Figures 3–9 are therefore independent of latency, and only the number of VLA calls is measured. The time and energy per successful episode in Figures 1 and 10 are computed afterward as call counts multiplied by separately profiled per-call costs, and the authors state that camera acquisition, communication, and queueing are outside the estimate (Appendix B.5). Communication is the cost the paper attributes to remote inference in its first paragraph. The energy metric also sums idle-subtracted A6000 board energy with Jetson module energy. Of the 209.2 J per successful Ping-pong episode reported for VLA-ULAP, 207.6 J (5.13 calls × 40.46 J) is server GPU energy and about 1.6 J is onboard compute. The reported 70–72% energy reduction is thus a reduction in server GPU energy proportional to the call count. This is a valid measure of server load, but it is not the onboard energy named in the paper's central question. On the robot, remote-only inference spends radio energy on each call (excluded) and no compute energy, while VLA-ULAP adds about 1.6 J of compute per episode and spends radio energy on fewer calls. The paper's own reading of Huang et al. (2025) puts Wi-Fi image transfer at hundreds of millijoules per frame, the same order as or larger than the 0.122 J per ULAP inference, so the onboard comparison depends on the excluded term. In addition, the physical rollouts ran ULAP on an Apple GPU (Mac MPS) rather than the Jetson (Section 4.4), and the onboard-VLA alternative in Figure 1(b) is not evaluated. The paper argues against onboard inference with the naive latency of 457.9 ms on Jetson Thor quoted from Yang et al. (2026), a work whose stated contribution is onboard real-time control through asynchronous inference, while a vendor tutorial page reports 54 ms per inference on the same module with TensorRT FP8, and 49 ms with FP8 and NVFP4 [e], under two control periods at 30 Hz. To support the claims, the authors would need to measure onboard energy (Jetson module power plus radio power) and wall-clock episode duration over a real wireless link for remote-only VLA, VLA-ULAP, and an onboard VLA baseline.
-
The latency-aware experiment (Section 4.5) is the only test of the "more responsive control" benefit, and its design limits what it can show. First, the two tasks were "selected by an earlier latency sweep over the suite's five tasks" (Appendix B.6), so the tasks were chosen on the effect being tested; results on all five obstacle-avoidance tasks are needed. Second, the three-step delay corresponds to inference on a local A6000 (147.5 ms) with no network, whereas a remote deployment adds round-trip time and jitter; a sweep over delay would show how the gain behaves at the delays that motivate the paper. Third, the baseline uses the naive asynchronous strategy (continue the previous chunk during the delay, then skip the elapsed prefix of the new chunk). The paper cites recent asynchronous and cloud–edge VLA preprints (Yang et al., 2026; Peng et al., 2026), but it neither cites nor compares with established methods for executing action chunks under inference delay [a] or for combining delayed remote predictions with fresh on-device observations [c]. Fourth, the protocol in Appendix B.6 issues each VLA request before the current interval ends. A five-action ULAP chunk has no actions beyond its fifth step, so avoiding a three-step stall requires issuing the next VLA request three steps before the ULAP chunk ends, which conditions the VLA on an observation three steps old and requires the schedule to be known three steps in advance. The fixed schedule provides this, but a boundary-time scheduler such as the one in Appendix D, which was evaluated only at zero delay, could not issue an unscheduled VLA call under delay without a three-step stall; the compatibility of the framework with adaptive scheduling under delay is therefore untested. Two controls are also missing: with zero delay, which bounds how much success the delay costs, and ULAP under the same protocol both after one initial VLA call () and with no VLA call at all, the standalone protocol applied to RT-Cache in Section 4.2. ULAP for this experiment is trained on the 70% training splits (about 258 and 293 episodes) of 368 and 418 successful rollouts of the same two tasks, so without the local-only results it is not possible to attribute the gain to responsiveness rather than to a task-specific student.
-
The paper presents its first contribution as a split inference framework and contrasts it with model-internal partitioning (HiRT) and recent VLA acceleration methods, but overlooks established work on partitioning inference between devices and servers and on remote inference delay. This includes offloading and partitioning decisions between mobile devices and the cloud [b], split computing and early exiting [d], real-time execution of action chunks under inference delay [a], and on-device correction of delayed remote predictions [c]. The binary per-chunk choice discards the remote model's output during local decisions, except through the executed-action history, and that history no longer contains VLA actions after the first local chunk in a run of consecutive local decisions. At least four of the base policies compute actions beyond the executed prefix (GR00T computes 40 and returns 16, Cosmos-Policy generates 32 and executes 16, generates 10 and executes 5, SmolVLA generates 50 and executes 20), and those actions are discarded. Conditioning ULAP on the most recent VLA chunk, including its unexecuted tail, would add no communication and is the natural alternative to binary switching [c]; the authors should compare against it or explain why it is excluded.
-
The retention metric understates the cost of bypass near saturation, and the evaluated distributions leave the VLA's contribution unclear. On LIBERO with GR00T, 88.50% success at 95.0% retention means the failure rate rises from 6.85% to 11.50%, a factor of 1.7; with VLA-JEPA, 95.35% at 96.5% retention means failures rise from about 1.2% to 4.65%, a factor of about 3.9. Failure rates, or success with confidence intervals, should accompany retention. At , where the only VLA call is the first chunk, ULAP reaches 78.2% on LIBERO with GR00T and about 89% with VLA-JEPA, and roughly 92–94% on the Spatial, Object, and Goal suites (Figure 13). On these suites, a predictor with 1.9M trainable parameters, trained on successful rollouts collected from 100 attempts per task under the same initial-state distribution, solves most episodes without the VLA, so the call reduction there mainly reflects how closely training matches evaluation. The settings that require the VLA show smaller reductions: RoboCasa with held-out objects falls to about 42–45% success at (baseline 65.75%), CALVIN falls to about 22% (baseline 69.0%), and both retain about 98% of baseline success at 45–49% call reduction. On the physical robot, ULAP is trained on 80 of the same 100 demonstrations used to fine-tune GR00T. The ensemble at exceeds GR00T at the training placements on Ping-pong (48/50 versus 41/50), while the single predictor at reaches 40/50 (Table 3). Because failed physical runs were stopped early, the physical call reduction is computed per successful episode (Appendix B.5), over different subsets of trials for the two policies, and the number of trials discarded and recollected after infrastructure failures is not reported. Table 3 stops at and Table 1 at ; no result with one initial VLA call, with no VLA call, or with ACT alone is reported on the robot or in the latency-aware experiment, so success cannot be attributed to the VLA calls. Finally, ULAP is trained on rollouts or demonstrations of the evaluated tasks: the CALVIN and RoboCasa predictors transfer to a new environment and to held-out objects, but no experiment tests tasks or instructions absent from ULAP training, and the paper notes that its physical OOD condition covers "unseen object placements, not unseen object categories or tasks" (Appendix B.5). Generalization to new tasks without task-specific data is the main reason to deploy a VLA, so this limitation should be stated and tested.
-
The authors withhold the source code, the trained ULAP checkpoints, and the rollout datasets used to train them. The submission has no supplementary material, the manuscript has no anonymous repository link, and the reproducibility statement does not commit to a release. This prevents verification of the delay-injection logic in Appendix B.6, the scheduler, and the cost reconstruction in Appendix B.5. Since the code will not fit into the rebuttal text, the authors should provide it through an anonymous repository (e.g., https://anonymous.4open.science) during the rebuttal period.
References:
[a] Black et al., "Real-Time Execution of Action Chunking Flow Policies," NeurIPS 2025.
[b] Kang et al., "Neurosurgeon: Collaborative Intelligence Between the Cloud and Mobile Edge," ASPLOS 2017.
[c] Jacobellis et al., "DeDelayed: Deleting Remote Inference Delay via On-Device Correction," CVPR 2026.
[d] Matsubara et al., "Split Computing and Early Exiting for Deep Learning Applications: Survey and Research Challenges," ACM Computing Surveys, 2022.
[e] NVIDIA Jetson AI Lab, "OpenPI on Thor," https://www.jetson-ai-lab.com/tutorials/openpi_on_thor/
Questions for authors
-
What are the onboard energy per successful episode (Jetson module power plus radio power during observation upload and action download) and the wall-clock episode duration for remote-only GR00T and for VLA-ULAP when ULAP runs on the Jetson and the VLA is reached over a wireless link? In the physical trials, was GR00T reached over a network, and if so, which link and what round-trip time?
-
What are the LIBERO-Safety results on all five obstacle-avoidance tasks, and how do they change with at zero delay, ULAP after one initial VLA call (), ULAP with no VLA call, a real-time chunk-execution baseline such as [a], and VLA delays longer than three control steps?
-
In Appendix B.6, when the decision preceding a VLA call is a five-action ULAP chunk, at which step is the VLA request issued, and on which observation is it conditioned? How could a boundary-time adaptive scheduler such as the one in Appendix D issue an unscheduled VLA call under delay without a three-step stall?
-
What success does ULAP after one initial VLA call () and with no VLA call achieve on the two SO-101 tasks, and what does ACT trained on the same 80 demonstrations achieve?
-
Have the authors tried conditioning ULAP on the most recent VLA chunk, including the actions the VLA computed beyond the executed prefix? If so, how does it compare with binary switching?
-
How does VLA-ULAP perform on tasks or instructions for which no ULAP training data was collected, for example a LIBERO task held out from ULAP training?
-
Will the authors provide an anonymous repository with the training, evaluation, delay-injection, and cost-reconstruction code during the rebuttal period?
9 comments
Response to Reviewer Hctg (2/3)
Q3 — Request timing and adaptive scheduling
In the original three-step protocol, we issued the next VLA request after two actions of the five-action ULAP interval, using the observation at that time. In the revised five-step protocol, the request is issued at the start of the ULAP interval, before its first action. The environment continues executing the active chunk; the elapsed prefix of the arriving prediction is discarded. ULAP's one-step delay is handled by requesting it one step before the switch (Appendix B.7).
This uses a fixed schedule. Boundary-time adaptive requests require waiting or fallback if buffered actions run out; Appendix D does not establish stall-free adaptive scheduling under delay.
Q4 — Physical one-call, zero-call, and ACT controls
With recurring VLA calls, VLA-ULAP achieves 67/75 successes on Glue-stick and 62/75 on Ping-pong, compared with 57/75 and 58/75 when the VLA supplies only the first chunk, and 63/75 and 58/75 for VLA-only (§4.3, Table 3). On held-out Ping-pong placements, recurring calls improve success from 13/25 to 20/25, supporting continued VLA intervention for transfer to new placements (Appendix B.5).
We have not evaluated SO-101 control with zero VLA calls. At ρ=1, the VLA supplies only the first 16 actions; across Glue-stick trials this gives 75 VLA calls and 2,070 local decisions. Due to time constraints, we have not completed the same-demonstration SO-101 ACT comparison. Existing ACT controls cover VLA-JEPA/LIBERO (§4.2) and the same Safety training data (§4.4), but do not replace a physical ACT comparison.
Q5 — Conditioning on the latest VLA chunk
Thank you for this suggestion. In response, we tested whether supplying the latest received VLA chunk, including its unexecuted actions, improves ULAP on RoboCasa. We append individual action tokens with source and relative-time information and compare against our default VLA-ULAP method, which does not receive these additional tokens, and a control that retains the tokens but zeros their action values.
With recent-chunk training and alternating execution (ρ=0.5), each ULAP decision immediately follows a VLA decision, so future actions remain in the received chunk. The action-token model achieves 786/1,200 successes, versus 769/1,200 for default VLA-ULAP and 725/1,200 for the zero-content control. The gains are +1.42 percentage points (95% CI [−0.67, 3.33]) and +5.08 points [2.58, 7.50], respectively: a modest observed gain over the default and a larger observed difference from zero-content tokens. Each token variant uses one training seed, so these intervals capture evaluation-state variability rather than training variability; a training-seed contribution to the difference remains possible.
We also trained each model once on a mixture of recent and older chunks, covering both alternating execution and consecutive ULAP decisions, then evaluated at ρ=0.5 and 0.8. Action tokens show no consistent advantage over the zero-content control and only small differences from default VLA-ULAP. Thus, a fresh VLA chunk can help the immediately following local decision, but this benefit does not consistently extend to repeated local decisions as the chunk ages. These results support retaining our default method without additional received-action inputs (Appendix C.4, Table 22).
Q6 — Tasks without ULAP training data
We added two splits, each excluding two tasks from each of two LIBERO suites from local training and checkpoint selection. At ρ=0.5, successes are 193/200 versus 198/200 for VLA-only on Goal/Spatial, and 195/200 versus 197/200 on Object/LIBERO-Long, with 42.1% and 47.6% fewer VLA calls. Paired differences are −2.5 points (95% CI [−5.5, 0.5]) and −1.0 point [−3.5, 1.5]. This supports task transfer with recurring VLA intervention; consecutive local chunks substantially reduce success (§4.1, Table 2; Appendix B.2.1).
We also compare against a simple action-history extrapolation baseline (Ridge), which predicts the next action chunk from the previous seven executed actions, under the same alternating VLA schedule. VLA-ULAP achieves 194/200 versus 164/200 successes on Goal/Spatial in a paired re-evaluation, and 195/200 versus 189/200 on Object/LIBERO-Long, with fewer VLA calls on both splits.
Q7 — Anonymous artifacts
We released training/evaluation code, ULAP weights and configurations for GR00T × all four LIBERO suites and π0.5 × LIBERO-Safety with ten-action prediction chunks, including the delay-injection executor. The physical measurement protocol provides timing boundaries, energy-integration equations and Python reconstruction examples (Reproducibility Statement).
Response to Reviewer Hctg (3/3)
Additional weaknesses — Related work, measurement scope, and reporting
Section 2 and Appendix A now discuss Neurosurgeon, split computing/early exiting, DeDelayed and RTC. Our contribution is independent local action prediction between VLA decisions, rather than model-layer partitioning or delayed-feature fusion. We added both RTC and received-plan controls.
We agree that optimized embedded deployment can make onboard VLA inference practical on higher-power modules such as Thor; we do not compare against that implementation. Our target is inexpensive, low-power devices unable to host the evaluated base VLA. The onboard A6000 point in Figure 9 is a same-checkpoint reference reconstructed from local replay, not an embedded-VLA baseline (Appendix B.5).
Using your failure-rate-ratio metric on development-selected operating points confirmed on new states, the hybrid/VLA-only ratios are 1.34 for GR00T (156 versus 116 failures out of 2,000), 1.61 for VLA-JEPA (61 versus 38/2,000), 1.01 for RoboCasa (449 versus 445/1,200), and 1.04 for CALVIN (330 versus 316/1,000). Absolute success-rate decreases are 0.3–2.0 points. Section 4.1 and Appendix B.6 report the corresponding paired intervals alongside retention. The ρ=1 endpoint retains the initial VLA call. The physical evaluation uses shared demonstrations (80/10/10 for ULAP) and distinguishes held-out placements from new tasks. Across both physical tasks, 16 attempts were excluded and repeated (nine for Glue-stick and seven for Ping-pong); ordinary task failures, including collisions, and timeouts remain in the evaluation. We report costs including all failed trials and separately compare time and energy on matched trials where both methods succeed (§4.3; Appendix B.5).
Response to Reviewer Hctg (1/3)
Thank you for the detailed suggestions. We added the following measurements, controls, and artifacts.
Q1 — Physical network, onboard energy, and episode duration
Thank you for requesting measurements that more closely reflect the intended deployment. In response, we integrated ULAP into the physical control loop on a Jetson Orin Nano and measured latency and onboard energy. Because institutional security restrictions prevent a direct Jetson–server Wi-Fi connection, we used USB Ethernet to a Mac SSH relay with a Wi-Fi uplink. The transport/RPC residuals are 165.8/167.1 ms for Glue-stick and 175.9/178.9 ms for Ping-pong (VLA-only/hybrid VLA requests), averaging episode means over all 75 trials per condition. These residuals are calculated by subtracting measured server processing time from measured client RPC round-trip time. They include network transfer, relay, and RPC overhead outside the server timer, rather than pure network RTT (Appendix B.5; Table 15 gives the Glue-stick breakdown). Averaging equally across Glue-stick and Ping-pong, using the 56 and 49 pairs respectively completed by both methods, mean decision latency decreases from 534.9 to 182.3 ms (65.9%), time to success from 19.61 to 13.81 s (29.6%), and measured Jetson module energy from 130.6 to 94.2 J per episode (27.9%) (§4.3; Appendix B.5).
To address the intended direct-Wi-Fi deployment as fully as possible within this constraint, we also constructed latency and energy estimates from measured components. The reconstruction uses measured compute, losslessly compressed observations, 100 Mbps goodput, a 4.28 ms laptop–server RTT proxy, and transmit/receive/idle radio power. The 4.28 ms value is a laptop–server RTT proxy, not a directly measured Jetson–server Wi-Fi RTT. Under these common deployment assumptions, estimated robot-side energy decreases from 138.7 to 104.4 J per successful Glue-stick episode and from 129.3 to 94.3 J on Ping-pong (revised Figure 9; Appendix B.5). Varying goodput over 50–200 Mbps preserves the estimated onboard-energy advantage on both tasks (Appendix B.5, Table 17). Actions and outcomes are held fixed in these retrospective estimates.
Q2 — Complete Safety suite and additional controls
We now evaluate all five L1 tasks on 200 fresh paired initial states per task. The earlier delay setting accounted for model inference but omitted communication between the robot and server and other deployment overheads. We therefore use fixed VLA/local delays of five/one steps, informed by measured computation and deployment overheads together with a direct-Wi-Fi transfer estimate. All counts below are successes out of 1,000 trials.
Faster local responses improve task success. Holding the predictor, alternating schedule and VLA delay fixed, reducing ULAP delay from five to one step raises success rate by 7.0 percentage points (95% CI [4.3, 9.7]). At equal five-step delays, VLA-ULAP and VLA-only have similar success rates (+0.5 points, 95% CI [−2.4, 3.4]). Together, these controls support a benefit from faster local responses beyond introducing the task-trained predictor alone.
With one-step ULAP responses, VLA-ULAP reaches 825/1,000 successes versus 750/1,000 for delayed VLA-only, approaching zero-delay VLA's 828/1,000 while making 53.0% fewer VLA calls. Thus, it recovers most of the success rate lost to delay while reducing remote inference (§4.4, Figure 10; Appendix B.7).
At the evaluated RTC boundary, the five directly weighted overlap actions lie in the elapsed prefix of the ten-action prediction, and execution starts at action six. Guidance can still affect the executed suffix through the coupled denoiser. This may limit the overlap benefit, but the experiment does not isolate why RTC underperforms here or imply that RTC is generally ineffective.
Local-only ULAP performs strongly in aggregate on these known tasks, but the benefit of recurring VLA intervention varies by task. For example, on Book, the hybrid achieves 179/200 successes versus 152/200 for local-only ULAP.