Structured Minimally Supervised Learning for Neural Relation Extraction
Not on the map. Why?
Abstract (arXiv)
We present an approach to minimally supervised relation extraction that combines the benefits of learned representations and structured learning, and accurately predicts sentence-level relation mentions given only proposition-level supervision from a KB. By explicitly reasoning about missing data during learning, our approach enables large-scale training of 1D convolutional neural networks while mitigating the issue of label noise inherent in distant supervision. Our approach achieves state-of-the-art results on minimally supervised sentential relation extraction, outperforming a number of baselines, including a competitive approach that uses the attention layer of a purely neural model.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4.
4 papers.
- 2021SENT: Sentence-level Distant Relation Extraction via Negative Trainingcited by 10
- 2021Distantly-Supervised Long-Tailed Relation Extraction Using Constraint Graphscited by 9
- 2021Distantly Supervised Relation Extraction with Sentence Reconstruction and Knowledge Base Priorscited by 8
- 2021Towards Robust Knowledge Graph Embedding via Multi-task Reinforcement Learningcited by 3
- 2021Towards Robust Knowledge Graph Embedding via Multi-task Reinforcement Learning11 Nov 2021
- 2021SENT: Sentence-level Distant Relation Extraction via Negative Training22 Jun 2021
- 2021Distantly-Supervised Long-Tailed Relation Extraction Using Constraint Graphs24 May 2021
- 2021Distantly Supervised Relation Extraction with Sentence Reconstruction and Knowledge Base Priors16 Apr 2021