Outlier Robust Adversarial Training

Shu Hu, Zhenhuan Yang, Xin Wang, Yiming Ying, Siwei Lyu
9/10/2023
cs.LGcs.AIstat.ML

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Supervised learning models are challenged by the intrinsic complexities of training data such as outliers and minority subpopulations and intentional attacks at inference time with adversarial samples. While traditional robust learning methods and the recent adversarial training approaches are designed to handle each of the two challenges, to date, no work has been done to develop models that are robust with regard to the low-quality training data and the potential adversarial attack at inference time simultaneously. It is for this reason that we introduce Outlier Robust Adversarial Training (ORAT) in this work. ORAT is based on a bi-level optimization formulation of adversarial training with a robust rank-based loss function. Theoretically, we show that the learning objective of ORAT satisfies the $\mathcal{H}$-consistency in binary classification, which establishes it as a proper surrogate to adversarial 0/1 loss. Furthermore, we analyze its generalization ability and provide uniform convergence rates in high probability. ORAT can be optimized with a simple algorithm. Experimental evaluations on three benchmark datasets demonstrate the effectiveness and robustness of ORAT in handling outliers and adversarial attacks. Our code is available at https://github.com/discovershu/ORAT.

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. 1 weaker match is 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{hu2023outlier,
  title  = {Outlier Robust Adversarial Training},
  author = {Shu Hu and Zhenhuan Yang and Xin Wang and Yiming Ying and Siwei Lyu},
  year   = {2023},
  eprint = {2309.05145},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2309.05145v1}
}

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

Discussion