paperbot · PL 论文追踪

全部论文 待读 收藏

P1 Inferring Data Preconditions from Deep Learning Models for Trustworthy Prediction in Deployment

从深度学习模型中推断数据前置条件以实现部署中的可信预测
ICSE Proceedings of the IEEE/ACM 46th International Conference on Software Engineering2024匹配度 7/10 · 该论文把最弱前置条件推理、Dijkstra 谓词变换语义等程序验证/静态分析技术应用到训练好的 DNN 模型上,正属于用户关注的「PL→AI:将静态分析/形式化方法用于机器学习系统」这一主线,且兼具形式化(谓词变换语义、抽象表示归纳规则)与工程实现(29 个真实模型、与 SOTA SelfChecker 对比、工业可用的运行时开销),并提供了可量化 benchmark 与失效对比。但它不涉及 LLM/Agentic 程序、浮点程序分析与贝叶斯程序分析,因此未命中画像的其余核心交叉点,匹配度属于中上而非正中核心。引用 3 inbox
Shibbir Ahmed, Hongyang Gao, Hridesh Rajan
crossref: 2026-09-12

AI 速览

一句话:提出 DeepInfer:将训练好的 DNN 抽象为可做最弱前置条件推理的表示,从输出后置条件推断输入前置条件,以判定部署预测的可信性。

深度学习模型在开发阶段基于特定数据假设训练,但在部署阶段会面对未见数据,因此需要判断其预测是否可信。传统软件的规格与验证方法难以处理 DNN 架构和输出结果的复杂性。本文提出 DeepInfer:为训练好的 DNN 引入一种抽象表示,使其支持基于 Dijkstra 谓词转换语义的最弱前置条件推理;通过对神经网络抽象表示的归纳类型推导规则,克服从输出层到输入层反向非线性计算中的矩阵维度问题;并利用不同激活函数的规则,从最终输出的后置条件逐层计算前置条件。作者在来自五个数据源的四个数据集上、29 个真实 DNN 模型上评估,DeepInfer 以高召回率 0.98 和高 F-1 分数 0.84 检测正确与错误预测,显著优于 SelfChecker;平均运行时开销仅 0.22 秒,且比 SelfChecker 快 3.27 倍。

问题
DNN 部署时面对未见数据,其预测是否可信难以判断;传统软件规格与验证方法无法处理 DNN 架构和预期输出的复杂性。
方法
DeepInfer 为训练好的 DNN 引入抽象表示,利用 Dijkstra 谓词转换语义进行最弱前置条件推理,并针对层与激活函数推导规则,从输出后置条件反向逐层计算输入前置条件。
评估
在来自五个数据源的四个数据集上的 29 个真实 DNN 模型上评估,与 SelfChecker 对比;检测正确/错误预测取得 0.98 召回率和 0.84 F-1,平均开销 0.22 秒,快 3.27 倍。
原文摘要(Abstract)

Deep learning models are trained with certain assumptions about the data during the development stage and then used for prediction in the deployment stage. It is important to reason about the trustworthiness of the model's predictions with unseen data during deployment. Existing methods for specifying and verifying traditional software are insufficient for this task, as they cannot handle the complexity of DNN model architecture and expected outcomes. In this work, we propose a novel technique that uses rules derived from neural network computations to infer data preconditions for a DNN model to determine the trustworthiness of its predictions. Our approach, DeepInfer involves introducing a novel abstraction for a trained DNN model that enables weakest precondition reasoning using Dijkstra's Predicate Transformer Semantics. By deriving rules over the inductive type of neural network abstract representation, we can overcome the matrix dimensionality issues that arise from the backward non-linear computation from the output layer to the input layer. We utilize the weakest precondition computation using rules of each kind of activation function to compute layer-wise precondition from the given postcondition on the final output of a deep neural network. We extensively evaluated DeepInfer on 29 real-world DNN models using four different datasets collected from five different sources and demonstrated the utility, effectiveness, and performance improvement over closely related work. DeepInfer efficiently detects correct and incorrect predictions of high-accuracy models with high recall (0.98) and high F-1 score (0.84) and has significantly improved over the prior technique, SelfChecker. The average runtime overhead of DeepInfer is low, 0.22 sec for all the unseen datasets. We also compared runtime overhead using the same hardware settings and found that DeepInfer is 3.27 times faster than SelfChecker, the state-of-the-art in this area.

链接与引用

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

BibTeX
@inproceedings{paperbot11379,
  title = {Inferring Data Preconditions from Deep Learning Models for Trustworthy Prediction in Deployment},
  author = {Shibbir Ahmed and Hongyang Gao and Hridesh Rajan},
  booktitle = {ICSE},
  year = {2024},
  doi = {10.1145/3597503.3623333}
}