- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes Noise Safe Corrector (NSC), a training-free safety filter for frozen flow-matching vision-language-action policies. Rather than changing the predicted actions directly, NSC differentiates a chunk-level geometric safety score through the deterministic policy sampler and adjusts its initial noise. Each update solves a single-constraint quadratic program in closed form, combining a direction that improves the linearized safety score with a pull toward the original noise. The full action chunk is then regenerated and checked. The paper proves finite-time recovery for a continuous correction process and finite-step recovery under explicit smoothness, nonzero-gradient, step-size, and update-budget conditions. The evaluation covers a toy navigation problem, SafeLIBERO with two backbones, VLA-Arena, three newly constructed SafeDetour tasks with a third backbone, and a physical pick-and-place demonstration. The real-robot comparison reports 10/10 safe successes for NSC, versus 0/10 for each comparator, under a protocol restricted to initially unsafe upper-route proposals.
Critical strengths
A coherent mechanism for changing an entire proposed behavior while retaining a frozen policy. Equations (8)-(10) make it possible to use the policy Jacobian to coordinate changes across an action chunk, while avoiding retraining a large VLA. The conditional recovery results in Proposition 4.1 and Appendix A.2 give a precise account of when the optimization can find a chunk satisfying its supplied safety score. This is a useful technical contribution beyond an unconstrained heuristic perturbation.
Substantial evidence for improved safe completion across several settings and backbones. Tables 1-3 consistently favor NSC in average safe success, and the 26 percentage point improvement over the strongest filter baseline on SafeDetour is especially meaningful for the stated deadlock/detour motivation. Reporting TSR, CAR, and their joint event SS helps distinguish completing a task from merely stopping safely. The safety-margin sweep in Appendix E also makes a relevant success-versus-clearance tradeoff explicit. These results support the usefulness of the overall method under the tested geometric assumptions.
Critical weaknesses
The comparison does not isolate the noise-space parameterization under matched computation. NSC can regenerate and differentiate through the complete policy repeatedly, with a budget of ten correction updates and additional Armijo evaluations (Appendix B.6). SFM's prediction and correction steps instead share the base policy's fixed flow-evaluation budget. No latency, distribution of actual correction counts, or comparison at matched forward/backward computation is reported. The methods share the geometric barrier according to Section 5.1, and the base/VLSA/NSC action and execution horizons are explicitly matched in Appendix B.3. However, the manuscript attributes baseline failures to independent per-action corrections (Section 5.2), and does not include a full-chunk action-space optimization control or repeated noise sampling/selection under the same safety score and comparable budget. Consequently, the reported gains establish the value of the complete NSC system, but do not establish whether its noise-space parameterization is the decisive improvement. This limits the support for the central mechanism claim and assessment of the practical inference-time tradeoff.
The connection between the conditional optimization guarantee and the executed safety filter is underspecified. Proposition A.1 requires a gradient lower bound, a gradient Lipschitz bound, and a sufficiently small fixed step size and large budget. Experiments instead use adaptive Armijo steps and a fixed budget of ten, without reporting how often correction fails or what the robot executes in that event. Appendix C.1 explicitly says that an unsafe zero-gradient candidate causes the algorithm to report failure, but does not specify the subsequent robot behavior. Appendix B.1 predicts link/gripper clearance from accumulated end-effector translations and holds obstacle geometry fixed over the chunk; thus a certified predicted chunk need not certify the actual motion, especially in the DynamicObstacles evaluation. The manuscript acknowledges known geometry as a limitation, which is appropriate, but does not quantify this prediction/execution gap or connect observed collisions to infeasibility, budget exhaustion, or model mismatch. For a method presented as a safety filter, this missing operational contract materially limits the interpretation of its guarantees. It does not, by itself, invalidate the conditional mathematical results.
Questions for authors
What are median and tail query latencies, numbers of policy forward/backward passes, Armijo evaluations, and correction iterations for NSC and the baselines on the same hardware? At a comparable computational budget, how much of the safe-success gain remains relative to full-chunk action-space correction or sampling several noise candidates and selecting a safe one? Please clarify exactly how the shared chunk safety function is instantiated for SFM, which the manuscript describes as correcting actions independently.
Which differentiable safety function is actually optimized, with what softmin temperature, delta, and Armijo rule? What fractions of queries encounter a near-zero gradient or exhaust the ten-update budget, and what action or stop behavior follows? How are arm-link motion and moving obstacles handled between policy queries, and how often does predicted safety disagree with executed safety? These details determine whether the implementation supports the intended safety interpretation.
Please reconcile the VLA-Arena TBD episode count and L1/L2 evaluation in B.3.2 with the ten episodes and L0-L2 description in Section 5.3, and the two conventions for including epsilon in the safety function. For the physical experiment, were the same ten initial states and initially unsafe proposals paired across methods, and how often does the unfiltered policy initially choose the excluded safe route? This would distinguish conditional correction performance from unconditional deployment performance.
9 comments
Controls under a comparable budget
However, the manuscript attributes baseline failures to independent per-action corrections (Section 5.2), and does not include a full-chunk action-space optimization control or repeated noise sampling/selection under the same safety score and comparable budget. Consequently, the reported gains establish the value of the complete NSC system, but do not establish whether its noise-space parameterization is the decisive improvement. This limits the support for the central mechanism claim and assessment of the practical inference-time tradeoff.
At a comparable computational budget, how much of the safe-success gain remains relative to full-chunk action-space correction or sampling several noise candidates and selecting a safe one?
We agree that the original evidence supported only the complete system. As the reviewer suggested, we added the two controls, which are full-chunk action-space optimization (direct full-chunk optimization) and noise sampling and selection (noise resampling). Both use the same safety score and the same budget as NSC. We also compared NSC with SFM under matched latency, where SFM is given the worst-case latency of a corrected query of NSC. VLSA is not included in the matched comparison, because it has no iterative component that can use additional computation. The detailed setup will be added to Appendix G.1 and G.3 of the revised manuscript.
Matched Comparison (TSR / CAR / SS).
| Method | SafeLIBERO Object | VLA-Arena StaticObstacles | SafeDetour Toaster |
|---|---|---|---|
| Direct full-chunk optimization | 82 / 78 / 70 | 49 / 62 / 38 | 85 / 78 / 70 |
| Noise resampling (same budget) | 78 / 33 / 30 | 52 / 72 / 44 | 88 / 41 / 38 |
| SFM (matched to the worst-case latency of NSC) | 78 / 85 / 69 | 48 / 81 / 44 | 72 / 99 / 72 |
| NSC | 86 / 88 / 77 | 57 / 83 / 56 | 91 / 99 / 91 |
NSC keeps a gain of 15.3 points of SS on average over full-chunk action-space optimization, 37.3 points over noise sampling and selection under the same budget, and 13.0 points over SFM under matched latency. Thus the gains do not come from the additional computation.
Regarding Section 5.2, direct full-chunk optimization improves the SS over VLSA in Tables 1 to 3 of the manuscript by 11.3 points, so correcting the whole chunk instead of each action explains a part of the baseline failures. The noise-space parameterization adds 15.3 points. We will revise Section 5.2 and the mechanism claim accordingly.
Instantiation of the safety function for SFM
The methods share the geometric barrier according to Section 5.1, and the base/VLSA/NSC action and execution horizons are explicitly matched in Appendix B.3.
Please clarify exactly how the shared chunk safety function is instantiated for SFM, which the manuscript describes as correcting actions independently.
The reviewer's understanding is correct. All methods use the same clearance , obstacle geometry, and margin ε, so they share the same safe set, in which holds at every step of the chunk.
SFM follows its original formulation [1], in which the CBF condition is enforced independently for each waypoint. With the barrier of waypoint , , it solves one QP per waypoint at every correction step ,
where is the time-scaled velocity of the flow at waypoint and is the finite-time barrier term of SFM, and the slack variable is omitted for brevity. Each waypoint is therefore certified by its own QP, but the corrections are not coordinated across the chunk. Neighboring waypoints can be moved in different directions, so the path can change abruptly within the chunk, and the motion between two certified waypoints is not certified. This is what we meant by correcting actions independently, and it is how SFM collides in Section 5.2. In contrast, NSC uses one function of the whole chunk and one QP in the noise space (Section 4), so all actions change together through the policy.
References
[1] Yang, J., Jang, S., and Han, S. SafeFlowMatcher: Safe and Fast Planning using Flow Matching with Control Barrier Functions. In International Conference on Learning Representations, 2026.
(W2 & Q2) Connection between the guarantee and the executed filter
Specification of the executed filter
The connection between the conditional optimization guarantee and the executed safety filter is underspecified.
Which differentiable safety function is actually optimized, with what softmin temperature, delta, and Armijo rule?
We apologize that these details were missing. The safety function checks the gripper and the wrist link (link 7), each enclosed by an ellipsoid, and it is , where is the smallest signed distance between these ellipsoids and the obstacle ellipsoids at step . The gradient is computed with the smooth lower bound of this function, in which each minimum is replaced with a softmin (Appendix B.1), while the acceptance test uses the function itself with the hard minimum. The parameters are listed below, and the detailed definitions will be added to Appendix B.1 and B.6 of the revised manuscript.
Parameters of the Executed Filter.
| Item | Value |
|---|---|
| Softmin sharpness (inverse temperature) | 200 for π0.5 and Xiaomi-Robotics-1, 240 for GR00T N1.7 |
| CBF margin δ | 0.01 |
| Armijo rule | with σ = 0.5. The candidate steps start from 1 (median) and decrease by a factor of 1/2. They are evaluated in parallel, and the largest one that satisfies the rule is accepted |
| Acceptance test | , evaluated with the hard minimum |
Theoretical conditions and failure
Proposition A.1 requires a gradient lower bound, a gradient Lipschitz bound, and a sufficiently small fixed step size and large budget. Experiments instead use adaptive Armijo steps and a fixed budget of ten, without reporting how often correction fails or what the robot executes in that event. Appendix C.1 explicitly says that an unsafe zero-gradient candidate causes the algorithm to report failure, but does not specify the subsequent robot behavior.
What fractions of queries encounter a near-zero gradient or exhaust the ten-update budget, and what action or stop behavior follows?
These conditions (Eq. 16 of Prop. A.1) decide whether a safe chunk is found within K updates, not whether an executed chunk is safe, which follows from the acceptance test h(A) ≥ 0 in Algorithm 1 alone. Regarding the adaptive Armijo steps, the fixed step size of Prop. A.1 is needed only to guarantee the progress inequality in Eq. (20), , and the Armijo line search (Appendix B.6) checks this inequality at every update. Any step that satisfies the fixed-step condition passes this test, so Prop. A.1 holds with the smallest accepted step in place of η. We will add this result as Prop. A.2 (Appendix A.3). Regarding the fixed budget of ten, we chose K = 10 from the bound of Prop. A.1. With η = 0.5 and δ = 0.01, this bound is 10 updates for an initial violation of 15 cm, which is the average width of the obstacles in our experiments. The table below reports how often correction fails and why.
Outcome of the Corrections (K = 10, % of corrected queries).
| Setting | Certified | Near-zero gradient | Budget exhausted | Line-search failure |
|---|---|---|---|---|
| SafeLIBERO Object | 99.75 | 0 | 0 | 0.25 |
| VLA-Arena StaticObstacles | 97.95 | 0.16 | 0 | 1.89 |
| SafeDetour Toaster | 100 | 0 | 0 | 0 |
A near-zero gradient occurs in 0%, 0.16%, and 0% of the corrected queries, and the budget of ten is never exhausted. The line search fails in 0.25%, 1.89%, and 0%. When correction fails, NSC does not execute the chunk and outputs the stop action for that chunk. Appendix C.1 did not specify this behavior, and we will state it there and in Algorithm 1. The details will be added to Appendix B.8 of the revised manuscript.
We thank the reviewer for their careful reading of our paper and their insightful feedback. We would like to address the reviewer's concerns and questions below.
(W1 & Q1) Isolation of the noise-space parameterization under matched computation
Computational cost
We agree that the comparison should report the computational cost of each method. NSC requires additional computation only when the proposed chunk is unsafe, so we report it both over all queries and over the corrected queries. All methods are measured on the same hardware. The cost is measured on SafeLIBERO Object for π0.5 and GR00T N1.7 and on SafeDetour Toaster for Xiaomi-Robotics-1.
Cost per Query.
Over all queries, the median latency of NSC is lower than that of SFM for every backbone, because most queries need no correction. The additional cost of NSC appears in the corrected queries and in the tail. VLSA and SFM use only the forward pass of the base policy, without any backward pass, Armijo evaluation, or correction update. For NSC, each correction update uses one backward pass. The candidate steps of the line search are evaluated in parallel, and each of them is one Armijo evaluation with one forward pass. The distribution of the correction updates is reported below.
Distribution of the Correction Updates (% of corrected queries).
More than 95% of the corrections end within two updates for every backbone, and none of them exhausts the budget of ten updates. The comparison under matched computation is reported in the next part.