UniCR: Universally Approximated Certified Robustness via Randomized Smoothing

Hanbin Hong, Binghui Wang, Yuan Hong
7/5/2022
cs.LG

No confident code implementation found for this paper.

Abstract

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 $\ell_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 $\ell_p$ perturbations.

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{hong2022unicr,
  title  = {UniCR: Universally Approximated Certified Robustness via Randomized Smoothing},
  author = {Hanbin Hong and Binghui Wang and Yuan Hong},
  year   = {2022},
  eprint = {2207.02152},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.02152v2}
}

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

Discussion