Robustness Against Adversarial Attacks via Learning Confined Adversarial Polytopes

Shayan Mohajer Hamidi, Linfeng Ye
1/15/2024
cs.LGcs.CR

No confident code implementation found for this paper.

Abstract

Deep neural networks (DNNs) could be deceived by generating human-imperceptible perturbations of clean samples. Therefore, enhancing the robustness of DNNs against adversarial attacks is a crucial task. In this paper, we aim to train robust DNNs by limiting the set of outputs reachable via a norm-bounded perturbation added to a clean sample. We refer to this set as adversarial polytope, and each clean sample has a respective adversarial polytope. Indeed, if the respective polytopes for all the samples are compact such that they do not intersect the decision boundaries of the DNN, then the DNN is robust against adversarial samples. Hence, the inner-working of our algorithm is based on learning \textbf{c}onfined \textbf{a}dversarial \textbf{p}olytopes (CAP). By conducting a thorough set of experiments, we demonstrate the effectiveness of CAP over existing adversarial robustness methods in improving the robustness of models against state-of-the-art attacks including AutoAttack.

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{hamidi2024robustness,
  title  = {Robustness Against Adversarial Attacks via Learning Confined Adversarial Polytopes},
  author = {Shayan Mohajer Hamidi and Linfeng Ye},
  year   = {2024},
  eprint = {2401.07991},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.07991v2}
}

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

Discussion