A Study on Building Efficient Zero-Shot Relation Extraction Models
Not on the map. Why?
Abstract (arXiv)
Zero-shot relation extraction aims to identify relations between entity mentions using textual descriptions of novel types (i.e., previously unseen) instead of labeled training examples. Previous works often rely on unrealistic assumptions: (1) pairs of mentions are often encoded directly in the input, which prevents offline pre-computation for large scale document database querying; (2) no rejection mechanism is introduced, biasing the evaluation when using these models in a retrieval scenario where some (and often most) inputs are irrelevant and must be ignored. In this work, we study the robustness of existing zero-shot relation extraction models when adapting them to a realistic extraction scenario. To this end, we introduce a typology of existing models, and propose several strategies to build single pass models and models with a rejection mechanism. We adapt several state-of-the-art tools, and compare them in this challenging setting, showing that no existing work is really robust to realistic assumptions, but overall AlignRE (Li et al., 2024) performs best along all criteria.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 48 references that are in the map. First posted on arXiv 1 Mar 2026.
Builds on
27 of 48 references.
References · 27
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,362
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
- 2017Zero-Shot Relation Extraction via Reading Comprehensioncited by 425
- 2019Matching the Blanks: Distributional Similarity for Relation Learningcited by 271
- 2018FewRel: A Large-Scale Supervised Few-Shot Relation Classification Dataset with State-of-the-Art Evaluationcited by 254
- 2020How Does NLP Benefit Legal System: A Summary of Legal Artificial Intelligencecited by 128
- 2021Machine Learning with a Reject Option: A surveycited by 107
- 2019FewRel 2.0: Towards More Challenging Few-Shot Relation Classificationcited by 94
- 2021Label Verbalization and Entailment for Effective Zero- and Few-Shot Relation Extractioncited by 73
- 2022RelationPrompt: Leveraging Prompts to Generate Synthetic Data for Zero-Shot Relation Triplet Extractioncited by 60
15 more
- 2021ZS-BERT: Towards Zero-Shot Relation Extraction with Attribute Representation Learningcited by 46
- 2023Aligning Instruction Tasks Unlocks Large Language Models as Zero-Shot Relation Extractorscited by 44
- 2019UHop: An Unrestricted-Hop Relation Extraction Framework for Knowledge-Based Question Answeringcited by 37
- 2020Structured Prediction with Partial Labelling through the Infimum Losscited by 34
- 2023Revisiting Large Language Models as Zero-shot Relation Extractorscited by 29
- 2021Revisiting Few-shot Relation Classification: Evaluation Data and Classification Schemescited by 27
- 2022What do You Mean by Relation Extraction? A Survey on Datasets and Study on Scientific Relation Classificationcited by 17
- 2023Differentiable Clustering with Perturbed Spanning Forestscited by 14
- 2023RE-Matching: A Fine-Grained Semantic Matching Method for Zero-Shot Relation Extractioncited by 13
- 2024Few-shot clinical entity recognition in English, French and Spanish: masked language models outperform generative model promptingcited by 12
- 2025GLiREL -- Generalist Model for Zero-Shot Relation Extractioncited by 11
- 2022Information Extraction in Low-Resource Scenarios: Survey and Perspectivecited by 10
- 2024A fast and sound tagging method for discontinuous named-entity recognitioncited by 4
- 2019A Relation Extraction Approach for Clinical Decision Supportcited by 1
- 2024Fusion Makes Perfection: An Efficient Multi-Grained Matching Approach for Zero-Shot Relation Extractioncited by 1
Built on by
Not cited yet.