[Re] Double Sampling Randomized Smoothing

Aryan Gupta, Sarthak Gupta, Abhay Kumar, Harsh Dugar
6/27/2023
cs.LGcs.CRmath.ST

Official code: dsgiitr/re_DSRS (3 stars, BSD-3-Clause, last commit 2023-02-03).

Abstract

This paper is a contribution to the reproducibility challenge in the field of machine learning, specifically addressing the issue of certifying the robustness of neural networks (NNs) against adversarial perturbations. The proposed Double Sampling Randomized Smoothing (DSRS) framework overcomes the limitations of existing methods by using an additional smoothing distribution to improve the robustness certification. The paper provides a clear manifestation of DSRS for a generalized family of Gaussian smoothing and a computationally efficient method for implementation. The experiments on MNIST and CIFAR-10 demonstrate the effectiveness of DSRS, consistently certifying larger robust radii compared to other methods. Also various ablations studies are conducted to further analyze the hyperparameters and effect of adversarial training methods on the certified radius by the proposed framework.

View on arXivView PDF

Code Implementations(1)

BSD-3-Clause
31Shell, PythonFeb 1, 20233 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{gupta2023re,
  title  = {[Re] Double Sampling Randomized Smoothing},
  author = {Aryan Gupta and Sarthak Gupta and Abhay Kumar and Harsh Dugar},
  year   = {2023},
  eprint = {2306.15221},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.15221v1}
}

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

Discussion