- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 3(+2)
Read review
Paper summary
In the robot execution of generated action chunks, this paper proposes a method called frequency-prefix execution, which transmits only low-frequency parts of chunks. Experimentally, this method archived a comparable success rate to sending full action chunks, while reducing payload, in LIBERO benchmark tasks.
update: The authors also propose PAIRGAP, an algorithm to determine which transmittion of actions can be reduced while maintaining success rate.
Critical strengths
A sufficient quantity of experiments has been conducted.
Critical weaknesses
The motivation is unclear:
- If reducing communication cost is the objective, various prior works aimed at compressing the data to be transmitted, not limited to robot execution, should be taken into consideration. Experimental results should be compared to existing approaches. The fact that the success rate did not decrease may mean only that tasks are achievable even if actions are roughly approximated.
- If the effect itself of limiting frequency of action chunks is the research topic, the authors should explain why this is important.
update: After update of the paper, practical effectivitiy of FPE, the proposed method, is experimentally validated. Thus, this issue is resolved. However, I'm hesitant to raise the rating significantly. While FPE is practical, it is questionable that it has sufficient impact when considering its fit to the field of the conference and its novelty. I know that subject areas of ICLR are not restricted to Representation Learning, but this paper is peripheral to VLA research and its results are not so much surprising. As a robotics research, it would be better to conduct a real-world experiment.
Also, there exist several points I did not understand. See questions for authors.
update: After discussion, I managed to understand the role of PAIRGAP. Howeover, the same question as the second weakness in the review by Reviewer 25AU raises. If the intention is to deploy the planned reduction in transmission to the real robots after computing the certificates on the simulator, it is necessary to verify that this actually works through experiments using the real robots.
Questions for authors
- I did not quite understand the connection of Section 4 to the other parts of this paper.
- Also, I did not understand the Section 5.5 and how to read Figure 6.
- What is the single-decision test?
- What does mean "Time prefix" row in Table 1?
6 comments
Response to Reviewer A4Sh (2/2)
W3: If the effect itself of limiting frequency of action chunks is the research topic, the authors should explain why this is important.
Answer: The original submission states the question in the first sentence of its abstract (lines 011–013), "how much of a chunk a robot needs to finish its task has remained unmeasured in closed loop". Its introduction (lines 039–044) gives the reason and concludes "Closeness of reconstruction and success on the task are therefore separate questions, and the second one has not been measured under a fixed execution protocol." The question matters for three reasons.
-
Reconstruction error does not predict task success. Existing VLA action codes are judged by how closely they reproduce a chunk offline. A robot acts in closed loop, where each small deviation changes the next camera image and the next prediction, so success has to be measured on whole episodes. Across the 20 OpenVLA-OFT Spatial and Goal tasks, the energy that two rows drop shows no rank correlation with the change in task success (Spearman ρ = 0.05).
-
The result is directly usable. Without any retraining, two cosine rows keep task success on Spatial, Object and Goal, and four rows keep it on LIBERO-10, on released OpenVLA-OFT and π0.5 checkpoints.
-
Frequency truncation saves bits without extra policy calls. The familiar way to send less per call is to execute fewer steps of each chunk, and it forces the robot to query the policy more often. On LIBERO-10, executing four of eight steps per call requires 2.15 times the policy calls and loses 5.6 points of success, and four cosine rows keep task success at the native call count.
Q1 & Q2: I did not quite understand the connection of Section 4 to the other parts of this paper. Also, I did not understand the Section 5.5 and how to read Figure 6.
Answer: Section 3 uses one row count for a whole episode, Section 4 asks the same question at one state, and Section 5.5 with Figure 6 measures what an answer at one state costs. The link is the result of Section 5.2, where two rows keep task success on Spatial and miss the test on LIBERO-10. One row count for a whole episode therefore sends too many bits at easy states or too few at hard ones, and Section 4 sets the row count state by state. Section 4 opens (lines 238–240) with "The every-chunk scheme of Section 3 holds one row count for a whole episode, and the cost of a prefix depends on the state the robot occupies. A controller that faces one state at a time benefits from a bound on the regret of executing a prefix there." Figure 6's caption (lines 466–467) reads "(A) One chunk, every depth, as success change against the full code. (B) What a certificate costs at tolerance 0.10." Panel A plots "Success change (pp)" against "Payload (bits)", so a point on the zero line is a prefix that matches the full code. Panel B plots "Certified states (of 8)" against "Rollouts per decision" for five certification rules, so a rule that sits higher certifies more states with the same number of rollouts.
Q3: What is the single-decision test?
Answer: It isolates the closed-loop effect of a single truncated chunk. Section 5.1 (lines 290–291) defines "the single-decision tests, which restore a state, truncate its first chunk, and resume the standard policy".
Q4: What does mean "Time prefix" row in Table 1?
Answer: It is the time-truncation control. Section 3.1 (line 146) defines it in one sentence, "The time-truncation control executes the leading d steps before replanning." Table 1 sets d = 4 and Figure 1B draws this schedule, in which the robot executes 4 of the 8 predicted steps and then calls the policy again. The revised Table 1 labels the row "Time truncation", the name the text and Figure 1B use.
We're happy to address any further valid and substantive questions you may have.
Thank you for your detailed response!
Table 22 is what I wanted to see. If I may make one more suggestion, I think these results should be extended to two-dimensional graphs for various bit lengths as Figure 4(a). The important thing is a tradeoff of communication cost and success rate, and I want to see the curves of success rate with respect to communication cost. In addition to various k values for FRE, the results for various number of waypoints and various quantization step size will provide more informative evidence of effectiveness.
Response to Reviewer A4Sh (1/2)
Thanks for your review. Here are the replies. Line and figure numbers refer to the original submission, and Tables 22 to 28 refer to the revised PDF.
Answer: The original submission already compares FPE with the standard compression of VLA action chunks. Section 5.4.1 (lines 428–430) reads "Priced at 11 bits per token of the released FAST+ vocabulary, a two-row prefix saves 22% of the full LaRA-VLA stream". FAST+ is the action tokenizer of current VLA policies, and it applies the two standard steps of data compression, a discrete cosine transform followed by entropy coding. The review names no specific prior work, so to cover general data compression the revision also runs five general-purpose lossless coders (deflate, LZMA2, bzip2, zstd, Brotli) on the same OpenVLA-OFT calls (Table 28).
Lossy transform coding, as in image and audio codecs, also drops high-frequency coefficients, and it chooses how many by reconstruction error. FPE chooses that number by closed-loop task success, which reconstruction error does not predict (see W3). The table shows why FPE and lossless compression are two different tools. A lossless coder must deliver every number in the chunk, so it can only shorten how those numbers are written. FPE selects which numbers the robot needs to receive, and the coder then compresses what remains. For this reason, the saving holds across every coder in the table, and two uncoded rows are already smaller than the full code under the best general-purpose coder. Prior work on rate-limited control [1] and task-oriented communication [2] derives a code from a model of the plant, channel, or task, and concurrent work on VLA policies compresses the camera observations sent to the cloud [3]. None of these works measures how much of a finished action chunk the robot needs to complete its task, which is the quantity our paper reports.
Answer: No. This conjecture makes a prediction that we can test. If the tasks tolerated rough actions, then any rough approximation of the chunk at the same size would keep closed-loop task success. The paper's experiments, which the review finds sufficient in quantity, test this prediction directly and show the opposite (Table 22). The registered non-inferiority test, fixed before the runs, asks whether a loss of two points can be ruled out.
All three codes spend the same 112 bits, and only the cosine rows pass the registered test on both suites. Binning ran on the first 10 initial states of each task. Rounding the cosine coefficients coarsely also fails all 20 paired Goal episodes, and keeping a single row fails the test on three suites. The tasks are therefore sensitive to how an action chunk is approximated. The tasks need the low-frequency rows delivered precisely and tolerate dropping the high-frequency rows, which is the finding stated in our title.
Reference
[1] S. Tatikonda and S. Mitter. Control Under Communication Constraints. IEEE Transactions on Automatic Control 2004.
[2] D. Gündüz et al. Beyond Transmitting Bits: Context, Semantics, and Task-Oriented Communications. IEEE Journal on Selected Areas in Communications 2023.
[3] B. Liu et al. ComVLA: Communication-Aware Split Inference for VLA Models in 6G-Connected Robotics. IEEE GLOBECOM 2026.