mlsanityData to 7 Oct 2026

Relation-Aware Network with Attention-Based Loss for Few-Shot Knowledge Graph Completion

arXiv 2306.09519 ↗First posted 15 Jun 2023cs.CL cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 20 of its 25 references that are in the map. First posted on arXiv 15 Jun 2023.

Builds on

20 of 25 references.

References · 20

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  3. 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
  4. 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 929
  5. 2016Complex Embeddings for Simple Link Predictioncited by 897
  6. 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 893
  7. 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
  8. 2018SimplE Embedding for Link Prediction in Knowledge Graphscited by 195
  9. 2018One-Shot Relational Learning for Knowledge Graphscited by 78
  10. 2019Meta Relational Learning for Few-Shot Link Prediction in Knowledge Graphscited by 73
  11. 2020Understanding Negative Sampling in Graph Representation Learningcited by 66
  12. 2019Few-Shot Knowledge Graph Completioncited by 63
8 more
  1. 2013A Semantic Matching Energy Function for Learning with Multi-relational Datacited by 61
  2. 2020Adaptive Attentional Network for Few-Shot Knowledge Graph Completioncited by 42
  3. 2021Relational Learning with Gated and Attentive Neighbor Aggregator for Few-Shot Knowledge Graph Completioncited by 32
  4. 2021Inductive Relation Prediction by BERTcited by 27
  5. 2022Distantly Supervised Named Entity Recognition via Confidence-Based Multi-Class Positive and Unlabeled Learningcited by 21
  6. 2022Positive-Unlabeled Learning with Adversarial Data Augmentation for Knowledge Graph Completioncited by 13
  7. 2022Hierarchical Relational Learning for Few-Shot Knowledge Graph Completioncited by 6
  8. 2022Improving Distantly Supervised Relation Extraction by Natural Language Inferencecited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.