paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Incremental Verification of Neural Networks

神经网络的增量验证
PLDI 7(PLDI)2023匹配度 4/10 · 该论文属于程序验证与机器学习交叉,涉及神经网络验证的增量算法和工具实现,与用户对形式化验证/静态分析的兴趣有部分重叠;但它不涉及 LLM/Agentic 程序、LLM 辅助验证、浮点程序分析或贝叶斯程序分析,也不是用户当前核心的 PL↔AI 方向。引用 19 inbox
Shubham Ugare, Debangshu Banerjee, Sasa Misailovic, Gagandeep Singh
crossref: 2026-09-10

AI 速览

一句话:提出增量且完备的 DNN 验证框架与工具 IVAN,避免网络更新后从头验证并显著加速。

深度神经网络(DNN)的完备验证能精确判定其在无限输入集上是否满足鲁棒性、公平性等可信属性,但当已部署的 DNN 因提升推理速度或精度而被更新时,现有验证器往往需要从头运行,效率低下。本文提出一种通用的增量且完备的 DNN 验证框架,设计了新的理论、数据结构与算法,并在工具 IVAN 中实现。实验表明,在挑战性的 MNIST 和 CIFAR10 分类器上,该方法相比当前最优基线取得 2.4 倍的几何平均加速;在 ACAS-XU 分类器上取得 3.8 倍的几何平均加速。

问题
完备 DNN 验证在 DNN 更新后需从头重跑,导致部署模型迭代时验证效率低下。
方法
提出通用增量完备验证框架,包含新理论、数据结构与算法,并实现工具 IVAN。
评估
在 MNIST/CIFAR10 与 ACAS-XU 分类器上与 SOTA 基线比较,分别获得 2.4x 和 3.8x 的几何平均加速。
原文摘要(Abstract)

Complete verification of deep neural networks (DNNs) can exactly determine whether the DNN satisfies a desired trustworthy property (e.g., robustness, fairness) on an infinite set of inputs or not. Despite the tremendous progress to improve the scalability of complete verifiers over the years on individual DNNs, they are inherently inefficient when a deployed DNN is updated to improve its inference speed or accuracy. The inefficiency is because the expensive verifier needs to be run from scratch on the updated DNN. To improve efficiency, we propose a new, general framework for incremental and complete DNN verification based on the design of novel theory, data structure, and algorithms. Our contributions implemented in a tool named IVAN yield an overall geometric mean speedup of 2.4x for verifying challenging MNIST and CIFAR10 classifiers and a geometric mean speedup of 3.8x for the ACAS-XU classifiers over the state-of-the-art baselines.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot1946,
  title = {Incremental Verification of Neural Networks},
  author = {Shubham Ugare and Debangshu Banerjee and Sasa Misailovic and Gagandeep Singh},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {7},
  number = {PLDI},
  year = {2023},
  doi = {10.1145/3591299}
}