1.9 KiB
| authors | citekey | publish_date | publisher | location | pages | last_import | |||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
katzReluplexEfficientSMT2017 | 2017-01-01 | Springer International Publishing | Cham | 97-117 | 2025-05-12 |
Indexing Information
Published: 2017-01
DOI 10.1007/978-3-319-63387-9_5 ISBN 978-3-319-63387-9 #Airborne-Collision-Avoidance-System, #Deep-Neural-Networks-DNNs, #Rectified-Linear-Unit-ReLU, #ReLU-Function, #Satisfiability-Modulo-Theories-SMT
#ToRead
[!Abstract] Deep neural networks have emerged as a widely used and effective means for tackling complex, real-world problems. However, a major obstacle in applying them to safety-critical systems is the great difficulty in providing formal guarantees about their behavior. We present a novel, scalable, and efficient technique for verifying properties of deep neural networks (or providing counter-examples). The technique is based on the simplex method, extended to handle the non-convex Rectified Linear Unit (ReLU) activation function, which is a crucial ingredient in many modern neural networks. The verification procedure tackles neural networks as a whole, without making any simplifying assumptions. We evaluated our technique on a prototype deep neural network implementation of the next-generation airborne collision avoidance system for unmanned aircraft (ACAS Xu). Results show that our technique can successfully prove properties of networks that are an order of magnitude larger than the largest networks verified using existing methods.>[!seealso] Related Papers
Annotations
Notes
!Paper Notes/Reluplex- An Efficient SMT Solver for Verifying Deep Neural Networks.md