English

Certified Robustness for Top-k Predictions against Adversarial Perturbations via Randomized Smoothing

Machine Learning 2019-12-23 v1 Cryptography and Security Machine Learning

Abstract

It is well-known that classifiers are vulnerable to adversarial perturbations. To defend against adversarial perturbations, various certified robustness results have been derived. However, existing certified robustnesses are limited to top-1 predictions. In many real-world applications, top-kk predictions are more relevant. In this work, we aim to derive certified robustness for top-kk predictions. In particular, our certified robustness is based on randomized smoothing, which turns any classifier to a new classifier via adding noise to an input example. We adopt randomized smoothing because it is scalable to large-scale neural networks and applicable to any classifier. We derive a tight robustness in 2\ell_2 norm for top-kk predictions when using randomized smoothing with Gaussian noise. We find that generalizing the certified robustness from top-1 to top-kk predictions faces significant technical challenges. We also empirically evaluate our method on CIFAR10 and ImageNet. For example, our method can obtain an ImageNet classifier with a certified top-5 accuracy of 62.8\% when the 2\ell_2-norms of the adversarial perturbations are less than 0.5 (=127/255). Our code is publicly available at: \url{https://github.com/jjy1994/Certify_Topk}.

Keywords

Cite

@article{arxiv.1912.09899,
  title  = {Certified Robustness for Top-k Predictions against Adversarial Perturbations via Randomized Smoothing},
  author = {Jinyuan Jia and Xiaoyu Cao and Binghui Wang and Neil Zhenqiang Gong},
  journal= {arXiv preprint arXiv:1912.09899},
  year   = {2019}
}

Comments

ICLR 2020, code is available at this: https://github.com/jjy1994/Certify_Topk