mlsanityData to 7 Oct 2026

Efficient Interaction-Aware Interval Analysis of Neural Network Feedback Loops

arXiv 2307.14938 ↗First posted 27 Jul 2023eess.SY cs.LG cs.SYcited by 9

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose a computationally efficient framework for interval reachability of systems with neural network controllers. Our approach leverages inclusion functions for the open-loop system and the neural network controller to embed the closed-loop system into a larger-dimensional embedding system, where a single trajectory over-approximates the original system's behavior under uncertainty. We propose two methods for constructing closed-loop embedding systems, which account for the interactions between the system and the controller in different ways. The interconnection-based approach considers the worst-case evolution of each coordinate separately by substituting the neural network inclusion function into the open-loop inclusion function. The interaction-based approach uses novel Jacobian-based inclusion functions to capture the first-order interactions between the open-loop system and the controller by leveraging state-of-the-art neural network verifiers. Finally, we implement our approach in a Python framework called ReachMM to demonstrate its efficiency and scalability on benchmarks and examples ranging to 200 state dimensions.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 26 of its 75 references that are in the map. First posted on arXiv 27 Jul 2023.

Builds on

26 of 75 references.

References · 26

  1. 2013Intriguing properties of neural networkscited by 5,114
  2. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
  3. 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
  4. 2021Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verificationcited by 224
  5. 2019Algorithms for Verifying Deep Neural Networkscited by 221
  6. 2017Hamilton-Jacobi Reachability: A Brief Overview and Recent Advancescited by 186
  7. 2018Efficient Formal Safety Analysis of Neural Networkscited by 165
  8. 2020NNV: The Neural Network Verification Tool for Deep Neural Networks and Learning-Enabled Cyber-Physical Systemscited by 128
  9. 2019Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programmingcited by 100
  10. 2018Motion Planning Networkscited by 78
  11. 2020Reach-SDP: Reachability Analysis of Closed-Loop Systems with Neural Network Controllers via Semidefinite Programmingcited by 43
  12. 2015Learning Deep Control Policies for Autonomous Aerial Vehicles with MPC-Guided Policy Searchcited by 41
14 more
  1. 2021Reachability Analysis of Neural Feedback Loopscited by 41
  2. 2021POLAR: A Polynomial Arithmetic Framework for Verifying Neural-Network Controlled Systemscited by 38
  3. 2021OVERT: An Algorithm for Safety Verification of Neural Network Control Policies for Nonlinear Systemscited by 37
  4. 2020Reachable Set Estimation for Neural Network Control Systems: A Simulation-Guided Approachcited by 36
  5. 2019JuliaReach: a Toolbox for Set-Based Reachabilitycited by 28
  6. 2021Verification of Neural-Network Control Systems by Integrating Taylor Models and Zonotopescited by 26
  7. 2019TIRA: Toolbox for Interval Reachability Analysiscited by 12
  8. 2023Interval Reachability of Nonlinear Dynamical Systems with Neural Network Controllerscited by 8
  9. 2022ReachLipBnB: A branch-and-bound method for reachability analysis of neural autonomous systems using Lipschitz boundscited by 6
  10. 2023A Toolbox for Fast Interval Arithmetic in numpy with an Application to Formal Verification of Neural Network Controlled Systemscited by 6
  11. 2020Tight Decomposition Functions for Continuous-Time Mixed-Monotone Systems with Disturbancescited by 4
  12. 2023Contraction-Guided Adaptive Partitioning for Reachability Analysis of Neural Network Controlled Systemscited by 3
  13. 2018On sufficient conditions for mixed monotonicitycited by 2
  14. 2021Tight Remainder-Form Decomposition Functions with Applications to Constrained Reachability and Guaranteed State Estimationcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 3; 2025: 3; 2026: 2.

9 papers.