TL;DR
This paper introduces a retrieval-enhanced prompt tuning method for relation extraction, framing it as an open-book exam, which improves generalization especially for rare or hard patterns in few-shot and supervised settings.
Contribution
It proposes a novel semiparametric paradigm combining parametric models with a retrieval datastore, achieving state-of-the-art results in relation extraction tasks.
Findings
Achieves state-of-the-art performance on benchmark datasets.
Effective in both supervised and few-shot relation extraction.
Enhances generalization to rare or hard relation patterns.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsKnowPrompt
