PEARL is proposed, a Path-Entity Aligned Relational Learning framework that models paths as context-conditioned reasoning signals and employs a dual-view contrastive objective that promotes representation consistency under stochastic contextual perturbations.
Abstract
Inductive knowledge graph completion (IKGC) aims to predict missing links involving entities unseen during training, requiring models to learn transferable relational and structural patterns. Existing subgraph- and path-based approaches often encode relational paths independently of their surrounding query subgraphs, although the predictive relevance of a path may vary across structural contexts. We propose PEARL, a Path-Entity Aligned Relational Learning framework that models paths as context-conditioned reasoning signals. PEARL constructs a query-specific contextual subgraph from the union of the query entities'neighborhoods and uses a large language model (LLM)-guided retriever to distill semantically relevant paths. It then builds a bipartite interaction graph over paths, contextual entities, and a global subgraph representation, allowing path embeddings to adapt to local and global structural evidence. To suppress noise introduced by the enlarged context, PEARL employs a dual-view contrastive objective that promotes representation consistency under stochastic contextual perturbations. Experiments on WN18RR, FB15k-237, and NELL-995 show that PEARL obtains the best average Hits@10 among the compared IKGC methods on all three benchmarks. Ablation studies, efficiency analyses, and case studies further validate the contributions of contextual subgraph modeling, semantic path retrieval, path-entity interaction, and contrastive regularization.
These results demonstrate that collaborative modeling of instance-level and batch-level structural context can effectively enhance structure-aware entity representation and improve fine-grained entity prediction.
Graph-based retrieval-augmented generation supports multi-hop retrieval by organizing corpus information into graphs. However, existing relation-free graph retrieval methods rely primarily on query-sentence similarity to search for evidence. This can exclude useful bridging evidence with low query similarity and activa...
FITTER consistently outperforms inductive baselines without retraining, indicating that vocabulary-agnostic structural learning is a viable foundation for inference over the heterogeneous knowledge graphs of the Semantic Web.
Jia-Xin Pan, M. Nayyeri, Osama Mohammed et al.· 0 citations
SNAP-KG (Streaming Node Assignment via Projection for Knowledge Graph Entity Integration), a framework supporting graph-structural multi-view relational clustering and inductive inference for streaming entities, is proposed.
Jui-Chien Lin, Mohammad Mohammadi Amiri, O. Seneviratne· 1 citation
Hyper-relational knowledge graphs (HKGs) extend knowledge graphs with qualifiers to represent complex n-ary facts. However, existing methods often (1) rely on relation-agnostic node aggregation that mixes heterogeneous multi-hop evidence, which can lead to entity-role ambiguity and representation collapse, and (2) fail...
Sangjun Ji, Sangjune Kim, Youngho Lee et al.· Proceedings of the 32nd ACM...· 0 citations
AG is proposed, a Structure-Aware Generative framework for temporal knowledge graph reasoning with historical evidence that first constructs dual-view historical evidence to better capture structural dependencies in temporal knowledge graphs and formulates TKGR as an end-to-end generative task through instruction tunin...
Zi-Hao Jiang, Wen-Jie Xu, Miao Peng et al.· World wide web (Bussum)· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
With $2.1 million funding from Google.org, the open-source Public Transit Intelligence Hub will unify public transit monitoring, operations, and passenger communication.