Improved geometric path enumeration for verifying ReLU neural networks
From MaRDI portal
Publication:2225077
DOI10.1007/978-3-030-53288-8_4zbMath1478.68142OpenAlexW3043655933MaRDI QIDQ2225077
Hoang-Dung Tran, Stanley Bak, Kerianne Hobbs, Taylor T. Johnson
Publication date: 4 February 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-53288-8_4
Artificial neural networks and deep learning (68T07) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (10)
Robustness verification of semantic segmentation neural networks using relaxed reachability ⋮ Static analysis of ReLU neural networks with tropical polyhedra ⋮ Verifying low-dimensional input neural networks via input quantization ⋮ Robustness analysis of continuous-depth models with Lagrangian techniques ⋮ Reachability analysis of deep ReLU neural networks using facet-vertex incidence ⋮ Fast BATLLNN: Fast Box Analysis of Two-Level Lattice Neural Networks ⋮ The octatope abstract domain for verification of neural networks ⋮ Quantitative Verification for Neural Networks using ProbStars ⋮ Verification of Recurrent Neural Networks with Star Reachability ⋮ Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter
This page was built for publication: Improved geometric path enumeration for verifying ReLU neural networks
