Pith. sign in

REVIEW 1 cited by

Algorithms for Verifying Deep Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.06758 v2 pith:Q4SEWI2C submitted 2019-03-15 cs.LG stat.ML

classification cs.LGstat.ML
keywords methodsnetworksalgorithmsdeepexistingneuralpropertiesverifying
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Verifiable Safety Q-Filters via Hamilton-Jacobi Reachability and Multiplicative Q-Networks

    cs.LG 2025-05 reject novelty 5.0 of 10

    Learned Q-function safety filters are certified by verifying two sufficient conditions with a mixed-integer optimizer, using a multiplicative Q-network to prevent safe-set collapse during fine-tuning.

Pith tools