Revisiting Min-Max Optimization Problem in Adversarial Training

Sina Hajer Ahmadi, Hassan Bahrami
8/20/2024
cs.CVcs.LG

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

The rise of computer vision applications in the real world puts the security of the deep neural networks at risk. Recent works demonstrate that convolutional neural networks are susceptible to adversarial examples - where the input images look similar to the natural images but are classified incorrectly by the model. To provide a rebuttal to this problem, we propose a new method to build robust deep neural networks against adversarial attacks by reformulating the saddle point optimization problem in \cite{madry2017towards}. Our proposed method offers significant resistance and a concrete security guarantee against multiple adversaries. The goal of this paper is to act as a stepping stone for a new variation of deep learning models which would lead towards fully robust deep learning models.

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. 3 weaker matches are hidden by default — 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{ahmadi2024revisiting,
  title  = {Revisiting Min-Max Optimization Problem in Adversarial Training},
  author = {Sina Hajer Ahmadi and Hassan Bahrami},
  year   = {2024},
  eprint = {2408.11218},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.11218v1}
}

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

Discussion