Revisiting Differential Verification: Equivalence Verification with Confidence

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Teuber, Samuel, Kern, Philipp, Janzen, Marvin, Beckert, Bernhard
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913938159960064
author Teuber, Samuel
Kern, Philipp
Janzen, Marvin
Beckert, Bernhard
author_facet Teuber, Samuel
Kern, Philipp
Janzen, Marvin
Beckert, Bernhard
contents When validated neural networks (NNs) are pruned (and retrained) before deployment, it is desirable to prove that the new NN behaves equivalently to the (original) reference NN. To this end, our paper revisits the idea of differential verification which performs reasoning on differences between NNs: On the one hand, our paper proposes a novel abstract domain for differential verification admitting more efficient reasoning about equivalence. On the other hand, we investigate empirically and theoretically which equivalence properties are (not) efficiently solved using differential reasoning. Based on the gained insights, and following a recent line of work on confidence-based verification, we propose a novel equivalence property that is amenable to Differential Verification while providing guarantees for large parts of the input space instead of small-scale guarantees constructed w.r.t. predetermined input points. We implement our approach in a new tool called VeryDiff and perform an extensive evaluation on numerous old and new benchmark families, including new pruned NNs for particle jet classification in the context of CERN's LHC where we observe median speedups >300x over the State-of-the-Art verifier alpha,beta-CROWN.
format Preprint
id arxiv_https___arxiv_org_abs_2410_20207
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Revisiting Differential Verification: Equivalence Verification with Confidence
Teuber, Samuel
Kern, Philipp
Janzen, Marvin
Beckert, Bernhard
Machine Learning
Logic in Computer Science
When validated neural networks (NNs) are pruned (and retrained) before deployment, it is desirable to prove that the new NN behaves equivalently to the (original) reference NN. To this end, our paper revisits the idea of differential verification which performs reasoning on differences between NNs: On the one hand, our paper proposes a novel abstract domain for differential verification admitting more efficient reasoning about equivalence. On the other hand, we investigate empirically and theoretically which equivalence properties are (not) efficiently solved using differential reasoning. Based on the gained insights, and following a recent line of work on confidence-based verification, we propose a novel equivalence property that is amenable to Differential Verification while providing guarantees for large parts of the input space instead of small-scale guarantees constructed w.r.t. predetermined input points. We implement our approach in a new tool called VeryDiff and perform an extensive evaluation on numerous old and new benchmark families, including new pruned NNs for particle jet classification in the context of CERN's LHC where we observe median speedups >300x over the State-of-the-Art verifier alpha,beta-CROWN.
title Revisiting Differential Verification: Equivalence Verification with Confidence
topic Machine Learning
Logic in Computer Science
url https://arxiv.org/abs/2410.20207