Skip to content
Open access

Adaptive Relation-Specific Ensemble Learning for Knowledge Graph Completion

2026 · Transactions of the Association for Computational Linguistics · Vol 14, pp. 2667-2687 · 0 citations · 50 references

TL;DR

Adaptive Relation-specific Weighted Ensemble (AReWE) is proposed, a relation-aware ensemble framework that jointly fine-tunes pretrained KGE models and achieves state-of-the-art performance on FB15K237 and NELL-995.

Abstract

Knowledge graph embedding (KGE) models learn representations of entities and relations to infer missing links in knowledge graphs. Existing KGE models employ different scoring functions to capture diverse relational patterns, yet no single model effectively represents all relation types. Consequently, ensemble methods have been proposed to combine multiple pretrained KGE models. However, existing ensembles are relation-independent, overlooking that different KGE models excel on different relation types. In this work, we propose Adaptive Relation-specific Weighted Ensemble (AReWE), a relation-aware ensemble framework that jointly fine-tunes pretrained KGE models.1 AReWE combines global optimization through a novel relation-specific batching strategy with local specialization via adaptive relation-specific weighted losses. Experiments on FB15K237, WN18RR, and NELL-995 demonstrate consistent improvements over existing ensemble methods and achieve state-of-the-art performance on FB15K237 and NELL-995.

Read PDF

Similar papers

#graph neural networks Open access Nov 2026

Entity-Dependent Relation Learning for Knowledge Graph Completion

Knowledge graph completion (KGC) aims to predict missing relationships between pairs of entities. Recently, Message Passing Neural Networks (MPNNs) have been employed in KGC and demonstrated superior ability in embedding learning. Current methods, however, face two major dilemmas. One focuses on learning complex entity...

Kang-Ye Wang, Peng-Wen Dai, Chuan Wang et al. · 0 citations
Conference Nov 2026

Relation-aware graph attention network for intelligent retrieval over compact domain knowledge graphs

How well can graph-neural retrieval work when the knowledge graph has only a few hundred entities? Specialised engineering domains—aquaculture processing, pharmaceutical formulation, precision manufacturing—produce compact yet semantically dense graphs that starve collaborative filtering and defeat keyword rankers blin...

Zhi-Yi Li, Yi-Ting Sheng, Ai-Ning Yu · 0 citations
Book Open access Nov 2026

Relational-View Ensemble Learning for Tabular Prediction

Tabular prediction can benefit from relational information at multiple levels, including global feature relations, feature interactions within each sample, and relations among similar samples. Existing deep tabular methods exploit such information through attention-based, graph-based, and retrieval-based modeling. Howe...

Ji Eun Park, T. Choi · 0 citations
#artificial intelligence Preprint Oct 2026

QORH: Learning Query-Specific Ordered Rule Hypergraphs for Inductive Knowledge Graph Link Prediction

Knowledge graph link prediction involving unseen entities and relations requires learning transferable reasoning patterns from observed graph structure. Existing methods based on relation graphs primarily capture pairwise dependencies, limiting their ability to preserve the compositional semantics, relation ordering, a...

Nai-Xing Xu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.