- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies error propagation in imitation policies conditioned on past actions. PRIM penalizes the Flow Matching velocity field’s sensitivity to action history, aiming to retain useful temporal information while reducing feedback from execution errors. The analysis relates temporal action correlations to history sensitivity and derives sufficient conditions for bounded error accumulation. Experiments on LIBERO-90 and four RoboMimic tasks evaluate task success, recursive history feedback, and robustness to perturbations.
Critical strengths
- PRIM provides a simple, targeted remedy for error propagation through action history. Results across four history lengths and three training seeds show substantial improvements on LIBERO-90, exceeding the no-history baseline after further training. Gains on ToolHang and Transport provide additional evidence of its usefulness beyond a single benchmark.
- The experiments provide convincing evidence for the proposed mechanism. Matched observations and sampling noise isolate history feedback, including propagation from model-generated initial errors. Simulator interventions further examine action deviations and task completion under shared perturbations. Together, these tests support the claim that PRIM reduces propagation of the tested errors.
Critical weaknesses
- The practical relevance of the theoretical guarantee remains unclear. The error bound relies on state-feedback contraction and a uniform relationship between the training penalty and sampling-path sensitivity. These assumptions are stated explicitly, but their validity for the evaluated policies is not established. The analysis therefore offers a conditional explanation without showing whether the bound is informative in the reported tasks.
- The comparisons leave uncertainty about PRIM’s advantage over alternative approaches. PALR and TCA use fixed auxiliary weights without a reported sensitivity study, and the TCA adaptation omits the original method’s information-bottleneck stage. The dropout control is also limited to one probability and one seed. Although the reported comparisons favor PRIM, broader tuning is needed to establish how much of the performance gap persists under other reasonable configurations.
Questions for authors
- Is there empirical evidence supporting the key conditions behind the error bound for the evaluated policies, particularly state-feedback contraction and the sampling-path comparison in Eq. (21)?
- How were the PALR and TCA weights selected, and have alternative values been evaluated? What motivated omitting TCA’s information-bottleneck stage?
- Could representative simulator executions and failure cases be provided to interpret the numerical gains? In particular, do they reveal fewer repeated errors, better recovery after deviations, or other changes in behavior?
5 comments
Thank you for the detailed response. The additional experiments address most of my concerns, particularly about the baseline comparisons. The written description of the book-placement example was helpful. If you already have recordings and it’s easy to include them in the supplementary material, could you make them available during the rebuttal period? It would be helpful to see how both policies respond to the perturbation during insertion, either in the book-placement example or in a similar comparison. An unannotated clip is fine.
Dear Reviewer YCNj,
Thank you for your interest in the book placement example. We have added a video and action traces to the supplementary material showing a LIBERO-90 task in which the robot places a book in the right compartment of a caddy. Both policies succeed with clean action history.
At step 50, we apply the same one-time perturbation to the three past arm actions for both policies, keeping the gripper history, simulator state, and sampling noise matched. The perturbation shifts the most recent vertical command upward. Relative to its clean run, the unregularized policy then shifts all ten vertical commands in its next plan in that same direction, by 0.192 to 0.347 controller units. For PRIM, each corresponding change is smaller than 0.0005 controller units. Both policies still bring the book to the compartment opening. During insertion, however, the unregularized policy opens its gripper and the book ends up outside. PRIM completes placement at step 164, just one step later than in its clean run. In this example, a single perturbation to action history influences an entire sequence of subsequent commands, and PRIM substantially reduces that response.
I hope this example addresses your question about what sensitivity to action history looks like during execution. If any aspect of the experiment remains unclear, I would be happy to clarify it before the rebuttal period ends.
Response to Reviewer YCNj
Thank you for recognizing PRIM’s targeted design and our controlled experiments on history feedback.
1. Theorem 2 and empirical evidence
Theorem 2 gives sufficient conditions for bounded error accumulation. State feedback contraction leaves room to reduce the total error gain below one, and Eq. (21) assumes that at each relevant input the expected history Jacobian energy along sampling paths is bounded by C times the training penalty. Under these conditions, reducing the history Jacobian limits the feedback of past errors even as each round introduces new errors.
PRIM’s mean history Jacobian energy was about 14% lower along sampling paths than on training interpolations. With observations and sampling noise matched, PRIM reduced cumulative action deviation energy by 54% over four replanning rounds and 72% over eight, showing that low sensitivity persists during generation and limits error accumulation across replans.
2. Baseline tuning and the information bottleneck
Auxiliary weights and dropout. The submission used fixed weights of 1 for PALR and 0.1 for TCA. We tested a tenfold increase and decrease and added PRIM and dropout settings. All runs use the same flow matching backbone, five past actions, 20k updates, and 450 matched LIBERO-90 rollouts. The training seed is 42 unless specified.
PRIM remains ahead of the tested PALR, TCA, and dropout settings with the same action history input.
TCA’s information bottleneck. The original comparison kept the deterministic representation to isolate TCA’s adversarial loss. We now add a Gaussian information bottleneck (IB) after 10k TCA updates, following Wen et al.’s appendix. The full representation uses an identity initialization for the Gaussian mean and scales the listed KL coefficients by 100/3584. Columns show total training steps.
Continuing TCA gave the highest success at each tested budget and representation. Among runs starting from the same full representation checkpoint and adding the Gaussian layer, success fell as the KL coefficient increased.
Single actions and action chunks. PALR and TCA address copycat behavior when predicting the next action from observation history. In our setting, the policy executes a chunk prefix and writes its latest executed actions into the next input, so prediction errors can recur and accumulate across chunks. PRIM directly limits sensitivity along this feedback path. With the same initial history perturbation and fixed observations, action deviations grew over the first three replans for PALR and TCA and shrank for PRIM, which may help explain its advantage in this setting. PALR · TCA appendix
3. Representative executions and failure cases
In the LIBERO-90 task “pick up the book and place it in the right compartment of the caddy,” both policies succeed without perturbation. At step 50 we perturb the continuous action history coordinates identically and keep gripper history unchanged. Both policies reach the compartment opening. During insertion, the unregularized policy tilts the book outward, and it slips outside and stays there. PRIM seats the book in the right compartment at step 164, versus step 163 without perturbation.
In a grasp transition with fixed recorded observations and 16 matched noise draws, PRIM predicts closing in all 16 samples at frame 64, when the first closing command enters history. The unregularized history policy keeps predicting opening until frame 66, and the policy without history still predicts opening at frame 68. We will label these events and the perturbation timing in the supplementary videos.