Do Counterfactual Examples Complicate Adversarial Training?

Eric Yeats, Cameron Darwin, Eduardo Ortega, Frank Liu, Hai Li
4/16/2024
cs.LGcs.CV

No confident code implementation found for this paper.

Abstract

We leverage diffusion models to study the robustness-performance tradeoff of robust classifiers. Our approach introduces a simple, pretrained diffusion method to generate low-norm counterfactual examples (CEs): semantically altered data which results in different true class membership. We report that the confidence and accuracy of robust models on their clean training data are associated with the proximity of the data to their CEs. Moreover, robust models perform very poorly when evaluated on the CEs directly, as they become increasingly invariant to the low-norm, semantic changes brought by CEs. The results indicate a significant overlap between non-robust and semantic features, countering the common assumption that non-robust features are not interpretable.

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{yeats2024counterfactual,
  title  = {Do Counterfactual Examples Complicate Adversarial Training?},
  author = {Eric Yeats and Cameron Darwin and Eduardo Ortega and Frank Liu and Hai Li},
  year   = {2024},
  eprint = {2404.10588},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.10588v2}
}

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

Discussion