mlsanityData to 7 Oct 2026

Enhancing Low-Resource Relation Representations through Multi-View Decoupling

arXiv 2312.17267 ↗First posted 26 Dec 2023cs.CL cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Recently, prompt-tuning with pre-trained language models (PLMs) has demonstrated the significantly enhancing ability of relation extraction (RE) tasks. However, in low-resource scenarios, where the available training data is scarce, previous prompt-based methods may still perform poorly for prompt-based representation learning due to a superficial understanding of the relation. To this end, we highlight the importance of learning high-quality relation representation in low-resource scenarios for RE, and propose a novel prompt-based relation representation method, named MVRE (underlineMulti-underlineView underlineRelation underlineExtraction), to better leverage the capacity of PLMs to improve the performance of RE within the low-resource prompt-tuning paradigm. Specifically, MVRE decouples each relation into different perspectives to encompass multi-view relation representations for maximizing the likelihood during relation inference. Furthermore, we also design a Global-Local loss and a Dynamic-Initialization method for better alignment of the multi-view relation-representing virtual words, containing the semantics of relation labels during the optimization learning process and initialization. Extensive experiments on three benchmark datasets show that our method can achieve state-of-the-art in low-resource settings.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 24 of its 35 references that are in the map. First posted on arXiv 26 Dec 2023.

Builds on

24 of 35 references.

References · 24

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
  4. 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,255
  5. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
  6. 2021QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answeringcited by 386
  7. 2019Matching the Blanks: Distributional Similarity for Relation Learningcited by 271
  8. 2021PTR: Prompt Tuning with Rules for Text Classificationcited by 238
  9. 2021KnowPrompt: Knowledge-aware Prompt-tuning with Synergistic Optimization for Relation Extractioncited by 180
  10. 2020Automatically Identifying Words That Can Serve as Labels for Few-Shot Text Classificationcited by 98
  11. 2020Coreferential Reasoning Learning for Language Representationcited by 80
  12. 2021An Improved Baseline for Sentence-level Relation Extractioncited by 80
12 more
  1. 2019SemEval-2010 Task 8: Multi-Way Classification of Semantic Relations Between Pairs of Nominalscited by 63
  2. 2022Multi-View Document Representation Learning for Open-Domain Dense Retrievalcited by 41
  3. 2022Summarization as Indirect Supervision for Relation Extractioncited by 31
  4. 2020GDPNet: Refining Latent Multi-View Graph for Relation Extractioncited by 29
  5. 2021Passage Retrieval for Outside-Knowledge Visual Question Answeringcited by 25
  6. 2022Instance-aware Prompt Learning for Language Understanding and Generationcited by 18
  7. 2022Distantly-Supervised Named Entity Recognition with Adaptive Teacher Learning and Fine-grained Student Ensemblecited by 14
  8. 2021Efficient Document-level Event Extraction via Pseudo-Trigger-aware Pruned Complete Graphcited by 13
  9. 2022Relation Extraction as Open-book Examination: Retrieval-enhanced Prompt Tuningcited by 13
  10. 2023Mirror: A Universal Framework for Various Information Extraction Taskscited by 12
  11. 2023MIRACLE: Towards Personalized Dialogue Generation with Latent-Space Multiple Personal Attribute Controlcited by 11
  12. 2022FPT: Improving Prompt Tuning Efficiency via Progressive Trainingcited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 2.

3 papers.