arXiv AI

FedV-KGQA: Multi-Hop Question Answering over Vertically Partitioned Knowledge Graphs

FedV-KGQA is a framework for multi-hop question answering over knowledge graphs that are vertically partitioned across different organizations. It allows entities to be shared while each silo retains disjoint sets of relations, using local graph enrichment and knowledge graph embeddings so that raw triples and relation parameters never leave the silo. The system includes a topic entity anchoring mechanism to ground questions in the correct graph neighborhood without runtime inter-silo communication, and it achieves performance close to centralized systems on three benchmarks, including 3-hop reasoning and robustness to embedding perturbations.

arXiv AI
Sep 15

FedV-KGQA in Practice: Design Lessons and an Interactive Prototype

FedV-KGQA addresses multi‑hop question answering over vertically partitioned knowledge graphs where each silo holds disjoint relation types. The system trains local embeddings, concatenates silo‑specific entity views, anchors questions at a topic entity, and ranks candidates without sharing raw triples. Experiments show federated fusion nearly matches centralized accuracy, that anchoring and enrichment are more critical than embedding choice, and that the cheapest encoder depends on target accuracy.

By Md Saikat Islam Khan Bappy, Oshani Seneviratne
arXiv AI
Sep 2

KGFR: A Foundation Retriever for Generalized Knowledge Graph Question Answering

KGFR introduces a Knowledge Graph Foundation Retriever that collaborates with large language models to enhance knowledge‑intensive question answering. By encoding relations with LLM‑generated descriptions and initializing entities from question roles, KGFR enables zero‑shot generalization to unseen knowledge graphs. Its Asymmetric Progressive Propagation technique efficiently handles large graphs, while a controllable reasoning loop allows the LLM to request candidate answers, supporting facts, and reasoning paths.

By Yuanning Cui, Zequn Sun, Wei Hu, Zhangjie Fu
arXiv Computation and Language
Oct 5

Enrich-on-Graph: Query-Graph Alignment for Complex Reasoning with LLM Enriching

Enrich-on-Graph (EoG) is a flexible framework that uses large language models to enrich knowledge graphs, thereby bridging the semantic gap between structured graphs and unstructured queries in complex reasoning tasks. By leveraging LLMs’ prior knowledge, EoG enables efficient evidence extraction from knowledge graphs, achieving precise and robust reasoning while maintaining low computational costs and scalability. The authors also introduce three graph quality evaluation metrics for query‑graph alignment, theoretically validate their optimization objectives, and demonstrate state‑of‑the‑art performance on two KGQA benchmark datasets.

By Songze Li, Zhiqiang Liu, Zhengke Gui, Huajun Chen, Wen Zhang
arXiv AI
Sep 17

WFM: Wiki Foundation Model for Complex Agentic Reasoning

The paper introduces WFM, a Wiki Foundation Model designed to support complex agentic reasoning by combining dense document contexts with markdown-based topological linkages. It formalizes a Wiki Graph schema that preserves explicit topologies while embedding continuous semantics, and employs a query‑conditioned attentive aggregation for efficient message passing. The authors also propose an NCCL‑based protocol to reduce distributed system overhead, achieving a 10.5× training speedup and strong performance on long‑term memory and multi‑hop reasoning benchmarks.

By Junnan Dong, Linhao Luo, Senlei Zhang, Gong Chen, Taian Guo, Yifei Yu, Rong Tao, Tao Guo, Qian-Wen Zhang, Siyu An, Ruizhi Qiao, Xing Sun
arXiv Machine Learning
Sep 2

Breaking the Reasoning Horizon in Entity Alignment Foundation Models

The paper introduces a new entity alignment foundation model that overcomes the limitations of existing models by addressing the "reasoning horizon gap". It employs a parallel encoding strategy that uses seed entity pairs as local anchors to guide message passing, thereby shortening inference paths and improving alignment across sparse, heterogeneous knowledge graphs. The model also incorporates a merged relation graph and a learnable interaction module, and experimental results demonstrate its strong generalizability to unseen knowledge graphs.

By Yuanning Cui, Zequn Sun, Wei Hu, Kexuan Xin, Zhangjie Fu