DRIP: Domain Refinement Iteration with Polytopes for Backward Reachability Analysis of Neural Feedback Loops
Not on the map. Why?
Abstract (arXiv)
Safety certification of data-driven control techniques remains a major open problem. This work investigates backward reachability as a framework for providing collision avoidance guarantees for systems controlled by neural network (NN) policies. Because NNs are typically not invertible, existing methods conservatively assume a domain over which to relax the NN, which causes loose over-approximations of the set of states that could lead the system into the obstacle (i.e., backprojection (BP) sets). To address this issue, we introduce DRIP, an algorithm with a refinement loop on the relaxation domain, which substantially tightens the BP set bounds. Furthermore, we introduce a formulation that enables directly obtaining closed-form representations of polytopes to bound the BP sets tighter than prior work, which required solving linear programs and using hyper-rectangles. Furthermore, this work extends the NN relaxation algorithm to handle polytope domains, which further tightens the bounds on BP sets. DRIP is demonstrated in numerical experiments on control systems, including a ground robot controlled by a learned NN obstacle avoidance policy.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 11 of its 21 references that are in the map. First posted on arXiv 9 Dec 2022.
Builds on
11 of 21 references.
References · 11
- 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
- 2020Enabling certification of verification-agnostic networks via memory-efficient semidefinite programmingcited by 65
- 2020Reach-SDP: Reachability Analysis of Closed-Loop Systems with Neural Network Controllers via Semidefinite Programmingcited by 43
- 2021Reachability Analysis of Neural Feedback Loopscited by 41
- 2021OVERT: An Algorithm for Safety Verification of Neural Network Control Policies for Nonlinear Systemscited by 37
- 2020Reachable Polyhedral Marching (RPM): A Safety Verification Algorithm for Robotic Systems with Deep Neural Network Componentscited by 36
- 2022Backward Reachability Analysis of Neural Feedback Loops: Techniques for Linear and Nonlinear Systemscited by 18
- 2022One-Shot Reachability Analysis of Neural Network Dynamical Systemscited by 10
- 2022Backward Reachability Analysis for Neural Feedback Loopscited by 9
- 2022Neural Network Compression of ACAS Xu Early Prototype is Unsafe: Closed-Loop Verification through Quantized State Backreachabilitycited by 8
- 2022A Hybrid Partitioning Strategy for Backward Reachability of Neural Feedback Loopscited by 6
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 1; 2026: 1.
6 papers.
- 2023Provably Bounding Neural Network Preimagescited by 28
- 2024Lyapunov-stable Neural Control for State and Output Feedback: A Novel Formulationcited by 23
- 2025Neural Contraction Metrics with Formal Guarantees for Discrete-Time Nonlinear Dynamical Systemscited by 5
- 2024TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problemscited by 3
- 2026The FABRIC Strategy for Verifying Neural Feedback Systemscited by 1
- 2023The inverse problem for neural networkscited by 0
- 2026The FABRIC Strategy for Verifying Neural Feedback Systems9 Mar 2026
- 2025Neural Contraction Metrics with Formal Guarantees for Discrete-Time Nonlinear Dynamical Systems23 Apr 2025
- 2024TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems19 Jul 2024
- 2024Lyapunov-stable Neural Control for State and Output Feedback: A Novel Formulation11 Apr 2024
- 2023The inverse problem for neural networks27 Aug 2023
- 2023Provably Bounding Neural Network Preimages2 Feb 2023