Localized Randomized Smoothing for Collective Robustness Certification
Not on the map. Why?
Abstract (arXiv)
Models for image segmentation, node classification and many other tasks map a single input to multiple labels. By perturbing this single shared input (e.g. the image) an adversary can manipulate several predictions (e.g. misclassify several pixels). Collective robustness certification is the task of provably bounding the number of robust predictions under this threat model. The only dedicated method that goes beyond certifying each output independently is limited to strictly local models, where each prediction is associated with a small receptive field. We propose a more general collective robustness certificate for all types of models. We further show that this approach is beneficial for the larger class of softly local models, where each output is dependent on the entire input but assigns different levels of importance to different input regions (e.g. based on their proximity in the image). The certificate is based on our novel localized randomized smoothing approach, where the random perturbation strength for different input regions is proportional to their importance for the outputs. Localized smoothing Pareto-dominates existing certificates on both image segmentation and node classification tasks, simultaneously offering higher accuracy and stronger certificates.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 33 of its 63 references that are in the map. First posted on arXiv 28 Oct 2022.
Builds on
33 of 63 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2013Intriguing properties of neural networkscited by 5,114
- 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,427
- 2017Rethinking Atrous Convolution for Semantic Image Segmentationcited by 2,154
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
- 2018Albumentations: fast and flexible image augmentationscited by 558
- 2017Understanding the Effective Receptive Field in Deep Convolutional Neural Networkscited by 549
- 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 462
21 more
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
- 2017Synthetic and Natural Noise Both Break Neural Machine Translationcited by 304
- 2017Adversarial Examples for Semantic Segmentation and Object Detectioncited by 275
- 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
- 2018Certified Adversarial Robustness with Additive Noisecited by 178
- 2020(De)Randomized Smoothing for Certifiable Defense against Patch Attackscited by 97
- 2020Robustness Verification for Transformerscited by 76
- 2019Tight Certificates of Adversarial Robustness for Randomly Smoothed Classifierscited by 65
- 2019Certifiable Robustness to Graph Perturbationscited by 62
- 2019Certifiable Robustness and Robust Training for Graph Convolutional Networkscited by 59
- 2020Efficient Robustness Certificates for Discrete Data: Sparsity-Aware Randomized Smoothing for Graphs, Images and Morecited by 56
- 2020Certified Defense to Image Transformations via Randomized Smoothingcited by 51
- 2021SparseBERT: Rethinking the Importance Analysis in Self-attentioncited by 46
- 2020Black-Box Certification with Randomized Smoothing: A Functional Optimization Based Frameworkcited by 45
- 2019POPQORN: Quantifying Robustness of Recurrent Neural Networkscited by 36
- 2020Certifying Confidence via Randomized Smoothingcited by 36
- 2021Scalable Certified Segmentation via Randomized Smoothingcited by 35
- 2021ANCER: Anisotropic Certification via Sample-wise Volume Maximizationcited by 23
- 2020Scalable Polyhedral Verification of Recurrent Neural Networkscited by 20
- 2022On Collective Robustness of Bagging Against Data Poisoningcited by 16
- 2022Certified Defences Against Adversarial Patch Attacks on Semantic Segmentationcited by 15
Built on by
Citing papers per year: 2023: 3; 2024: 3; 2025: 3; 2026: 1.
10 papers.
- 2024A Probabilistic Perspective on Unlearning and Alignment for Large Language Modelscited by 21
- 2023Hierarchical Randomized Smoothingcited by 9
- 2023Node-aware Bi-smoothing: Certified Robustness against Graph Injection Attackscited by 8
- 2023Rethinking Randomized Smoothing from the Perspective of Scalabilitycited by 3
- 2024Collective Certified Robustness against Graph Injection Attackscited by 3
- 2024Discrete Randomized Smoothing Meets Quantum Computingcited by 2
- 2025Effective Data Pruning through Score Extrapolationcited by 2
- 2025AuditVotes: Elevating Provable Defense for GNNs with Efficient Augmentation and Conditional Smoothingcited by 1
- 2025Fast and Flexible Robustness Certificates for Semantic Segmentationcited by 1
- 2026PDA: Text-Augmented Defense Framework for Robust Vision-Language Models against Adversarial Image Attackscited by 0
- 2026PDA: Text-Augmented Defense Framework for Robust Vision-Language Models against Adversarial Image Attacks1 Apr 2026
- 2025Fast and Flexible Robustness Certificates for Semantic Segmentation3 Dec 2025
- 2025Effective Data Pruning through Score Extrapolation10 Jun 2025
- 2025AuditVotes: Elevating Provable Defense for GNNs with Efficient Augmentation and Conditional Smoothing29 Mar 2025
- 2024A Probabilistic Perspective on Unlearning and Alignment for Large Language Models4 Oct 2024
- 2024Discrete Randomized Smoothing Meets Quantum Computing1 Aug 2024
- 2024Collective Certified Robustness against Graph Injection Attacks3 Mar 2024
- 2023Rethinking Randomized Smoothing from the Perspective of Scalability19 Dec 2023
- 2023Node-aware Bi-smoothing: Certified Robustness against Graph Injection Attacks7 Dec 2023
- 2023Hierarchical Randomized Smoothing24 Oct 2023