Pith. sign in

REVIEW 1 cited by

Robust Distant Supervision Relation Extraction via Deep Reinforcement Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1805.09927 v1 pith:5VZ7GIPQ submitted 2018-05-24 cs.CL

classification cs.CL
keywords distantrelationsupervisionattentiondeepextractionfalsehowever
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 positives for each relation type without any supervised information. Unlike the removal operation in the previous studies, we redistribute them into the negative examples. The experimental results show that the proposed strategy significantly improves the performance of distant supervision comparing to state-of-the-art systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Extracting Structured Requirements from Unstructured Building Technical Specifications for Building Information Modeling

    cs.CL 2025-08 unverdicted novelty 4.0 of 10

    A study showing that CamemBERT and Fr_core_news_lg achieve over 90% F1 for named entity recognition and Random Forest achieves over 80% F1 for relation extraction on French building technical specifications.

Pith tools