- Rating
- 1(−1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1(−1)
Read review
Paper summary
This paper proposes a bCBF safe filter for SAC actors. It employs LSE to reduce the large number of constraints generated by the backup policy rollout and uses state augmentation to allow a closed-form solution to the QP problem.
Critical strengths
This paper proposes a viable safe filtering mechanism for SAC actions, which is an important problem in RL applications. The results clearly show that bCBF outperforms current sate CBF filters.
Critical weaknesses
The paper applies a combination of existing methods, which is not a problem on its own, but the resultant combination does not solve previously unaddressed problems or lead to many new findings.
-
Formulating the safety-filter design problem and reducing the bCBF certificate to a single constraint is not newly proposed. The framework in [Rabiee & Hoagg, 2025], which the authors cite, is applicable but omitted here as an action filter, which arguably has a similar effect as SAFTER, as solving a 3-variable QP can be very fast. (See question 1 for more detail).
-
This work also adds state augmentation from [Rabiee & Hoagg, 2024], which, under practical control hold, results in input admissibility issues: the applied action can be different from the certified safe action. It is questionable whether the latency gain, if any, associated with augmentation is worth trading off guaranteed input admissibility.
-
The empirical results in the work do not support the necessity of using a learned SAC to propose the nominal action. An important baseline here is to avoid the huge RL training cost and use a simple reaching for target policy as if no obstacle exists (a heuristic policy similar to [Rabiee & Hoagg, 2024, Rabiee & Hoagg, 2025]).
-
Overall, the presentation of this paper significantly limits its informativeness. Clear motivations for the design choices are not well established. Important limitations, such as the clipped action differing from the certified action, are delayed to Appendix C.3. The paper also lacks implementation details, e.g., whether CBF-CF and CBF-QP use state augmentation. No source code is provided to support reproducibility.
The added results and implementations during rebuttal raises further concerns rather than resolving my original points. I therefore lower my rating from 2 to 1 and leave the final assessment to the AC.
Questions for authors
Can you compare against [Rabiee & Hoagg, 2025]? The body velocity can be modelled as a state, with the velocity command as a hard-bounded input. This should also include using a heuristic nominal policy and an SAC nominal policy.
11 comments
Contributions and Additional Implementation Details (Part 2/2)
3. Contributions, Controlled Findings, and Real-World Hardware Validation (W1)
Our contribution is integrating finite-horizon backup recoverability into an end-to-end differentiable policy-training map—introducing a forward-invariant anisotropic elliptical terminal recoverability set for scan-fixed LiDAR navigation (Prop. B.1) and deriving the exact finite-rate action Jacobian (Eq. 17) for SAC training. Experiments establish three findings (Table 9):
- Predictive recoverability drives RL sample efficiency: SAFTER reaches 90% training success in 4.06±0.08M transitions, reducing transitions by 30.6%–35.1% vs. Vanilla SAC (5.85M) and current-state CBFs (6.16M–6.26M), matching
bCBF–LSE–QP(4.13M). - Exact projection differentiation drives distribution-shift robustness: With identical forward filtering, replacing the exact projection Jacobian with identity drops High-Shift success from 61.4% to 6.2% (single checkpoint) and from 43.4% to 4.4% across five independent training seeds.
- Real-world Unitree Go2 hardware validation: Deployed zero-shot on a physical Unitree Go2 in two real-world obstacle layouts (30 trials/layout; 60 trials total), SAFTER achieved 73.3% and 76.7% success, outperforming the strongest baselines (63.3% for CBF–RL and 16.7% for CBF–CF).
Table 9: Summary of controlled RL ablations, runtime benchmarks, and real-world Unitree Go2 results.
| Evaluation Metric | Reference / Baseline Result | SAFTER (Ours) |
|---|---|---|
| Transitions to 90% training SR | Vanilla SAC: 5.85M; Current-state CBFs: 6.16–6.26M | 4.06±0.08M (Matched QP: 4.13±0.43M) |
| High-Shift SR (same forward filter) | Identity Jacobian: 6.2±4.4% (5-seed: 4.4±1.5%) | Exact: 61.4±10.2% (5-seed: 43.4±12.9%) |
| Runtime (Batch = 1 / 100) | Matched QP: 5.73 / 7.08 ms; Direct QP: 30.55 / 2504.79 ms | 2.50 / 2.53 ms (Synth.: 0.10 / 0.11 ms) |
| Runtime (Batch = 500, Total / Synth.) | Rabiee & Hoagg (2025) bounded QP: 193.60 / 186.00 ms | 2.71 / 0.10 ms (71.4× / 1,860× faster) |
| Real-world Go2 (Layouts 1 & 2, 60 trials) | Best baselines: 63.3% (CBF–RL) & 16.7% (CBF–CF) | 73.3% & 76.7% success |
4. Presentation, Baseline Implementation Details, and Reproducibility (W4)
- Main-text revisions: We expanded the design motivation in Section 4 and moved the finite-rate propagation, clipping equations (Eqs. 15–16), and guarantee-scope discussion from Appendix C.2–C.3 directly into Section 4 alongside our 29,896-step clipping audit.
- Explicit baseline specifications (
CBF–CFandCBF–QP): Both use the same first-order command-state augmentation (), lifted HOCBF (), input barriers (), and finite-rate propagation/clipping (Eqs. 15–16) as SAFTER, omitting only the backup rollout and terminal set (CBF–CFuses LSE composition + closed-form projection following Rabiee & Hoagg, 2024;CBF–QPenforces separate QP constraints). - Reproducibility: Code, baseline configurations, and protocols are provided in our anonymous repository, accessible through https://anonymous.4open.science/r/SAFTER-ICLR2027/.
The added Table 8 raises further concerns. I believe the baseline comparison with [Rabiee & Hoagg, 2025] should model body velocity as a state, so that the continued motion after a zero-speed command is accounted for. (This is explicitly raised in my question.) However, please correct me if I am wrong, the released implementation seems to not have a velocity state and assumes instantaneous stopping. If the added Table 8 uses this implementation, the higher collision rate with the nominal controller, and 0% success with SAC controller do not establish stronger performance of the proposed method.
The added clipping results also confirm my concern that clipping can invalidate the CBF safety condition. Describing these violations as “only 0.57%” does not resolve the lack of a safety guarantee for the actually executed actions.
Baseline Comparison and Methodology Trade-Offs (Part 1/2)
We thank the reviewer for the detailed feedback. To address your questions directly, we implemented a hard-bounded soft-minimum bCBF-QP adaptation based on Rabiee & Hoagg (2025)—modeling body velocity as a state evolving toward a hard-bounded velocity command input umin≤u≤umax optimized via a 3-variable QP—and evaluated it alongside SAFTER under both an obstacle-blind heuristic P-controller and SAC training, in addition to conducting a 29,896-step clipping audit and 60 real-world Unitree Go2 hardware trials.
1. Comparison with Rabiee & Hoagg (2025) and Necessity of a Learned SAC Policy (Q1, W1, W3)
To test (i) how SAFTER compares against the hard-bounded soft-minimum bCBF-QP adaptation of Rabiee & Hoagg (2025) and (ii) whether an obstacle-blind goal-reaching heuristic can replace RL training, we evaluated both safety filters on the same obstacle navigation map paired with either an obstacle-blind P-controller (steering directly toward the goal) or an SAC policy trained with that filter (Table 8).
Table 8: Navigation performance with heuristic (P-controller) and learned (SAC) nominal controllers.
These controlled comparisons establish two findings:
2. State Augmentation Trade-Off: Computational Speedup vs. Input Admissibility (W1, W2)