Sound Randomized Smoothing in Floating-Point Arithmetics

Václav Voráček, Matthias Hein
7/14/2022
cs.LGcs.CR

No confident code implementation found for this paper.

Abstract

Randomized smoothing is sound when using infinite precision. However, we show that randomized smoothing is no longer sound for limited floating-point precision. We present a simple example where randomized smoothing certifies a radius of $1.26$ around a point, even though there is an adversarial example in the distance $0.8$ and extend this example further to provide false certificates for CIFAR10. We discuss the implicit assumptions of randomized smoothing and show that they do not apply to generic image classification models whose smoothed versions are commonly certified. In order to overcome this problem, we propose a sound approach to randomized smoothing when using floating-point precision with essentially equal speed and matching the certificates of the standard, unsound practice for standard classifiers tested so far. Our only assumption is that we have access to a fair coin.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{vorek2022sound,
  title  = {Sound Randomized Smoothing in Floating-Point Arithmetics},
  author = {Václav Voráček and Matthias Hein},
  year   = {2022},
  eprint = {2207.07209},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.07209v2}
}

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/2207.07209.svg)](https://codeofpaper.com/paper/2207.07209)

Discussion