Algorithms for Verifying Deep Neural Networks

Changliu Liu, Tomer Arnon, Christopher Lazarus, Christopher Strong, Clark Barrett +1 more
3/15/2019
cs.LGstat.ML

Official code: JuliaReach/LazySets.jl (260 stars, last commit 2026-10-20). 1 more implementation below.

Abstract

Deep neural networks are widely used for nonlinear function approximation with applications ranging from computer vision to control. Although these networks involve the composition of simple arithmetic operations, it can be very challenging to verify whether a particular network satisfies certain input-output properties. This article surveys methods that have emerged recently for soundly verifying such properties. These methods borrow insights from reachability analysis, optimization, and search. We discuss fundamental differences and connections between existing algorithms. In addition, we provide pedagogical implementations of existing methods and compare them on a set of benchmark problems.

View on arXivView PDF

Code Implementations(2)

Scalable symbolic-numeric set computations in Julia

26041JuliaOct 3, 2017yesterdayNOASSERTION
calculuscomputational-geometryconvex-hullconvex-setsformal-verification+12 more
MIT

Methods to soundly verify deep neural networks

23450Julia, PythonAug 9, 20181 years agoMIT

Similar Papers

Cite this paper

@article{liu2019algorithms,
  title  = {Algorithms for Verifying Deep Neural Networks},
  author = {Changliu Liu and Tomer Arnon and Christopher Lazarus and Christopher Strong and Clark Barrett and Mykel J. Kochenderfer},
  year   = {2019},
  eprint = {1903.06758},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1903.06758}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1903.06758.svg)](https://codeofpaper.com/paper/1903.06758)

Discussion