Relation Extraction As Open-book Examination: Retrieval-enhanced Prompt Tuning

Abstract

Pre-trained language models have contributed significantly to relation extraction by demonstrating remarkable few-shot learning abilities. However, prompt tuning methods for relation extraction may still fail to generalize to those rare or hard patterns. Note that the previous parametric learning paradigm can be viewed as memorization regarding training data as a book and inference as the close-book test. Those long-tailed or hard patterns can hardly be memorized in parameters given few-shot instances. To this end, we regard RE as an open-book examination and propose a new semiparametric paradigm of retrieval-enhanced prompt tuning for relation extraction. We construct an open-book datastore for retrieval regarding prompt-based instance representations and corresponding relation labels as memorized key-value pairs. During inference, the model can infer relations by linearly interpolating the base output of PLM with the non-parametric nearest neighbor distribution over the datastore. In

Stats

• citations23
• S2 citations—
• github stars734
• HF likes0
• heat score16.08
• arxiv keychen2022relation

Related papers

• Modular Retrieval For Generalization And Interpretation (2023)0.00
• Fine-grained Retrieval Prompt Tuning (2022)10.07
• Parameter-efficient Prompt Tuning Makes Generalized And Calibrated Neural Text Retrievers (2022)5.84
• Rar-b: Reasoning As Retrieval Benchmark (2024)2.68
• Revela: Dense Retriever Learning Via Language Modeling (2025)0.00
• Soft Prompt Tuning For Augmenting Dense Retrieval With Large Language Models (2023)9.41
• Self-supervised Relational Reasoning For Representation Learning (2020)0.00
• Promptreps: Prompting Large Language Models To Generate Dense And Sparse Representations For Zero-shot Document Retrieval (2024)10.61