mlsanityData to 7 Oct 2026

Safety Verification for Neural Networks Based on Set-boundary Analysis

arXiv 2210.04175 ↗First posted 9 Oct 2022cs.AI cs.LG cs.SEcited by 5

Not on the map. Why?

Abstract (arXiv)

Neural networks (NNs) are increasingly applied in safety-critical systems such as autonomous vehicles. However, they are fragile and are often ill-behaved. Consequently, their behaviors should undergo rigorous guarantees before deployment in practice. In this paper we propose a set-boundary reachability method to investigate the safety verification problem of NNs from a topological perspective. Given an NN with an input set and a safe set, the safety verification problem is to determine whether all outputs of the NN resulting from the input set fall within the safe set. In our method, the homeomorphism property of NNs is mainly exploited, which establishes a relationship mapping boundaries to boundaries. The exploitation of this property facilitates reachability computations via extracting subsets of the input set rather than the entire input set, thus controlling the wrapping effect in reachability analysis and facilitating the reduction of computation burdens for safety verification. The homeomorphism property exists in some widely used NNs such as invertible NNs. Notable representations are invertible residual networks (i-ResNets) and Neural ordinary differential equations (Neural ODEs). For these NNs, our set-boundary reachability method only needs to perform reachability analysis on the boundary of the input set. For NNs which do not feature this property with respect to the input set, we explore subsets of the input set for establishing the local homeomorphism property, and then abandon these subsets for reachability computations. Finally, some examples demonstrate the performance of the proposed method.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 28 of its 48 references that are in the map. First posted on arXiv 9 Oct 2022.

Builds on

28 of 48 references.

References · 28

  1. 2018Neural Ordinary Differential Equationscited by 3,733
  2. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
  3. 2021BARTScore: Evaluating Generated Text as Text Generationcited by 719
  4. 2017Interpretation of Neural Networks is Fragilecited by 443
  5. 2019Augmented Neural ODEscited by 396
  6. 2018Invertible Residual Networkscited by 364
  7. 2016Safety Verification of Deep Neural Networkscited by 262
  8. 2017Formal Verification of Piece-Wise Linear Feed-Forward Neural Networkscited by 241
  9. 2018Analyzing Inverse Problems with Invertible Neural Networkscited by 239
  10. 2019Algorithms for Verifying Deep Neural Networkscited by 221
  11. 2017The Reversible Residual Network: Backpropagation Without Storing Activationscited by 215
  12. 2018Efficient Formal Safety Analysis of Neural Networkscited by 165
16 more
  1. 2018i-RevNet: Deep Invertible Networkscited by 137
  2. 2017An approach to reachability analysis for feed-forward ReLU neural networkscited by 126
  3. 2020Topology of deep neural networkscited by 111
  4. 2017Output Reachable Set Estimation and Verification for Multi-Layer Neural Networkscited by 79
  5. 2021Panoptic 3D Scene Reconstruction From a Single RGB Imagecited by 70
  6. 2017Output Range Analysis for Deep Neural Networkscited by 30
  7. 2020Improving Neural Network Verification through Spurious Region Guided Refinementcited by 30
  8. 2019ReachNN: Reachability Analysis of Neural-Network Controlled Systemscited by 26
  9. 2020On The Verification of Neural ODEs with Stochastic Guaranteescited by 24
  10. 2017Reachable Set Computation and Safety Verification for Neural Networks with ReLU Activationscited by 22
  11. 2022Reachability Analysis of a General Class of Neural Ordinary Differential Equationscited by 13
  12. 2018Reachability Analysis and Safety Verification for Neural Network Control Systemscited by 12
  13. 2021GoTube: Scalable Stochastic Verification of Continuous-Depth Modelscited by 12
  14. 2020Lagrangian Reachtubes: The Next Generationcited by 10
  15. 2021Grounding Spatio-Temporal Language with Transformerscited by 7
  16. 2018Over- and Under-Approximating Reachable Sets for Perturbed Delay Differential Equationscited by 4

Built on by

Cited by year

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

5 papers.