Non-Robust Features are Not Always Useful in One-Class Classification

Matthew Lau, Haoran Wang, Alec Helbling, Matthew Hul, ShengYun Peng +3 more
7/8/2024
cs.LGcs.CV

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

Abstract

The robustness of machine learning models has been questioned by the existence of adversarial examples. We examine the threat of adversarial examples in practical applications that require lightweight models for one-class classification. Building on Ilyas et al. (2019), we investigate the vulnerability of lightweight one-class classifiers to adversarial attacks and possible reasons for it. Our results show that lightweight one-class classifiers learn features that are not robust (e.g. texture) under stronger attacks. However, unlike in multi-class classification (Ilyas et al., 2019), these non-robust features are not always useful for the one-class task, suggesting that learning these unpredictive and non-robust features is an unwanted consequence of training.

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. 4 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!

Cite this paper

@article{lau2024nonrobust,
  title  = {Non-Robust Features are Not Always Useful in One-Class Classification},
  author = {Matthew Lau and Haoran Wang and Alec Helbling and Matthew Hul and ShengYun Peng and Martin Andreoni and Willian T. Lunardi and Wenke Lee},
  year   = {2024},
  eprint = {2407.06372},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.06372v1}
}

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

Discussion