Pith. sign in

REVIEW 1 cited by

Verifying Global Two-Safety Properties in Neural Networks with Confidence

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 2405.14400 v3 pith:67DYIZZG submitted 2024-05-23 cs.LO

classification cs.LO
keywords analysisglobalnetworksneuralverificationautomatedpropertiessafety
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present the first automated verification technique for confidence-based 2-safety properties, such as global robustness and global fairness, in deep neural networks (DNNs). Our approach combines self-composition to leverage existing reachability analysis techniques and a novel abstraction of the softmax function, which is amenable to automated verification. We characterize and prove the soundness of our static analysis technique. Furthermore, we implement it on top of Marabou, a safety analysis tool for neural networks, conducting a performance evaluation on several publicly available benchmarks for DNN verification.

Discussion (0). Continue with ORCID 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. Neural Network Verification is a Programming Language Challenge

    cs.PL 2025-01 conditional novelty 4.0 of 10

    Neural network verification's hardest open problems are reframed as programming language design challenges, with a unified dependently typed language proposed as the ideal solution.

Pith tools