Rescue Implicit and Long-tail Cases: Nearest Neighbor Relation Extraction (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing RE models are incapable of handling implicit expressions and long-tail relation types due to language complexity and data sparsity. |
| Approach: | They propose a method to enhance relation extraction using k nearest neighbors (kNN-RE) kNN is a nearest-neighbor search tool that allows the model to consult training relations at test time . |
| Outcome: | The proposed model outperforms the best model to date on ACE05, SciERC, and Wiki80 datasets and outperformed the best on i2b2 and Wik80 dataset. |
Similar Papers
Leveraging 2-hop Distant Supervision from Table Entity Pairs for Relation Extraction (D19-1)
Copied to clipboard
| Challenge: | Existing methods to construct noisy labeled data for relation extraction (RE) are expensive and lacks the labeling capability. |
| Approach: | They propose a 2-hop DS strategy to enhance distantly supervised relation extraction (RE) by combining sentences that mention entities that are linked to each other. |
| Outcome: | The proposed method outperforms baselines on a benchmark dataset by a substantial margin. |
Manual Evaluation Matters: Reviewing Test Protocols of Distantly Supervised Relation Extraction (2021.findings-acl)
Copied to clipboard
Tianyu Gao, Xu Han, Yuzhuo Bai, Keyue Qiu, Zhiyu Xie, Yankai Lin, Zhiyuan Liu, Peng Li, Maosong Sun, Jie Zhou
| Challenge: | Distantly supervised relation extraction (RE) has attracted much attention in the past few years . previous methods to evaluate models manually or directly on autolabeled data have produced inaccurate evaluations . |
| Approach: | They propose to use distant supervision to generate large-scale autolabeled data . they build manually-annotated test sets for two DS-RE datasets and evaluate models . |
| Outcome: | The proposed method produces 53% wrong labels at the entity pair level in the popular NYT10 dataset. |
RESIDE: Improving Distantly-Supervised Neural Relation Extraction using Side Information (D18-1)
Copied to clipboard
| Challenge: | Distantly-supervised Relation Extraction (RE) methods ignore readily available side information. |
| Approach: | They propose a distantly-supervised neural relation extraction method which uses additional side information from KBs to train an extractor. |
| Outcome: | The proposed method improves performance even when limited side information is available. |
Connecting Language and Knowledge with Heterogeneous Representations for Neural Relation Extraction (N19-1)
Copied to clipboard
| Challenge: | Knowledge Bases (KBs) require constant updating to reflect changes to the world they represent. |
| Approach: | They propose a framework that unifies learning of RE and KBE models . the framework is based on a relation extraction task that uses a KB relation to a phrase . |
| Outcome: | The proposed framework unifies learning of RE and KBE models, leading to significant improvements over the state-of-the-art RE framework. |
Not Far Away, Not So Close: Sample Efficient Nearest Neighbour Data Augmentation via MiniMax (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing kNN-based augmentation techniques blindly incorporate all samples, but MiniMax-kNN uses a subset of augmented samples to maximize KL-divergence between teacher and student models. |
| Approach: | They propose a semi-supervised approach to augmented data augmentation using kNN. |
| Outcome: | The proposed method outperforms existing kNN-based augmentation techniques on several classification tasks and requires fewer augmented examples and less computation to achieve superior performance. |
Silver Syntax Pre-training for Cross-Domain Relation Extraction (2023.findings-acl)
Copied to clipboard
| Challenge: | Relation Extraction (RE) is the task of extracting structured knowledge from unstructured text. |
| Approach: | They exploit the affinity between syntactic structure and semantic RE to obtain low-cost pre-training data. |
| Outcome: | The proposed model outperforms baseline models in five out of six cross-domain setups without additional annotated data. |
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 . |
BERT-kNN: Adding a kNN Search Component to Pretrained Language Models for Better QA (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Pretrained language models (PLMs) capture a diverse range of linguistic and factual knowledge without the use of finetuning. |
| Approach: | They combine BERT with a traditional information retrieval step and a kNN search to improve the recall of facts encountered during training. |
| Outcome: | The proposed approach outperforms baselines on cloze-style QA by large margins without further training. |
Relation Extraction using Explicit Context Conditioning (N19-1)
Copied to clipboard
| Challenge: | Existing methods for relation extraction fail to capture complex and long dependencies . end-to-end models that learn both NER and RE can solve this problem . |
| Approach: | They propose to use second-order relations to compute relation scores for relation extraction (RE) . they propose to combine second- and first-order relation scores to obtain final relation scores . |
| Outcome: | The proposed method leads to state-of-the-art performance over two biomedical datasets. |
AMR-RE: Abstract Meaning Representations for Retrieval-Based In-Context Learning in Relation Extraction (2025.naacl-srw)
Copied to clipboard
| Challenge: | Existing in-context learning methods for relation extraction often overlook entity relationships . Existing methods for RE prioritize language similarity over structural similarity . |
| Approach: | They propose an AMR-enhanced retrieval-based ICL method for relation extraction . their method retrieves in-context examples based on semantic structure similarity . |
| Outcome: | The proposed method outperforms baselines on four English RE datasets and in the more demanding unsupervised setting. |