Certifying Model Accuracy under Distribution Shifts
Not on the map. Why?
Abstract (arXiv)
Certified robustness in machine learning has primarily focused on adversarial perturbations of the input with a fixed attack budget for each point in the data distribution. In this work, we present provable robustness guarantees on the accuracy of a model under bounded Wasserstein shifts of the data distribution. We show that a simple procedure that randomizes the input of the model within a transformation space is provably robust to distributional shifts under the transformation. Our framework allows the datum-specific perturbation size to vary across different points in the input distribution and is general enough to include fixed-sized perturbations as well. Our certificates produce guaranteed lower bounds on the performance of the model for any (natural or adversarial) shift of the input distribution within a Wasserstein ball around the original distribution. We apply our technique to: (i) certify robustness against natural (non-adversarial) transformations of images such as color shifts, hue shifts and changes in brightness and saturation, (ii) certify robustness against adversarial shifts of the input distribution, and (iii) show provable lower bounds (hardness results) on the performance of models trained on so-called "unlearnable" datasets that have been poisoned to interfere with model training.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 52 of its 63 references that are in the map. First posted on arXiv 28 Jan 2022.
Builds on
52 of 63 references.
References · 52
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,268
- 2017Evasion Attacks against Machine Learning at Test Timecited by 689
- 2019Adversarial Training for Free!cited by 643
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 567
- 2017Adversarial Examples Are Not Easily Detected: Bypassing Ten Detection Methodscited by 546
- 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 468
38 more
- 2020Measuring Robustness to Natural Distribution Shifts in Image Classificationcited by 454
- 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
- 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 330
- 2018On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Modelscited by 328
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 282
- 2018Generalisation in humans and deep neural networkscited by 237
- 2018Adversarial Risk and the Dangers of Evaluating Against Weak Attackscited by 221
- 2018Adversarial Robustness Toolbox v1.0.0cited by 215
- 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 214
- 2018Why do deep convolutional networks generalize so poorly to small image transformations?cited by 198
- 2021Unlearnable Examples: Making Personal Data Unexploitablecited by 193
- 2019Adversarial Training and Robustness for Multiple Perturbationscited by 183
- 2018Certified Adversarial Robustness with Additive Noisecited by 180
- 2018Semidefinite relaxations for certifying robustness to adversarial examplescited by 179
- 2018Strike (with) a Pose: Neural Networks Are Easily Fooled by Strange Poses of Familiar Objectscited by 143
- 2020Adversarial Self-Supervised Contrastive Learningcited by 139
- 2020Perceptual Adversarial Robustness: Defense Against Unseen Threat Modelscited by 137
- 2016Understanding How Image Quality Affects Deep Neural Networkscited by 119
- 2020(De)Randomized Smoothing for Certifiable Defense against Patch Attackscited by 98
- 2019Wasserstein Adversarial Examples via Projected Sinkhorn Iterationscited by 89
- 2019Achieving Verified Robustness to Symbol Substitutions via Interval Bound Propagationcited by 88
- 2019Adversarial Robustness Against the Union of Multiple Perturbation Modelscited by 88
- 2019Functional Adversarial Attackscited by 82
- 2019Domain Adaptation with Asymmetrically-Relaxed Distribution Alignmentcited by 61
- 2019Robustness Certificates for Sparse Adversarial Attacks by Randomized Ablationcited by 60
- 2016Examining the Impact of Blur on Recognition by Convolutional Networkscited by 58
- 2020Certified Defense to Image Transformations via Randomized Smoothingcited by 51
- 2021Robust Contrastive Learning Using Negative Samples with Diminished Semanticscited by 43
- 2021CROP: Certifying Robust Policies for Reinforcement Learning through Functional Smoothingcited by 42
- 2020Second-Order Provable Defenses against Adversarial Attackscited by 40
- 2021Policy Smoothing for Provably Robust Reinforcement Learningcited by 40
- 2021Improved, Deterministic Smoothing for L_1 Certified Robustnesscited by 39
- 2015Manitest: Are classifiers really invariant?cited by 27
- 2017On Classification of Distorted Images with Deep Convolutional Neural Networkscited by 26
- 2019Wasserstein Smoothing: Certified Robustness against Wasserstein Adversarial Attackscited by 25
- 2019Invariance-inducing regularization using worst-case transformations suffices to boost accuracy and spatial robustnesscited by 18
- 2021Center Smoothing: Certified Robustness for Networks with Structured Outputscited by 18
- 2021Understanding the Limits of Unsupervised Domain Adaptation via Data Poisoningcited by 11
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 0; 2025: 1.
5 papers.
- 2023Can AI-Generated Text be Reliably Detected?cited by 386
- 2023Understanding the Transferability of Representations via Task-Relatednesscited by 11
- 2022On Certifying and Improving Generalization to Unseen Domainscited by 4
- 2025Robust Behavior Cloning Via Global Lipschitz Regularizationcited by 2
- 2023Provable Robustness for Streaming Models with a Sliding Windowcited by 1
- 2025Robust Behavior Cloning Via Global Lipschitz Regularization24 Jun 2025
- 2023Understanding the Transferability of Representations via Task-Relatedness3 Jul 2023
- 2023Provable Robustness for Streaming Models with a Sliding Window28 Mar 2023
- 2023Can AI-Generated Text be Reliably Detected?17 Mar 2023
- 2022On Certifying and Improving Generalization to Unseen Domains24 Jun 2022