Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reachability Analysis of Convolutional Neural Networks (2106.12074v1)

Published 22 Jun 2021 in cs.CV

Abstract: Deep convolutional neural networks have been widely employed as an effective technique to handle complex and practical problems. However, one of the fundamental problems is the lack of formal methods to analyze their behavior. To address this challenge, we propose an approach to compute the exact reachable sets of a network given an input domain, where the reachable set is represented by the face lattice structure. Besides the computation of reachable sets, our approach is also capable of backtracking to the input domain given an output reachable set. Therefore, a full analysis of a network's behavior can be realized. In addition, an approach for fast analysis is also introduced, which conducts fast computation of reachable sets by considering selected sensitive neurons in each layer. The exact pixel-level reachability analysis method is evaluated on a CNN for the CIFAR10 dataset and compared to related works. The fast analysis method is evaluated over a CNN CIFAR10 dataset and VGG16 architecture for the ImageNet dataset.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Xiaodong Yang (101 papers)
  2. Tomoya Yamaguchi (10 papers)
  3. Hoang-Dung Tran (16 papers)
  4. Bardh Hoxha (36 papers)
  5. Danil Prokhorov (24 papers)
  6. Taylor T Johnson (7 papers)
Citations (4)

Summary

We haven't generated a summary for this paper yet.