Data-Driven Certification of Neural Networks with Random Input Noise
Not on the map. Why?
Abstract (arXiv)
Methods to certify the robustness of neural networks in the presence of input uncertainty are vital in safety-critical settings. Most certification methods in the literature are designed for adversarial or worst-case inputs, but researchers have recently shown a need for methods that consider random input noise. In this paper, we examine the setting where inputs are subject to random noise coming from an arbitrary probability distribution. We propose a robustness certification method that lower-bounds the probability that network outputs are safe. This bound is cast as a chance-constrained optimization problem, which is then reformulated using input-output samples to make the optimization constraints tractable. We develop sufficient conditions for the resulting optimization to be convex, as well as on the number of samples needed to make the robustness bound hold with overwhelming probability. We show for a special case that the proposed optimization reduces to an intuitive closed-form solution. Case studies on synthetic, MNIST, and CIFAR-10 networks experimentally demonstrate that this method is able to certify robustness against various input noise regimes over larger uncertainty regions than prior state-of-the-art techniques.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 2; 2024: 0; 2025: 1.
8 papers.
- 2023Improving the Accuracy-Robustness Trade-Off of Classifiers via Adaptive Smoothingcited by 18
- 2022Efficient Global Optimization of Two-Layer ReLU Networks: Quadratic-Time Algorithms and Adversarial Trainingcited by 15
- 2022Probabilistic Verification of ReLU Neural Networks via Characteristic Functionscited by 5
- 2021Practical Convex Formulation of Robust One-hidden-layer Neural Network Trainingcited by 4
- 2021Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certificationcited by 2
- 2023Mixing Classifiers to Alleviate the Accuracy-Robustness Trade-Offcited by 2
- 2022An Overview and Prospective Outlook on Robust Training and Certification of Machine Learning Modelscited by 1
- 2025BaB-prob: Branch and Bound with Preactivation Splitting for Probabilistic Verification of Neural Networkscited by 0
- 2025BaB-prob: Branch and Bound with Preactivation Splitting for Probabilistic Verification of Neural Networks30 Sep 2025
- 2023Mixing Classifiers to Alleviate the Accuracy-Robustness Trade-Off26 Nov 2023
- 2023Improving the Accuracy-Robustness Trade-Off of Classifiers via Adaptive Smoothing29 Jan 2023
- 2022Probabilistic Verification of ReLU Neural Networks via Characteristic Functions3 Dec 2022
- 2022An Overview and Prospective Outlook on Robust Training and Certification of Machine Learning Models15 Aug 2022
- 2022Efficient Global Optimization of Two-Layer ReLU Networks: Quadratic-Time Algorithms and Adversarial Training6 Jan 2022
- 2021Practical Convex Formulation of Robust One-hidden-layer Neural Network Training25 May 2021
- 2021Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification22 Jan 2021