English

Hierarchical Relational Learning for Few-Shot Knowledge Graph Completion

Machine Learning 2025-06-05 v4 Artificial Intelligence Computer Vision and Pattern Recognition

Abstract

Knowledge graphs (KGs) are powerful in terms of their inference abilities, but are also notorious for their incompleteness and long-tail distribution of relations. To address these challenges and expand the coverage of KGs, few-shot KG completion aims to make predictions for triplets involving novel relations when only a few training triplets are provided as reference. Previous methods have focused on designing local neighbor aggregators to learn entity-level information and/or imposing a potentially invalid sequential dependency assumption at the triplet level to learn meta relation information. However, pairwise triplet-level interactions and context-level relational information have been largely overlooked for learning meta representations of few-shot relations. In this paper, we propose a hierarchical relational learning method (HiRe) for few-shot KG completion. By jointly capturing three levels of relational information (entity-level, triplet-level and context-level), HiRe can effectively learn and refine meta representations of few-shot relations, and thus generalize well to new unseen relations. Extensive experiments on benchmark datasets validate the superiority of HiRe over state-of-the-art methods. The code can be found in https://github.com/alexhw15/HiRe.git.

Keywords

Cite

@article{arxiv.2209.01205,
  title  = {Hierarchical Relational Learning for Few-Shot Knowledge Graph Completion},
  author = {Han Wu and Jie Yin and Bala Rajaratnam and Jianyuan Guo},
  journal= {arXiv preprint arXiv:2209.01205},
  year   = {2025}
}

Comments

Published at ICLR 2023

R2 v1 2026-06-28T00:39:12.600Z