Semi-supervised Relation Extraction via Data Augmentation and Consistency-training

Komal K. Teru
6/16/2023
cs.CLcs.IR

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

Abstract

Due to the semantic complexity of the Relation extraction (RE) task, obtaining high-quality human labelled data is an expensive and noisy process. To improve the sample efficiency of the models, semi-supervised learning (SSL) methods aim to leverage unlabelled data in addition to learning from limited labelled data points. Recently, strong data augmentation combined with consistency-based semi-supervised learning methods have advanced the state of the art in several SSL tasks. However, adapting these methods to the RE task has been challenging due to the difficulty of data augmentation for RE. In this work, we leverage the recent advances in controlled text generation to perform high quality data augmentation for the RE task. We further introduce small but significant changes to model architecture that allows for generation of more training data by interpolating different data points in their latent space. These data augmentations along with consistency training result in very competitive results for semi-supervised relation extraction on four benchmark datasets.

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

Similar Papers

Cite this paper

@article{teru2023semisupervised,
  title  = {Semi-supervised Relation Extraction via Data Augmentation and Consistency-training},
  author = {Komal K. Teru},
  year   = {2023},
  eprint = {2306.10153},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.10153v1}
}

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

Discussion