Robust Distant Supervision Relation Extraction via Deep Reinforcement Learning
Pengda Qin, Weiran Xu, William Yang Wang

TL;DR
This paper introduces a deep reinforcement learning approach to improve distant supervision relation extraction by effectively identifying and handling false positives, leading to significant performance gains over existing methods.
Contribution
It proposes a novel deep reinforcement learning strategy to automatically recognize false positives in distant supervision, enhancing relation extraction accuracy.
Findings
Significant performance improvement over state-of-the-art methods
Effective false positive identification without supervised data
Better handling of noisy training samples
Abstract
Distant supervision has become the standard method for relation extraction. However, even though it is an efficient method, it does not come at no cost---The resulted distantly-supervised training samples are often very noisy. To combat the noise, most of the recent state-of-the-art approaches focus on selecting one-best sentence or calculating soft attention weights over the set of the sentences of one specific entity pair. However, these methods are suboptimal, and the false positive problem is still a key stumbling bottleneck for the performance. We argue that those incorrectly-labeled candidate sentences must be treated with a hard decision, rather than being dealt with soft attention weights. To do this, our paper describes a radical solution---We explore a deep reinforcement learning strategy to generate the false-positive indicator, where we automatically recognize false…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Software Engineering Research
