A Game-Based Approximate Verification of Deep Neural Networks with Provable Guarantees

Wu, Min and Wicker, Matthew and Ruan, Wenjie and Huang, Xiaowei and Kwiatkowska, Marta (2020) A Game-Based Approximate Verification of Deep Neural Networks with Provable Guarantees. Theoretical Computer Science, 807. pp. 298-329. ISSN 0304-3975

[img] Text (A Game-Based Approximate Verification of Deep Neural Networks with Provable Guarantees)
WWRHK.pdf - Accepted Version
Restricted to Repository staff only until 18 July 2020.
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.

Download (6MB)

Abstract

Despite the improved accuracy of deep neural networks, the discovery of adversarial examples has raised serious safety concerns. In this paper, we study two variants of pointwise robustness, the maximum safe radius problem, which for a given input sample computes the minimum distance to an adversarial example, and the feature robustness problem, which aims to quantify the robustness of individual features to adversarial perturbations. We demonstrate that, under the assumption of Lipschitz continuity, both problems can be approximated using finite optimisation by discretising the input space, and the approximation has provable guarantees, i.e., the error is bounded. We then show that the resulting optimisation problems can be reduced to the solution of two-player turn-based games, where the first player selects features and the second perturbs the image within the feature. While the second player aims to minimise the distance to an adversarial example, depending on the optimisation objective the first player can be cooperative or competitive. We employ an anytime approach to solve the games, in the sense of approximating the value of a game by monotonically improving its upper and lower bounds. The Monte Carlo tree search algorithm is applied to compute upper bounds for both games, and the Admissible A* and the Alpha-Beta Pruning algorithms are, respectively, used to compute lower bounds for the maximum safety radius and feature robustness games. When working on the upper bound of the maximum safe radius problem, our tool demonstrates competitive performance against existing adversarial example crafting algorithms. Furthermore, we show how our framework can be deployed to evaluate pointwise robustness of neural networks in safety-critical applications such as traffic sign recognition in self-driving cars.

Item Type: Journal Article
Journal or Publication Title: Theoretical Computer Science
Additional Information: This is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science, 807, 2019 DOI: 10.1016/j.tcs.2019.05.046
Uncontrolled Keywords: /dk/atira/pure/subjectarea/asjc/1700
Subjects:
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 134979
Deposited By: ep_importer_pure
Deposited On: 26 Jun 2019 12:59
Refereed?: Yes
Published?: Published
Last Modified: 14 Feb 2020 05:49
URI: https://eprints.lancs.ac.uk/id/eprint/134979

Actions (login required)

View Item View Item