Adaptive Randomized Smoothing: Certified Adversarial Robustness for Multi-Step Defences

Saiyue Lyu, Shadab Shaikh, Frederick Shpilevskiy, Evan Shelhamer, Mathias Lécuyer
6/14/2024
cs.LGcs.CR

Official code: ubc-systopia/adaptive-randomized-smoothing (4 stars, MIT, last commit 2025-07-10).

Abstract

We propose Adaptive Randomized Smoothing (ARS) to certify the predictions of our test-time adaptive models against adversarial examples. ARS extends the analysis of randomized smoothing using $f$-Differential Privacy to certify the adaptive composition of multiple steps. For the first time, our theory covers the sound adaptive composition of general and high-dimensional functions of noisy inputs. We instantiate ARS on deep image classification to certify predictions against adversarial examples of bounded $L_{\infty}$ norm. In the $L_{\infty}$ threat model, ARS enables flexible adaptation through high-dimensional input-dependent masking. We design adaptivity benchmarks, based on CIFAR-10 and CelebA, and show that ARS improves standard test accuracy by $1$ to $15\%$ points. On ImageNet, ARS improves certified test accuracy by up to $1.6\%$ points over standard RS without adaptivity. Our code is available at https://github.com/ubc-systopia/adaptive-randomized-smoothing .

View on arXivView PDF

Code Implementations(1)

MIT
41Shell, PythonOct 8, 20241 years agoMIT

Similar Papers

Cite this paper

@article{lyu2024adaptive,
  title  = {Adaptive Randomized Smoothing: Certified Adversarial Robustness for Multi-Step Defences},
  author = {Saiyue Lyu and Shadab Shaikh and Frederick Shpilevskiy and Evan Shelhamer and Mathias Lécuyer},
  year   = {2024},
  eprint = {2406.10427},
  archivePrefix = {arXiv},
  doi    = {10.52202/079017-4260},
  url    = {http://arxiv.org/abs/2406.10427v3},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.10427.svg)](https://codeofpaper.com/paper/2406.10427)

Discussion