Simplifying Neural Networks Using Formal Verification

22Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Deep neural network (DNN) verification is an emerging field, with diverse verification engines quickly becoming available. Demonstrating the effectiveness of these engines on real-world DNNs is an important step towards their wider adoption. We present a tool that can leverage existing verification engines in performing a novel application: neural network simplification, through the reduction of the size of a DNN without harming its accuracy. We report on the work-flow of the simplification process, and demonstrate its potential significance and applicability on a family of real-world DNNs for aircraft collision avoidance, whose sizes we were able to reduce by as much as 10%.

Cite

CITATION STYLE

APA

Gokulanathan, S., Feldsher, A., Malca, A., Barrett, C., & Katz, G. (2020). Simplifying Neural Networks Using Formal Verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12229 LNCS, pp. 85–93). Springer. https://doi.org/10.1007/978-3-030-55754-6_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free