Global Optimization of Objective Functions Represented by ReLU Networks
Christopher A. Strong, Haoze Wu, Aleksandar Zelji\'c, Kyle D. Julian,, Guy Katz, Clark Barrett, Mykel J. Kochenderfer

TL;DR
This paper introduces an integrated optimization approach within neural network verifiers to efficiently find worst-case failures and minimal perturbations, enhancing safety guarantees for neural networks in critical applications.
Contribution
It extends existing neural network verification tools to perform optimization tasks, improving efficiency over naive methods and enabling more comprehensive safety analysis.
Findings
Integrated optimization improves runtime performance
Extension of Marabou outperforms naive bisection approach
Complementary performance observed with MIPVerify
Abstract
Neural networks can learn complex, non-convex functions, and it is challenging to guarantee their correct behavior in safety-critical contexts. Many approaches exist to find failures in networks (e.g., adversarial examples), but these cannot guarantee the absence of failures. Verification algorithms address this need and provide formal guarantees about a neural network by answering "yes or no" questions. For example, they can answer whether a violation exists within certain bounds. However, individual "yes or no" questions cannot answer qualitative questions such as "what is the largest error within these bounds"; the answers to these lie in the domain of optimization. Therefore, we propose strategies to extend existing verifiers to perform optimization and find: (i) the most extreme failure in a given input region and (ii) the minimum input perturbation required to cause a failure. A…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
