Global Relation Embedding for Relation Extraction (N18-1)

Copied to clipboard

Challenge: Existing methods to extract textual relations with distant supervision are limited by their reliance on supervised training data.
Approach: They propose to embed relations with global statistics of relations to combat the wrong labeling problem of distant supervision.
Outcome: The proposed method is more robust to training noise introduced by distant supervision and improves relation extraction models.

Similar Papers

Incorporating Global Contexts into Sentence Embedding for Relational Extraction at the Paragraph Level with Distant Supervision (L18-1)

Copied to clipboard

Challenge: Existing approaches to relation extraction (RE) only extract relations from sentences that contain two target entities.
Approach: They propose to incorporate global contexts from paragraph-into-sentence embedding into RE . they propose to use a knowledge base to extract relations between pairs of entities .
Outcome: The proposed approach can learn an exact RE from sentences without syntactic parsing.
Label-Free Distant Supervision for Relation Extraction via Knowledge Graph Embedding (D18-1)

Copied to clipboard

Challenge: Existing methods to generate large scale labeled data for relation extraction produce noisy relation labels when there are multiple relationships between entities.
Approach: They propose a method which assumes that a pair of entities appears in a Knowledge Graph and trains a relation classifier.
Outcome: The proposed method performs well in the current distant supervision dataset.
Entity or Relation Embeddings? An Analysis of Encoding Strategies for Relation Extraction (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to relation extraction use concatenating embeddings of head and tail entities . however, such representations capture the types of the entities involved, leading to false positives and confusion between relations involving entities of the same type.
Approach: They propose a model which combines [MASK] embeddings with entity embedds to learn relation embeddations.
Outcome: The proposed model outperforms the state-of-the-art on several benchmarks . it uses a self-supervised pre-training strategy which further improves the results.
Improving Distantly-Supervised Relation Extraction with Joint Label Embedding (D19-1)

Copied to clipboard

Challenge: Existing methods for relation extraction treat labels as independent and meaningless one-hot vectors, which cause a loss of potential label information for selecting valid instances.
Approach: They propose a multi-layer attention-based model to improve relation extraction with joint label embedding by gating integration and using the embeddable entities as an atten- tion.
Outcome: The proposed model significantly outperforms state-of-the-art methods in relation extraction with joint label embedding.
Uncover the Ground-Truth Relations in Distant Supervision: A Neural Expectation-Maximization Framework (D19-1)

Copied to clipboard

Challenge: Existing methods for relation extraction assume that text is noisy, but its corresponding labels are clean.
Approach: They propose a framework that combines neural network and probabilistic modelling to denoise noisy relation labels.
Outcome: The proposed framework improves the current art in uncovering the ground-truth relation labels.
What Do You Mean by Relation Extraction? A Survey on Datasets and Study on Scientific Relation Classification (2022.acl-srw)

Copied to clipboard

Challenge: Existing RE surveys focus on modeling techniques, but there are few that are based on real-world scenarios.
Approach: They propose to survey RE datasets and revisit the task definition and its adoption by the community.
Outcome: The proposed approach improves the reliability of RE evaluations across multiple datasets and reveals significant discrepancies in annotations.
Revisiting Distant Supervision for Relation Extraction (L18-1)

Copied to clipboard

Challenge: Existing approaches for relation extraction (RE) use supervised learning on relation-specific training data, which is expensive to acquire.
Approach: They propose to use a new testing dataset to re-examine distant supervision approaches . they aim to draw new conclusions based on the new testing data .
Outcome: The proposed method can generate training data without noise and bias issues . the proposed method is annotated by the researchers on Amzaon Mechanical Turk .
Combining Distant and Direct Supervision for Neural Relation Extraction (N19-1)

Copied to clipboard

Challenge: Existing methods to train relation extraction with distant supervision use noisy labels and implicitly assumes that all the KB facts are mentioned in the text.
Approach: They propose to combine distant supervision data with additional directly-supervised data to train relation extraction models by using sigmoidal attention weights with max pooling.
Outcome: The proposed method achieves state-of-the-art on the widely used FB-NYT dataset.
Distantly Supervised Relation Extraction in Federated Settings (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to label training datasets using distant supervision are expensive and cannot cover all walks of life.
Approach: They propose a federated denoising framework to suppress label noise in federation . they propose to use a multiple instance learning based denoisation method to select reliable sentences .
Outcome: The proposed method can select reliable sentences via cross-platform collaboration.
A Dataset for Inter-Sentence Relation Extraction using Distant Supervision (L18-1)

Copied to clipboard

Challenge: Existing methods for intra-sentence relation extraction use a distance supervision method to extract relations between entities.
Approach: They propose a benchmark dataset for the task of inter-sentence relation extraction using relations previously used for intra-sentent relation extraction.
Outcome: The proposed dataset is compared with baseline models and recurrent neural network models on the developed dataset.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations