Pith. Sign in

RECORD

VNN: Verification-Friendly Neural Networks with Hard Robustness Guarantees

Machine Learning · Submitted 15 Dec 2023

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim This essentially enables us to establish robustness for more VNNs than their DNN counterparts, in a time-efficient manner.

how it is stated · asserted 0.92 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2312.09748 (version 2)
Pith IDBMMB7VBC, Pith's permanent record of this paper and its review
CitationAhmed Rezine, Amir Aminifar, Anahita Baninajjar. "VNN: Verification-Friendly Neural Networks with Hard Robustness Guarantees." arXiv:2312.09748 (2023). https://pith.science/paper/BMMB7VBC
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,117 input tokens.

What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.15 · human participants 0.03 · controlled comparison 0.65 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.63 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

Machine learning techniques often lack formal correctness guarantees, evidenced by the widespread adversarial examples that plague most deep-learning applications. This lack of formal guarantees resulted in several research efforts that aim at verifying Deep Neural Networks (DNNs), with a particular focus on safety-critical applications. However, formal verification techniques still face major scalability and precision challenges. The over-approximation introduced during the formal verification process to tackle the scalability challenge often results in inconclusive analysis. To address this challenge, we propose a novel framework to generate Verification-Friendly Neural Networks (VNNs). We present a post-training optimization framework to achieve a balance between preserving prediction performance and verification-friendliness. Our proposed framework results in VNNs that are comparable to the original DNNs in terms of prediction performance, while amenable to formal verification techniques. This essentially enables us to establish robustness for more VNNs than their DNN counterparts, in a time-efficient manner.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Machine learning techniques often lack formal correctness guarantees, evidenced by the widespread adversarial examples that plague most deep-learning applications. background 1.00 0.05 0.02 asserted 0.99
s1 This lack of formal guarantees resulted in several research efforts that aim at verifying Deep Neural Networks (DNNs), with a particular focus on safety-critical applications. background 1.00 0.05 0.03 asserted 1.00
s2 However, formal verification techniques still face major scalability and precision challenges. background 0.72 0.06 0.02 asserted 1.00
s3 The over-approximation introduced during the formal verification process to tackle the scalability challenge often results in inconclusive analysis. background 0.79 0.07 0.02 asserted 0.93
s4 To address this challenge, we propose a novel framework to generate Verification-Friendly Neural Networks (VNNs). contribution 1.00 0.86 0.11 asserted 0.99
s5 We present a post-training optimization framework to achieve a balance between preserving prediction performance and verification-friendliness. method 0.80 0.82 0.10 asserted 0.99
s6 Our proposed framework results in VNNs that are comparable to the original DNNs in terms of prediction performance, while amenable to formal verification techniques. result 0.96 0.91 0.45 asserted 1.00
s7 This essentially enables us to establish robustness for more VNNs than their DNN counterparts, in a time-efficient manner. interpretation 0.64 0.84 0.62 asserted 0.92

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from argument 0.54.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Machine learning techniques often lack formal correctness guarantees, evidenced by the widespread adversarial examples that plague most deep-learning applications. This lack of formal guarantees resulted in several research efforts that aim at verifying Deep Neural Networks (DNNs), with a particular focus on safety-critical applications. However, formal verification techniques still face major scalability and precision challenges. The over-approximation introduced during the formal verification process to tackle the scalability challenge often results in inconclusive analysis. To address this challenge, we propose a novel framework to generate Verification-Friendly Neural Networks (VNNs). We present a post-training optimization framework to achieve a balance between preserving prediction performance and verification-friendliness. Our proposed framework results in VNNs that are comparable to the original DNNs in terms of prediction performance, while amenable to formal verification techniques. This essentially enables us to establish robustness for more VNNs than their DNN counterparts, in a time-efficient manner.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 1 sentence without a confident label

Cites as background 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.