Document-Level In-Context Few-Shot Relation Extraction via Pre-Trained Language Models
Not on the map. Why?
Abstract (arXiv)
Document-level relation extraction aims at inferring structured human knowledge from textual documents. State-of-the-art methods for this task use pre-trained language models (LMs) via fine-tuning, yet fine-tuning is computationally expensive and cannot adapt to new relation types or new LMs. As a remedy, we leverage the generalization capabilities of pre-trained LMs and present a novel framework for document-level in-context few-shot relation extraction. Our framework has three strengths: it eliminates the need (1) for named entity recognition and (2) for human annotations of documents, and (3) it can be updated to new LMs without re-training. We evaluate our framework using DocRED, the largest publicly available dataset for document-level relation extraction, and demonstrate that our framework achieves state-of-the-art performance. We further show that our framework actually performs much better than the original labels from the development set of DocRED. Finally, we conduct an extensive benchmark demonstrating the effectiveness of our framework, achieving state-of-the-art results across six relation extraction datasets and outperforming more than 30 baseline methods. Unlike our framework, the baseline methods have large computational overhead (e.g., from fine-tuning). To the best of our knowledge, we are the first to reformulate the document-level relation extraction task as a tailored in-context few-shot learning paradigm.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 66 of its 108 references that are in the map. First posted on arXiv 17 Oct 2023.
Builds on
66 of 108 references.
References · 66
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023GPT-4 Technical Reportcited by 18,132
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
38 more
- 2022Emergent Abilities of Large Language Modelscited by 2,483
- 2019Language Models as Knowledge Bases?cited by 1,922
- 2022Rethinking the Role of Demonstrations: What Makes In-Context Learning Work?cited by 1,413
- 2019SciBERT: A Pretrained Language Model for Scientific Textcited by 1,404
- 2021Calibrate Before Use: Improving Few-Shot Performance of Language Modelscited by 1,371
- 2021What Makes Good In-Context Examples for GPT-3?cited by 1,184
- 2021Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivitycited by 1,122
- 2021GPT Understands, Toocited by 715
- 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 686
- 2022Automatic Chain of Thought Prompting in Large Language Modelscited by 684
- 2021Learning To Retrieve Prompts for In-Context Learningcited by 641
- 2022Large Language Models Struggle to Learn Long-Tail Knowledgecited by 452
- 2023Larger language models do in-context learning differentlycited by 386
- 2021Measuring and Improving Consistency in Pretrained Language Modelscited by 361
- 2021True Few-Shot Learning with Language Modelscited by 343
- 2021Factual Probing Is [MASK]: Learning vs. Learning to Recallcited by 291
- 2021Surface Form Competition: Why the Highest Probability Answer Isn't Always Rightcited by 256
- 2022Selective Annotation Makes Language Models Better Few-Shot Learnerscited by 242
- 2019DocRED: A Large-Scale Document-Level Relation Extraction Datasetcited by 239
- 2022Unified Structure Generation for Universal Information Extractioncited by 220
- 2019KagNet: Knowledge-Aware Graph Networks for Commonsense Reasoningcited by 216
- 2021Generated Knowledge Prompting for Commonsense Reasoningcited by 213
- 2021Structured Prediction as Translation between Augmented Natural Languagescited by 183
- 2021Noisy Channel Language Model Prompting for Few-Shot Text Classificationcited by 163
- 2016End-to-End Relation Extraction using LSTMs on Sequences and Tree Structurescited by 161
- 2022A Review on Language Models as Knowledge Basescited by 156
- 2018DKN: Deep Knowledge-Aware Network for News Recommendationcited by 137
- 2019Span-based Joint Entity and Relation Extraction with Transformer Pre-trainingcited by 132
- 2020Improving Conversational Recommender Systems via Knowledge Graph based Semantic Fusioncited by 122
- 2020Document-Level Relation Extraction with Adaptive Thresholding and Localized Context Poolingcited by 115
- 2021Knowledgeable or Educated Guess? Revisiting Language Models as Knowledge Basescited by 107
- 2023Revisiting Relation Extraction in the era of Large Language Modelscited by 100
- 2019E-BERT: Efficient-Yet-Effective Entity Embeddings for BERTcited by 96
- 2020Two are Better than One: Joint Entity and Relation Extraction with Table-Sequence Encoderscited by 87
- 2021Document-level Relation Extraction as Semantic Segmentationcited by 80
- 2021Entity Structure Within and Throughout: Modeling Mention Dependencies for Document-Level Relation Extractioncited by 68
- 2023CodeIE: Large Code Generation Models are Better Few-Shot Information Extractorscited by 67
- 2023GPT-RE: In-context Learning for Relation Extraction using Large Language Modelscited by 62
50 most cited of 66 All 66 (JSON)
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.