Incremental Verification of Neural Networks
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Reproducibility Study of Product-side Fairness in Bundle Recommendation
Fairness-Aware Grouping for Continuous Sensitive Variables: Application for Debiasing Face Analysis with respect to Skin Tone
Guiding LLM Decision-Making with Fairness Reward Models
Fairness Is Not Enough: Auditing Competence and Intersectional Bias in AI-powered Resume Screening
Datasets for Fairness in Language Models: An In-Depth Survey
hyperFA*IR: A hypergeometric approach to fair rankings with finite candidate pool
토론
이 논문과 연결된 포럼 글이 아직 없습니다.