Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
From MaRDI portal
Publication:5096089
DOI10.1007/978-3-319-68167-2_19zbMath1495.68131arXiv1705.01320OpenAlexW2963054787MaRDI QIDQ5096089
Publication date: 12 August 2022
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.01320
Artificial neural networks and deep learning (68T07) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (32)
Deep Statistical Model Checking ⋮ DiffRNN: differential verification of recurrent neural networks ⋮ \textsf{BDD4BNN}: a BDD-based quantitative analysis framework for binarized neural networks ⋮ Verisig 2.0: verification of neural network controllers using Taylor model preconditioning ⋮ Robustness verification of semantic segmentation neural networks using relaxed reachability ⋮ Static analysis of ReLU neural networks with tropical polyhedra ⋮ Exploiting verified neural networks via floating point numerical error ⋮ Reachability in Simple Neural Networks ⋮ Sparse polynomial optimisation for neural network verification ⋮ Speeding up neural network robustness verification via algorithm configuration and an optimised mixed integer linear programming solver portfolio ⋮ Reluplex: a calculus for reasoning about deep neural networks ⋮ \textsf{CLEVEREST}: accelerating CEGAR-based neural network verification via adversarial attacks ⋮ Neural Network Verification Using Residual Reasoning ⋮ T4V: exploring neural network architectures that improve the scalability of neural network verification ⋮ Robustness analysis of continuous-depth models with Lagrangian techniques ⋮ Fast BATLLNN: Fast Box Analysis of Two-Level Lattice Neural Networks ⋮ Towards a unifying logical framework for neural networks ⋮ Verifying feedforward neural networks for classification in Isabelle/HOL ⋮ Reachability is NP-complete even for the simplest neural networks ⋮ An SMT-based approach for verifying binarized neural networks ⋮ SyReNN: a tool for analyzing deep neural networks ⋮ Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter ⋮ Probabilistic guarantees for safe deep reinforcement learning ⋮ How Many Bits Does it Take to Quantize Your Neural Network? ⋮ A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability ⋮ Improving neural network verification through spurious region guided refinement ⋮ Advances in verification of ReLU neural networks ⋮ Enhancing robustness verification for deep neural networks via symbolic propagation ⋮ Reachable sets of classifiers and regression models: (non-)robustness analysis and robust training ⋮ An SMT theory of fixed-point arithmetic ⋮ Robustness verification of ReLU networks via quadratic programming ⋮ Reachability analysis of a general class of neural ordinary differential equations
This page was built for publication: Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
