Relation-Aware Network with Attention-Based Loss for Few-Shot Knowledge Graph Completion
원문 초록
Few-shot knowledge graph completion (FKGC) task aims to predict unseen facts of a relation with few-shot reference entity pairs. Current approaches randomly select one negative sample for each reference entity pair to minimize a margin-based ranking loss, which easily leads to a zero-loss problem if the negative sample is far away from the positive sample and then out of the margin. Moreover, the entity should have a different representation under a different context. To tackle these issues, we propose a novel Relation-Aware Network with Attention-Based Loss (RANA) framework. Specifically, to better utilize the plentiful negative samples and alleviate the zero-loss issue, we strategically select relevant negative samples and design an attention-based loss function to further differentiate the importance of each negative sample. The intuition is that negative samples more similar to positive samples will contribute more to the model. Further, we design a dynamic relation-aware entity encoder for learning a context-dependent entity representation. Experiments demonstrate that RANA outperforms the state-of-the-art models on two benchmark datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ReCDAP: Relation-Based Conditional Diffusion with Attention Pooling for Few-Shot Knowledge Graph Completion
Knowledge Graph Completion with Relation-Aware Anchor Enhancement
TRIX: A More Expressive Model for Zero-shot Domain Transfer in Knowledge Graphs
Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion
Soft Reasoning Paths for Knowledge Graph Completion
Enhancing Knowledge Graph Completion with Entity Neighborhood and Relation Context
토론
이 논문과 연결된 포럼 글이 아직 없습니다.