资源论文CERTIFIED ROBUSTNESS FOR TOP -k PREDICTIONSAGAINST ADVERSARIAL PERTURBATIONS VIA RAN -DOMIZED SMOOTHING

CERTIFIED ROBUSTNESS FOR TOP -k PREDICTIONSAGAINST ADVERSARIAL PERTURBATIONS VIA RAN -DOMIZED SMOOTHING

2020-01-02 | |  46 |   37 |   0

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-k predictions are more relevant. In this work, we aim to derive certified robustness for top-k 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 图片.png norm for top-k predictions when using randomized smoothing with Gaussian noise. We find that generalizing the certified robustness from top-1 to top-k 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 图片.png -norms of the adversarial perturbations are less than 0.5 (=127/255).

上一篇:SPIKE GRAD :A NANN- EQUIVALENT COMPUTA -TION MODEL FOR IMPLEMENTING BACKPROPAGA -TION WITH SPIKES

下一篇:NAS-B ENCH -1S HOT 1:B ENCHMARKING AND DISSECTINGO NE -SHOT NEURAL ARCHITECTURE SEARCH

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...