DFM-X: Augmentation by Leveraging Prior Knowledge of Shortcut Learning

Shunxin Wang, Christoph Brune, Raymond Veldhuis, Nicola Strisciuglio
8/12/2023
cs.CV

No official code found. Best implementation: nis-research/dfmX-augmentation (4 stars, MIT, last commit 2023-08-13).

Abstract

Neural networks are prone to learn easy solutions from superficial statistics in the data, namely shortcut learning, which impairs generalization and robustness of models. We propose a data augmentation strategy, named DFM-X, that leverages knowledge about frequency shortcuts, encoded in Dominant Frequencies Maps computed for image classification models. We randomly select X% training images of certain classes for augmentation, and process them by retaining the frequencies included in the DFMs of other classes. This strategy compels the models to leverage a broader range of frequencies for classification, rather than relying on specific frequency sets. Thus, the models learn more deep and task-related semantics compared to their counterpart trained with standard setups. Unlike other commonly used augmentation techniques which focus on increasing the visual variations of training data, our method targets exploiting the original data efficiently, by distilling prior knowledge about destructive learning behavior of models from data. Our experimental results demonstrate that DFM-X improves robustness against common corruptions and adversarial attacks. It can be seamlessly integrated with other augmentation techniques to further enhance the robustness of models.

View on arXivView PDF

Code Implementations(1)

MIT

Augmentation for CV using frequency shortcuts

40PythonJul 31, 20233 years agoMIT
adversarial-defensedata-augmentationdata-augmentation-strategiesfourier-transformfrequency-analysis+4 more

Similar Papers

Cite this paper

@article{wang2023dfmx,
  title  = {DFM-X: Augmentation by Leveraging Prior Knowledge of Shortcut Learning},
  author = {Shunxin Wang and Christoph Brune and Raymond Veldhuis and Nicola Strisciuglio},
  year   = {2023},
  eprint = {2308.06622},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.06622v1}
}

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

Discussion