Challenge: Existing methods for few-shot link prediction are limited by having only a few examples of a relation . low-frequency relations are abundant in knowledge graphs, but link prediction for these relations is important .
Approach: They perform few-shot link prediction for a set of new relations unseen during training, given only a few examples of each relation at test time.
Outcome: The proposed model is based on a simple, zero-shot baseline that ignores relation-specific information and achieves surprisingly strong performance.

Similar Papers

Towards Realistic Few-Shot Relation Extraction (2021.emnlp-main)

Copied to clipboard

Challenge: Recent studies have shown that few-shot relation classification models can be used to extract any relation of interest from a collection of text with only a few example instances.
Approach: They propose to modify the training routine to encourage models to better discriminate between relations involving similar entity types.
Outcome: The proposed models outperform human models on relation extraction tasks while relying on entity type information.
Few-shot Link Prediction on Hyper-relational Facts (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods to predict missing elements in hyper-relational facts require high-quality data.
Approach: They propose a task to predict a missing entity in a hyper-relational fact with limited support instances.
Outcome: The proposed model outperforms existing models on three datasets.
Revisiting Few-shot Relation Classification: Evaluation Data and Classification Schemes (2021.tacl-1)

Copied to clipboard

Challenge: a recent study has focused on few-shot learning (FSL) for relation classification, but it requires large amounts of training data.
Approach: They propose a method for deriving more realistic few-shot test data from available datasets for supervised RC.
Outcome: The proposed method yields a challenging benchmark for FSL-RC on which state of the art models show poor performance.
FewRel: A Large-Scale Supervised Few-Shot Relation Classification Dataset with State-of-the-Art Evaluation (D18-1)

Copied to clipboard

Challenge: Empirical results show that even the most competitive few-shot learning models struggle on this task, especially as compared with humans.
Approach: They propose a Few-Shot Relation Classification Dataset consisting of 70, 000 sentences on 100 relations derived from Wikipedia and annotated by crowdworkers.
Outcome: The proposed methods perform well on the most competitive few-shot learning models, especially as compared with humans.
Meta Relational Learning for Few-Shot Link Prediction in Knowledge Graphs (D19-1)

Copied to clipboard

Challenge: Empirically, our model achieves state-of-the-art results on few-shot link prediction KG benchmarks.
Approach: They propose a Meta Relational Learning framework to do few-shot link prediction in KGs by observing only a few associative triples.
Outcome: The proposed model achieves state-of-the-art results on few-shot link prediction KG benchmarks.
Towards Realistic Few-Shot Relation Extraction: A New Meta Dataset and Evaluation (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods for few-shot relation extraction are not realistic due to the large amount of training data required.
Approach: They propose a meta dataset for few-shot relation extraction based on existing supervised relation extraction datasets and a few-shot form of the TACRED dataset.
Outcome: The proposed methods perform poorly on the few-shot relation extraction task.
Learning to Generate Rules for Realistic Few-Shot Relation Classification: An Encoder-Decoder Approach (2024.findings-emnlp)

Copied to clipboard

Challenge: a new approach to relation classification is proposed to use data-driven approaches to perform fewshot tasks with limited training data.
Approach: They propose a neuro-symbolic approach for realistic few-shot relation classification via rules . they propose to generate rules that can be used to extract relations using custom T5-style models .
Outcome: The proposed approach is interpretable and pliable and outperforms the state-of-the-art on TACRED and NYT29 benchmarks while maintaining pliability.
Zero- and Few-Shot NLP with Pretrained Language Models (2022.acl-tutorials)

Copied to clipboard

Challenge: a tutorial aims to introduce NLP researchers to the latest techniques for learning from little-to-no data . aims at bringing interested researchers up to speed about the latest and ongoing techniques .
Approach: They aim to introduce techniques for learning from little-to-no data using pretrained language models.
Outcome: This tutorial aims to bring interested NLP researchers up to speed about recent techniques . it will cover methods from manual engineering, better inference algorithms to better tuning methods .
On Measuring the Intrinsic Few-Shot Hardness of Datasets (2022.emnlp-main)

Copied to clipboard

Challenge: Recent work has shown that few-shot learning is successful for pre-trained models, but there is no concrete understanding of when and why it is successful.
Approach: They propose a simple metric that estimates few-shot hardness for a given dataset . they propose metric which exploits feature-space invariances between training and test samples .
Outcome: The proposed metric better accounts for few-shot hardness compared to existing notions and is 8-100x faster to compute.
A Simple yet Effective Relation Information Guided Approach for Few-Shot Relation Extraction (2022.findings-acl)

Copied to clipboard

Challenge: Existing approaches to introduce relation information into the model are limited by labeling and data scarcity.
Approach: They propose a direct addition approach to introduce relation information into a model by concatenating two views of relations and adding them to the original prototype.
Outcome: The proposed approach improves on the benchmark dataset FewRel 1.0 and shows comparable results to the state-of-the-art.

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