Challenge: Existing approaches to recognize unseen relations for which there are no training instances are lacking in the real-world setting.
Approach: They propose a prompt-based model with semantic knowledge augmentation to recognize unseen relations under zero-shot setting.
Outcome: The proposed model outperforms existing methods under zero-shot setting on three datasets.

Similar Papers

RelationPrompt: Leveraging Prompts to Generate Synthetic Data for Zero-Shot Relation Triplet Extraction (2022.findings-acl)

Copied to clipboard

Challenge: Existing approaches to extract relation triplets require large datasets and a fixed set of relations.
Approach: They propose to use a sentence-based task setting to generalize relation extraction methods to unseen relation sets.
Outcome: The proposed method can extract multiple relation triplets in a sentence using language model prompts and structured text approaches.
ZS-BERT: Towards Zero-Shot Relation Extraction with Attribute Representation Learning (2021.naacl-main)

Copied to clipboard

Challenge: Existing methods to relation extraction require labeled data, but labeling is difficult . Existing models cannot recognize rare instances that are never covered by training data .
Approach: They propose a multi-task learning model that directly predicts unseen relations without hand-crafted attribute labeling and multiple pairwise classifications.
Outcome: The proposed model outperforms existing methods by 13.54% on two well-known datasets.
Prompt Tuning for Few-shot Relation Extraction via Modeling Global and Local Graphs (2024.lrec-main)

Copied to clipboard

Challenge: Recent studies show that prompt-tuning is effective for few-shot relation extraction tasks.
Approach: They propose to incorporate the knowledge in relation labels into prompt-tuning by inserting prompt templates into the input.
Outcome: The proposed method improves on four datasets under low-resource conditions.
Meta-Semantics Augmented Few-Shot Relational Learning (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for few-shot relational learning on knowledge graphs focus on leveraging specific relational information, but rich semantics inherent in KGs have been overlooked.
Approach: They propose a meta-learning framework that integrates meta-semantics with relational information for few-shot relational learning.
Outcome: Extensive experiments on two real-world KG benchmarks validate the effectiveness of PromptMeta in adapting to new relations with limited supervision.
Unleashing the Power of Large Language Models in Zero-shot Relation Extraction via Self-Prompting (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for zero-shot Relation Extraction (RE) lack detailed, context-specific prompts for understanding various sentences and relations.
Approach: They propose a framework that uses a three-stage diversity approach to prompt LLMs by generating multiple synthetic samples that encapsulate specific relations from scratch.
Outcome: The proposed framework outperforms existing LLM-based zero-shot RE methods on benchmark datasets and shows that it produces high-quality synthetic data that enhances performance.
Prompt-based Zero-shot Text Classification with Conceptual Knowledge (2023.acl-srw)

Copied to clipboard

Challenge: Existing approaches to pre-training language models rely on verbalizers to translate the predicted vocabulary to task-specific labels.
Approach: They propose a framework that incorporates conceptual knowledge for text classification in the extreme zero-shot setting.
Outcome: The proposed framework outperforms prompt-based approaches on four widely-used datasets for sentiment analysis and topic detection on the same experimental settings.
KEPL: Knowledge Enhanced Prompt Learning for Chinese Hypernym-Hyponym Extraction (2023.emnlp-main)

Copied to clipboard

Challenge: Existing work on hypernym-hyponym (“is-a”) relations is mostly in the English language.
Approach: They propose a Knowledge Enhanced Prompt Learning method for Chinese hypernym-hyponym relation extraction using Hearst-like patterns as the prior knowledge.
Outcome: The proposed method is able to extract hypernym-hyponym relations from Chinese unstructured texts using Hearst-like patterns and embed patterns and text simultaneously.
A Two-Agent Game for Zero-shot Relation Triplet Extraction (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods for relation triplet extraction rely on labeled data and are limited in their applicability.
Approach: They propose a two-agent game approach to deliberate and debate unseen relations by two agents, a generator and an extractor.
Outcome: The proposed method outperforms baseline methods by 6%-16% in F1 scores.
Logic-guided Semantic Representation Learning for Zero-Shot Relation Classification (2020.coling-main)

Copied to clipboard

Challenge: Existing methods to zero-shot relation classification can only identify seen relations . existing methods rely on descriptive information to improve understandability of relation types .
Approach: They propose a logic-guided semantic representation learning model for zero-shot relation classification that builds connections between seen and unseen relations via implicit and explicit semantic representations with knowledge graph embeddings and logic rules.
Outcome: The proposed model can generalize to unseen relation types and achieve promising improvements.
Clear Up Confusion: Advancing Cross-Domain Few-Shot Relation Extraction through Relation-Aware Prompt Learning (2024.naacl-short)

Copied to clipboard

Challenge: Existing approaches to few-shot Relation Extraction (RE) are prone to confusion when applying knowledge to a target domain with entirely new types of relations.
Approach: They propose a relation-aware prompt learning method with pre-training to clear confusion by decomposing relation types through an innovative label prompt.
Outcome: The proposed method outperforms previous sota methods and yields better results on cross-domain few-shot RE tasks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations