Revisiting few-shot relation classification: Evaluation data and classification schemes

Ofer Sabo, Yanai Elazar, Yoav Goldberg, Ido Dagan

Research output: Contribution to journalArticlepeer-review

26 Scopus citations

Abstract

We explore few-shot learning (FSL) for relation classification (RC). Focusing on the realistic scenario of FSL, in which a test instance might not belong to any of the target categories (none-of-the-above, [NOTA]), we first revisit the recent popular dataset structure for FSL, pointing out its unrealistic data distribution. To remedy this, we propose a novel methodology for deriving more realistic few-shot test data from available datasets for supervised RC, and apply it to the TACRED dataset. This yields a new challenging benchmark for FSL-RC, on which state of the art models show poor performance. Next, we analyze classification schemes within the popular embedding-based nearest-neighbor approach for FSL, with respect to constraints they impose on the embedding space. Triggered by this analysis, we propose a novel classification scheme in which the NOTA category is represented as learned vectors, shown empirically to be an appealing option for FSL.

Original languageEnglish
Pages (from-to)691-706
Number of pages16
JournalTransactions of the Association for Computational Linguistics
Volume9
DOIs
StatePublished - 2 Aug 2021

Bibliographical note

Publisher Copyright:
© 2021 Association for Computational Linguistics.

Fingerprint

Dive into the research topics of 'Revisiting few-shot relation classification: Evaluation data and classification schemes'. Together they form a unique fingerprint.

Cite this