UniCR: Universally Approximated Certified Robustness via Randomized Smoothing
Not on the map. Why?
Abstract (arXiv)
We study certified robustness of machine learning classifiers against adversarial perturbations. In particular, we propose the first universally approximated certified robustness (UniCR) framework, which can approximate the robustness certification of any input on any classifier against any ℓp perturbations with noise generated by any continuous probability distribution. Compared with the state-of-the-art certified defenses, UniCR provides many significant benefits: (1) the first universal robustness certification framework for the above 4 'any's; (2) automatic robustness certification that avoids case-by-case analysis, (3) tightness validation of certified robustness, and (4) optimality validation of noise distributions used by randomized smoothing. We conduct extensive experiments to validate the above benefits of UniCR and the advantages of UniCR over state-of-the-art certified defenses against ℓp perturbations.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 44 of its 64 references that are in the map. First posted on arXiv 5 Jul 2022.
Builds on
44 of 64 references.
References · 44
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,442
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
- 2019Square Attack: a query-efficient black-box adversarial attack via random searchcited by 682
- 2017ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Modelscited by 656
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 564
- 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 462
- 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
32 more
- 2019HopSkipJumpAttack: A Query-Efficient Decision-Based Attackcited by 328
- 2018On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Modelscited by 322
- 2018Regularisation of Neural Networks by Enforcing Lipschitz Continuitycited by 311
- 2018Certified Defenses against Adversarial Examplescited by 305
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 288
- 2018Towards Fast Computation of Certified Robustness for ReLU Networkscited by 254
- 2017Formal Verification of Piece-Wise Linear Feed-Forward Neural Networkscited by 241
- 2018Sorting out Lipschitz function approximationcited by 211
- 2018Lipschitz-Margin Training: Scalable Certification of Perturbation Invariance for Deep Neural Networkscited by 193
- 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 182
- 2018Semidefinite relaxations for certifying robustness to adversarial examplescited by 178
- 2019Certified Robustness to Adversarial Word Substitutionscited by 164
- 2020Randomized Smoothing of All Shapes and Sizescited by 146
- 2018Scaling provable adversarial defensescited by 141
- 2018A Dual Approach to Scalable Verification of Deep Networkscited by 125
- 2017Maximum Resilience of Artificial Neural Networkscited by 97
- 2019Wasserstein Adversarial Examples via Projected Sinkhorn Iterationscited by 89
- 2020On Certifying Robustness against Backdoor Attacks via Randomized Smoothingcited by 74
- 2019Tight Certificates of Adversarial Robustness for Randomly Smoothed Classifierscited by 65
- 2019Robustness Certificates for Sparse Adversarial Attacks by Randomized Ablationcited by 59
- 2020Certified Robustness of Graph Neural Networks against Adversarial Structural Perturbationcited by 57
- 2019Certified Robustness for Top-k Predictions against Adversarial Perturbations via Randomized Smoothingcited by 54
- 2018Training verified learners with learned verifierscited by 50
- 2020Black-Box Certification with Randomized Smoothing: A Functional Optimization Based Frameworkcited by 45
- 2019Provable robustness against all adversarial lp-perturbations for p≥ 1cited by 39
- 2018Adversarial Perturbations Against Real-Time Video Classification Systemscited by 32
- 2020Certified Robustness of Community Detection against Adversarial Structural Perturbation via Randomized Smoothingcited by 29
- 2018Procedural Noise Adversarial Examples for Black-Box Attacks on Deep Convolutional Networkscited by 21
- 2020Almost Tight L0-norm Certified Robustness of Top-k Predictions against Adversarial Perturbationscited by 16
- 2021Universal 3-Dimensional Perturbations for Black-Box Attacks on Video Recognition Systemscited by 14
- 2020R2DP: A Universal and Automated Approach to Optimizing the Randomization Mechanisms of Differential Privacy for Utility Metrics with No Known Optimal Distributionscited by 8
- 2022An Eye for an Eye: Defending against Gradient-based Attacks with Gradientscited by 2
Built on by
Citing papers per year: 2023: 2; 2024: 3; 2025: 4; 2026: 1.
10 papers.
- 2024Adaptive Randomized Smoothing: Certified Adversarial Robustness for Multi-Step Defencescited by 9
- 2023A Certified Radius-Guided Attack Framework to Image Segmentation Modelscited by 5
- 2023Certifiable Black-Box Attacks with Randomized Adversarial Examples: Breaking Defenses with Provable Confidencecited by 5
- 2024Privacy-preserving Universal Adversarial Defense for Black-box Modelscited by 3
- 2024Learning Robust and Privacy-Preserving Representations via Information Theorycited by 3
- 2025Reconcile Certified Robustness and Accuracy for DNN-based Smoothed Majority Vote Classifiercited by 2
- 2025PLRV-O: Advancing Differentially Private Deep Learning via Privacy Loss Random Variable Optimizationcited by 1
- 2025Towards Strong Certified Defense with Universal Asymmetric Randomizationcited by 1
- 2026Certified vs. Empirical Adversarial Robust-ness via Hybrid Convolutions with Attention Stochasticitycited by 1
- 2025Principal Eigenvalue Regularization for Improved Worst-Class Certified Robustness of Smoothed Classifierscited by 0
- 2026Certified vs. Empirical Adversarial Robust-ness via Hybrid Convolutions with Attention Stochasticity2 May 2026
- 2025Towards Strong Certified Defense with Universal Asymmetric Randomization22 Oct 2025
- 2025Reconcile Certified Robustness and Accuracy for DNN-based Smoothed Majority Vote Classifier30 Sep 2025
- 2025PLRV-O: Advancing Differentially Private Deep Learning via Privacy Loss Random Variable Optimization8 Sep 2025
- 2025Principal Eigenvalue Regularization for Improved Worst-Class Certified Robustness of Smoothed Classifiers21 Mar 2025
- 2024Learning Robust and Privacy-Preserving Representations via Information Theory15 Dec 2024
- 2024Privacy-preserving Universal Adversarial Defense for Black-box Models20 Aug 2024
- 2024Adaptive Randomized Smoothing: Certified Adversarial Robustness for Multi-Step Defences14 Jun 2024
- 2023Certifiable Black-Box Attacks with Randomized Adversarial Examples: Breaking Defenses with Provable Confidence10 Apr 2023
- 2023A Certified Radius-Guided Attack Framework to Image Segmentation Models5 Apr 2023