HaSa: Hardness and Structure-Aware Contrastive Knowledge Graph Embedding
원문 초록
We consider a contrastive learning approach to knowledge graph embedding (KGE) via InfoNCE. For KGE, efficient learning relies on augmenting the training data with negative triples. However, most KGE works overlook the bias from generating the negative triples-false negative triples (factual triples missing from the knowledge graph). We argue that the generation of high-quality (i.e., hard) negative triples might lead to an increase in false negative triples. To mitigate the impact of false negative triples during the generation of hard negative triples, we propose the Hardness and Structure-aware (\textbf{HaSa}) contrastive KGE method, which alleviates the effect of false negative triples while generating the hard negative triples. Experiments show that HaSa improves the performance of InfoNCE-based KGE approaches and achieves state-of-the-art results in several metrics for WN18RR datasets and competitive results for FB15k-237 datasets compared to both classic and pre-trained LM-based KGE methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Predicate-Conditional Conformalized Answer Sets for Knowledge Graph Embeddings
Predicting missing annotations in Gene Ontology with Knowledge Graph Embeddings and True Path Rule
Parallel Training of Knowledge Graph Embedding Models: A Comparison of Techniques
Knowledge Graph Embedding via Graph Attenuated Attention Networks
ETT-CKGE: Efficient Task-driven Tokens for Continual Knowledge Graph Embedding
SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.