Adversarial Word Dilution as Text Data Augmentation in Low-Resource Regime

Junfan Chen, Richong Zhang, Zheyan Luo, Chunming Hu, Yongyi Mao
5/16/2023
cs.CL

No confident code implementation found for this paper.

Abstract

Data augmentation is widely used in text classification, especially in the low-resource regime where a few examples for each class are available during training. Despite the success, generating data augmentations as hard positive examples that may increase their effectiveness is under-explored. This paper proposes an Adversarial Word Dilution (AWD) method that can generate hard positive examples as text data augmentations to train the low-resource text classification model efficiently. Our idea of augmenting the text data is to dilute the embedding of strong positive words by weighted mixing with unknown-word embedding, making the augmented inputs hard to be recognized as positive by the classification model. We adversarially learn the dilution weights through a constrained min-max optimization process with the guidance of the labels. Empirical studies on three benchmark datasets show that AWD can generate more effective data augmentations and outperform the state-of-the-art text data augmentation methods. The additional analysis demonstrates that the data augmentations generated by AWD are interpretable and can flexibly extend to new examples without further 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. 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{chen2023adversarial,
  title  = {Adversarial Word Dilution as Text Data Augmentation in Low-Resource Regime},
  author = {Junfan Chen and Richong Zhang and Zheyan Luo and Chunming Hu and Yongyi Mao},
  year   = {2023},
  eprint = {2305.09287},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.09287v2}
}

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

Discussion