mlsanityData to 7 Oct 2026

Double Bubble, Toil and Trouble: Enhancing Certified Robustness through Transitivity

arXiv 2210.06077 ↗First posted 12 Oct 2022cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

In response to subtle adversarial examples flipping classifications of neural network models, recent research has promoted certified robustness as a solution. There, invariance of predictions to all norm-bounded attacks is achieved through randomised smoothing of network inputs. Today's state-of-the-art certifications make optimal use of the class output scores at the input instance under test: no better radius of certification (under the L2 norm) is possible given only these score. However, it is an open question as to whether such lower bounds can be improved using local information around the instance under test. In this work, we demonstrate how today's "optimal" certificates can be improved by exploiting both the transitivity of certifications, and the geometry of the input space, giving rise to what we term Geometrically-Informed Certified Robustness. By considering the smallest distance to points on the boundary of a set of certifications this approach improves certifications for more than 80% of Tiny-Imagenet instances, yielding an on average 5 % increase in the associated certification. When incorporating training time processes that enhance the certified radius, our technique shows even more promising results, with a uniform 4 percentage point increase in the achieved certified radius.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 27 of its 50 references that are in the map. First posted on arXiv 12 Oct 2022.

Builds on

27 of 50 references.

References · 27

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  4. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  5. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  6. 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
  7. 2016Practical Black-Box Attacks against Machine Learningcited by 893
  8. 2017Evasion Attacks against Machine Learning at Test Timecited by 686
  9. 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 462
  10. 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
  11. 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 328
  12. 2018Towards Fast Computation of Certified Robustness for ReLU Networkscited by 254
15 more
  1. 2021Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verificationcited by 224
  2. 2018Certified Adversarial Robustness with Additive Noisecited by 178
  3. 2019A Convex Relaxation Barrier to Tight Robustness Verification of Neural Networkscited by 124
  4. 2020MACER: Attack-free and Scalable Robust Training via Maximizing Certified Radiuscited by 114
  5. 2020Certified Defenses for Adversarial Patchescited by 100
  6. 2020(De)Randomized Smoothing for Certifiable Defense against Patch Attackscited by 97
  7. 2021A Study of Face Obfuscation in ImageNetcited by 83
  8. 2018Motivating the Rules of the Game for Adversarial Example Researchcited by 57
  9. 2020TSS: Transformation-Specific Smoothing for Robustness Certificationcited by 49
  10. 2021Fast Certified Robust Training with Short Warmupcited by 45
  11. 2020Higher-Order Certification for Randomized Smoothingcited by 36
  12. 2022Double Sampling Randomized Smoothingcited by 22
  13. 2021Towards Evaluating and Training Verifiably Robust Neural Networkscited by 15
  14. 2022TPC: Transformation-Specific Smoothing for Point Cloud Modelscited by 10
  15. 2016Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetrycited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 4; 2024: 3; 2025: 5; 2026: 3.

15 papers.

Sort:

By area: