2020
DOI: 10.48550/arxiv.2010.07722
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Improving Neural Network Verification through Spurious Region Guided Refinement

Abstract: We propose a spurious region guided refinement approach for robustness verification of deep neural networks. Our method starts with applying the DeepPoly abstract domain to analyze the network. If the robustness property cannot be verified, the result is inconclusive. Due to the over-approximation, the computed region in the abstraction may be spurious in the sense that it does not contain any true counterexample. Our goal is to identify such spurious regions and use them to guide the abstraction refinement. T… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 34 publications
0
2
0
Order By: Relevance
“…Among the works, formal verification aims to prove that no adversarial examples exist in the neighborhood of a given input. Substantial progress has been made using approaches like abstract interpretation [63,83] and reachability analysis [67]. However, these formal verification techniques are in general computationally expensive and only scale to limited model structures and properties (e.g., local robustness [29]).…”
Section: Introductionmentioning
confidence: 99%
“…Among the works, formal verification aims to prove that no adversarial examples exist in the neighborhood of a given input. Substantial progress has been made using approaches like abstract interpretation [63,83] and reachability analysis [67]. However, these formal verification techniques are in general computationally expensive and only scale to limited model structures and properties (e.g., local robustness [29]).…”
Section: Introductionmentioning
confidence: 99%
“…Among them, formal verification aims to prove that no adversarial examples exist in the neighborhood of a given input. Substantial progress has been made using approaches like abstract interpretation [36], [51] and reachability analysis [40]. However, formal verification techniques are in general expensive and only scale to limited model structures and properties (e.g., local robustness [17]).…”
Section: Introductionmentioning
confidence: 99%