Jan 2026· Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence· Vol abs/2601.21174· 1 citation· 30 references
Computer Science
TL;DR
This work proposes a EA foundation model driven by a parallel encoding strategy that facilitates anchor-conditioned message passing and significantly shortens the inference trajectory by leveraging local structural proximity instead of global search.
Abstract
Entity alignment (EA) is critical for knowledge graph (KG) fusion. Existing EA models lack transferability and are incapable of aligning unseen KGs without retraining. While using graph foundation models (GFMs) offer a solution, we find that directly adapting GFMs to EA remains largely ineffective. This stems from a critical "reasoning horizon gap": unlike link prediction in GFMs, EA necessitates capturing long-range dependencies across sparse and heterogeneous KG structures. To address this challenge, we propose a EA foundation model driven by a parallel encoding strategy. We utilize seed EA pairs as local anchors to guide the information flow, initializing and encoding two parallel streams simultaneously. This facilitates anchor-conditioned message passing and significantly shortens the inference trajectory by leveraging local structural proximity instead of global search. Additionally, we incorporate a merged relation graph to model global dependencies and a learnable interaction module for precise matching. Extensive experiments verify the effectiveness of our framework, highlighting its strong generalizability to unseen KGs.
This framework performs LLM knowledge elicitation to extract factual knowledge from the model’s internal representations and transforms sentence-level representations into entity-level representations and aligns them within a unified space.
Deyu Chen, Qi-Yuan Li, Jinguang Gu et al.· Proceedings of the Thirty-Fi...· 0 citations
This work isolates SLM graph reasoning from navigation and traceability capability by employing the THESEUS navigation and traceability framework and using frozen, off-the-shelf SLMs as local action policies, and results motivate evaluating SLM graph reasoning beyond endpoint accuracy alone.
Eduin E. Hernandez, Sergio A. Diaz, Luis F. Garcia et al.· 0 citations
A knowledge graph completion model based on semantic constrained hybrid scoring (SCHS) is proposed, which integrates three synergistic mechanisms that essentially resolves the rigid trade-off between geometric alignment and flexible semantic matching.
Peng-Song Duan, Jia-Ke Zhao, Bo Zhang et al.· International journal of sof...· 0 citations
Large Language Models (LLMs) achieve strong performance on many tasks, yet their reasoning can remain brittle and their decision process is often insufficiently transparent. Knowledge graphs (KGs) provide explicit entities and relations that can ground reasoning and improve traceability. However, most KG-augmented appr...
Jia-Jun Duan, Qiu-Ling Chen, Ze-Xu Wang et al.· 2026 6th International Confe...· 0 citations
Generating executable structured queries for OpenStreetMap (OSM) from natural language remains a challenging task due to the rigid syntax of OverpassQL and the steep learning curve it presents to end-users. While steering Large Language Models (LLMs) via
demonstration contexts
offers a promising solution, existing...
Zhuoyue Wan, Wentao Hu, Hwanhee Kim et al.· Proceedings of the ACM on Ma...· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 23, 2026
Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.