Testing robustness of predictions of trained classifiers against naturally occurring perturbations
Not on the map. Why?
Abstract (arXiv)
Correctly quantifying the robustness of machine learning models is a central aspect in judging their suitability for specific tasks, and ultimately, for generating trust in them. We address the problem of finding the robustness of individual predictions. We show both theoretically and with empirical examples that a method based on counterfactuals that was previously proposed for this is insufficient, as it is not a valid metric for determining the robustness against perturbations that occur ``naturally'', outside specific adversarial attack scenarios. We propose a flexible approach that models possible perturbations in input data individually for each application. This is then combined with a probabilistic approach that computes the likelihood that a ``real-world'' perturbation will change a prediction, thus giving quantitative information of the robustness of individual predictions of the trained machine learning model. The method does not require access to the internals of the classifier and thus in principle works for any black-box model. It is, however, based on Monte-Carlo sampling and thus only suited for input spaces with small dimensions. We illustrate our approach on the Iris and the Ionosphere datasets, on an application predicting fog at an airport, and on analytically solvable cases.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 33 of its 64 references that are in the map. First posted on arXiv 21 Apr 2022.
Builds on
33 of 64 references.
References · 33
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2013Intriguing properties of neural networkscited by 5,114
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
- 2016Adversarial examples in the physical worldcited by 1,762
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
- 2020In Search of Lost Domain Generalizationcited by 1,042
- 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
- 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 897
21 more
- 2021Generalized Out-of-Distribution Detection: A Surveycited by 796
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
- 2017Evasion Attacks against Machine Learning at Test Timecited by 686
- 2013Domain Generalization via Invariant Feature Representationcited by 622
- 2020Captum: A unified and generic model interpretability library for PyTorchcited by 542
- 2020Measuring Robustness to Natural Distribution Shifts in Image Classificationcited by 452
- 2017Wild Patterns: Ten Years After the Rise of Adversarial Machine Learningcited by 411
- 2016Safety Verification of Deep Neural Networkscited by 262
- 2018Adversarial Robustness Toolbox v1.0.0cited by 214
- 2018Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approachcited by 181
- 2019A Meta-Transfer Objective for Learning to Disentangle Causal Mechanismscited by 158
- 2019Learning Model-Agnostic Counterfactual Explanations for Tabular Datacited by 146
- 2018Explaining Explanations in AIcited by 136
- 2021CARLA: A Python Library to Benchmark Algorithmic Recourse and Counterfactual Explanation Algorithmscited by 85
- 2016A Boundary Tilting Persepective on the Phenomenon of Adversarial Examplescited by 70
- 2017Robust Physical-World Attacks on Deep Learning Modelscited by 70
- 2017Feature-Guided Black-Box Safety Testing of Deep Neural Networkscited by 48
- 2020The Intriguing Relation Between Counterfactual Explanations and Adversarial Examplescited by 44
- 2019Accurate, reliable and fast robustness evaluationcited by 43
- 2017Security Evaluation of Pattern Classifiers under Attackcited by 39
- 2021An Information-theoretic Approach to Distribution Shiftscited by 25
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.