The reviewed record of science sign in
Pith

arxiv: 2403.16543 · v1 · pith:VX2OFV4Z · submitted 2024-03-25 · cs.CL · cs.AI

Efficient Information Extraction in Few-Shot Relation Classification through Contrastive Representation Learning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:VX2OFV4Zrecord.jsonopen to challenge →

classification cs.CL cs.AI
keywords informationrepresentationsrelationclassificationcontrastiveentitylearningmultiple
0
0 comments X
read the original abstract

Differentiating relationships between entity pairs with limited labeled instances poses a significant challenge in few-shot relation classification. Representations of textual data extract rich information spanning the domain, entities, and relations. In this paper, we introduce a novel approach to enhance information extraction combining multiple sentence representations and contrastive learning. While representations in relation classification are commonly extracted using entity marker tokens, we argue that substantial information within the internal model representations remains untapped. To address this, we propose aligning multiple sentence representations, such as the [CLS] token, the [MASK] token used in prompting, and entity marker tokens. Our method employs contrastive learning to extract complementary discriminative information from these individual representations. This is particularly relevant in low-resource settings where information is scarce. Leveraging multiple sentence representations is especially effective in distilling discriminative information for relation classification when additional information, like relation descriptions, are not available. We validate the adaptability of our approach, maintaining robust performance in scenarios that include relation descriptions, and showcasing its flexibility to adapt to different resource constraints.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.