paperbot · PL 论文追踪

全部论文 待读 收藏

P1 Input-Relational Verification of Deep Neural Networks

深度神经网络的输入关系验证
PLDI 8(PLDI)2024匹配度 5/10 · 论文将抽象解释/程序分析用于 DNN 输入关系验证,属于 PL 与机器学习交叉,且兼具抽象域设计与工程实现;但它不涉及 Agentic/LLM 程序、浮点程序分析或贝叶斯程序分析,与当前追踪的核心问题只部分重合。引用 14 inbox
Debangshu Banerjee, Changming Xu, Gagandeep Singh
dblp: 2026-09-10crossref: 2026-09-10

AI 速览

一句话:提出差分跟踪与 DiffPoly 抽象域,实现高精度可扩展的 DNN 输入关系验证器 RaVeN。

论文关注深度神经网络(DNN)上的输入关系性质验证,如对通用对抗扰动的鲁棒性、单调性等。这类性质需要同时推理同一 DNN 的多次执行,而非单次执行的输入-输出约束,因此现有方法精度不足。作者提出“差分跟踪”(difference tracking)这一新概念,在每一层上计算同一 DNN 两次执行输出之间的差异,并为此设计新的抽象域 DiffPoly,使其能够扩展到大型网络。DiffPoly 配备了针对常见激活函数(ReLU、Tanh、Sigmoid 等)与仿射层的定制抽象变换器,可生成精确的跨执行线性约束。作者基于该抽象域与线性规划公式实现了验证器 RaVeN,可处理多种输入关系性质。在多个数据集、网络和性质的挑战性基准上,RaVeN 借助跨执行精确线性约束,精度显著优于基线方法。

问题
如何在 DNN 上精确验证需要同时考虑同一网络多次执行的输入关系性质(如对通用对抗扰动的鲁棒性、单调性),而现有方法难以兼顾精度与可扩展性。
方法
提出差分跟踪,在每一层计算同一 DNN 两次执行输出的差异;设计抽象域 DiffPoly 及其针对常见激活函数与仿射层的抽象变换器,生成精确的跨执行线性约束,并结合线性规划公式构建验证器 RaVeN。
评估
在多种数据集、网络架构与输入关系性质的挑战性基准上,将 RaVeN 与基线验证方法进行对比,结果表明其精度有实质性提升。
原文摘要(Abstract)

We consider the verification of input-relational properties defined over deep neural networks (DNNs) such as robustness against universal adversarial perturbations, monotonicity, etc. Precise verification of these properties requires reasoning about multiple executions of the same DNN. We introduce a novel concept of difference tracking to compute the difference between the outputs of two executions of the same DNN at all layers. We design a new abstract domain, DiffPoly for efficient difference tracking that can scale large DNNs. DiffPoly is equipped with custom abstract transformers for common activation functions (ReLU, Tanh, Sigmoid, etc.) and affine layers and can create precise linear cross-execution constraints. We implement an input-relational verifier for DNNs called RaVeN which uses DiffPoly and linear program formulations to handle a wide range of input-relational properties. Our experimental results on challenging benchmarks show that by leveraging precise linear constraints defined over multiple executions of the DNN, RaVeN gains substantial precision over baselines on a wide range of datasets, networks, and input-relational properties.

链接与引用

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

BibTeX
@article{BanerjeeXS24,
  title = {Input-Relational Verification of Deep Neural Networks},
  author = {Debangshu Banerjee and Changming Xu and Gagandeep Singh},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {8},
  number = {PLDI},
  year = {2024},
  doi = {10.1145/3656377}
}