Efficient Statistical Assessment of Neural Network Corruption Robustness
Karim Tit, Teddy Furon, Mathias Rousset
Abstract
We quantify the robustness of a trained network to input uncertainties with a stochastic simulation inspired by the field of Statistical Reliability Engineering. The robustness assessment is cast as a statistical hypothesis test: the network is deemed as locally robust if the estimated probability of failure is lower than a critical level. The procedure is based on an Importance Splitting simulation generating samples of rare events. We derive theoretical guarantees that are nonasymptotic w.r.t. sample size. Experiments tackling large scale networks outline the efficiency of our method making a low number of calls to the network function.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Efficiently Answering Durability Prediction QueriesJunyang Gao, Yifan Xu, Pankaj K. Agarwal, Jun YangSIGMOD 2021 · 3 citations
- Defense Through Diverse DirectionsChristopher M. Bender, Yang Li, Yifeng Shi, Michael K. Reiter et al.ICML 2020 · 4 citations
- Probably Approximately Global Robustness CertificationPeter Blohm, Patrick Indri, Thomas Gärtner, Sagar MalhotraICML 2025
- Quantitative Verification of Neural Networks and Its Security ApplicationsTeodora Baluta, Shiqi Shen, Shweta Shinde, Kuldeep S. Meel et al.CCS 2019 · 115 citations
- Frequentist Uncertainty in Recurrent Neural Networks via Blockwise Influence FunctionsAhmed M. Alaa, Mihaela van der SchaarICML 2020 · 26 citations
