Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks

作者: Guy Katz , Clark Barrett , David L. Dill , Kyle Julian , Mykel J. Kochenderfer

DOI: 10.1007/978-3-319-63387-9_5

关键词:

摘要: Deep neural networks have emerged as a widely used and effective means for tackling complex, real-world problems. However, major obstacle in applying them to safety-critical systems is the great difficulty providing formal guarantees about their behavior. We present novel, scalable, efficient technique verifying properties of deep (or counter-examples). The based on simplex method, extended handle non-convex Rectified Linear Unit (ReLU) activation function, which crucial ingredient many modern networks. verification procedure tackles whole, without making any simplifying assumptions. evaluated our prototype network implementation next-generation airborne collision avoidance system unmanned aircraft (ACAS Xu). Results show that can successfully prove are an order magnitude larger than largest verified using existing methods.

参考文章(29)
Jean-Baptiste Jeannin, Khalil Ghorbal, Yanni Kouskoulas, Ryan Gardner, Aurora Schmidt, Erik Zawadzki, André Platzer, A Formally Verified Hybrid System for the Next-Generation Airborne Collision Avoidance System Tools and Algorithms for the Construction and Analysis of Systems. pp. 21- 36 ,(2015) , 10.1007/978-3-662-46681-0_2
Clark Barrett, Roberto Sebastiani, Sanjit A Seshia, Cesare Tinelli, Satisfiability Modulo Theories Handbook of Satisfiability. pp. 305- 343 ,(2018) , 10.1007/978-3-319-10575-8_11
Luca Pulina, Armando Tacchella, Challenging SMT solvers to verify neural networks Ai Communications. ,vol. 25, pp. 117- 135 ,(2012) , 10.3233/AIC-2012-0525
Geoffrey E. Hinton, Vinod Nair, Rectified Linear Units Improve Restricted Boltzmann Machines international conference on machine learning. pp. 807- 814 ,(2010)
Tim King, Cesare Tinelli, Clark Barrett, Leveraging Linear and Mixed Integer Programming for SMT formal methods in computer-aided design. pp. 139- 146 ,(2014) , 10.5555/2682923.2682950
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli, Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) Journal of the ACM. ,vol. 53, pp. 937- 977 ,(2006) , 10.1145/1217856.1217859
Manfred Padberg, Giovanni Rinaldi, A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems SIAM Review. ,vol. 33, pp. 60- 100 ,(1991) , 10.1137/1033004
J.P. Marques-Silva, K.A. Sakallah, GRASP: a search algorithm for propositional satisfiability IEEE Transactions on Computers. ,vol. 48, pp. 506- 521 ,(1999) , 10.1109/12.769433
Mykel J. Kochenderfer, Matthew W. M. Edwards, Leo P. Espindle, James K. Kuchar, J. Daniel Griffith, Airspace Encounter Models for Estimating Collision Risk Journal of Guidance Control and Dynamics. ,vol. 33, pp. 487- 499 ,(2010) , 10.2514/1.44867
George Bernard Dantzig, Linear Programming and Extensions ,(1963)