TY - JOUR
T1 - Revisiting few-shot relation classification
T2 - Evaluation data and classification schemes
AU - Sabo, Ofer
AU - Elazar, Yanai
AU - Goldberg, Yoav
AU - Dagan, Ido
N1 - Publisher Copyright:
© 2021 Association for Computational Linguistics.
PY - 2021/8/2
Y1 - 2021/8/2
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85119600324&partnerID=8YFLogxK
U2 - 10.1162/tacl_a_00392
DO - 10.1162/tacl_a_00392
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85119600324
SN - 2307-387X
VL - 9
SP - 691
EP - 706
JO - Transactions of the Association for Computational Linguistics
JF - Transactions of the Association for Computational Linguistics
ER -