arXiv AI

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.

arXiv AI

Aug 26

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.

By Md Saikat Islam Khan Bappy, Oshani Seneviratne

rag nlp benchmarks

arXiv Machine Learning

Jun 2

KG-Guard: Graph-Based Hallucination Detection for Knowledge Base Question Answering

arXiv:2606. 00328v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly used for knowledge base question answering (KBQA), where answering requires selecting entities from a question-specific knowledge-graph subgraph.

By Albert Sawczyn, Piotr Bielak, Tomasz Kajdanowicz

llms rag nlp benchmarks safety

arXiv AI

Sep 15

Cost Characterization of Vertically Partitioned Federated Knowledge Graphs

arXiv:2609.13664v1 Announce Type: new Abstract: Knowledge graphs are increasingly distributed across autonomous organizations that share an entity space but own disjoint subsets of relations, forming...

By Md Saikat Islam Khan Bappy, Oshani Seneviratne

rag agents

arXiv Computation and Language

Oct 1

Explore-on-Graph: Hybrid Embedding-LLM Reasoning for Knowledge Graph Question Answering under Incompleteness

arXiv:2609.39786v1 Announce Type: new Abstract: Large language models (LLMs) are increasingly combined with knowledge graphs (KGs) to ground reasoning in structured evidence. However, most LLM-based...

By Ola El Khatib, Djellel Difallah

llms rag nlp benchmarks

arXiv AI

Aug 25

Compositional Chain-of-Relations for Faithful Knowledge Graph Question Answering with Large Language Models

arXiv:2608.22762v1 Announce Type: new Abstract: Knowledge graph question answering (KGQA) is a key task for evaluating KG-augmented Large Language Models (LLMs), and complex KGQA that requires multi-...

By Chenhui Liu, Jianpeng Zhou, Jiahai Wang

llms agents nlp efficiency benchmarks safety

arXiv Machine Learning

Oct 7

SeedER: Seed-Expand-Retrieve for Efficient Knowledge Graph Retrieval

arXiv:2605.23753v2 Announce Type: replace Abstract: Knowledge graphs (KGs) offer a rich representation for relational knowledge, but their irregular structure makes retrieval challenging: ego-graph e...

By Hamed Shirzad, Frederik Wenkel, Dominique Beaini, Danica J. Sutherland, Emmanuel Noutahi

llms rag agents reinforcement-learning fine-tuning

arXiv Computation and Language

Oct 22

MARS: Multi-hop Adaptive Retrieval and SPARQL Generation for KGQA

MARS is a scalable knowledge‑graph question‑answering system that integrates large language models with knowledge graphs without requiring model fine‑tuning. It uses a structured retrieval process that links question entities to the graph, iteratively fetching next‑hop information and deciding when to stop and generate a SPARQL query. Evaluated on three KGQA benchmarks—including multilingual settings—MARS matches state‑of‑the‑art performance while remaining efficient and scalable.

By Nikit Srivastava, Daniel Vollmers, Ren\'e Speck, Nikolaos Karalis, Hamada M. Zahera, Axel-Cyrille Ngonga Ngomo

llms agents nlp fine-tuning benchmarks

arXiv AI

Oct 7

Foresight-over-Graph: Reasoning Beyond Local Horizons for Knowledge Base Question Answering

arXiv:2610.08388v1 Announce Type: cross Abstract: Large language models (LLMs) have demonstrated strong capabilities in question answering, yet they still frequently suffer from hallucinations on kno...

By Yang Hong, Yajun Yang, Xin Wang, Liping Jing, Qinghua Hu

llms rag nlp efficiency benchmarks safety

arXiv Machine Learning

Sep 30

UltRAG: a Universal Simple Scalable Recipe for Knowledge Graph RAG

arXiv:2603.28773v2 Announce Type: replace-cross Abstract: Large language models (LLMs) frequently generate confident yet factually incorrect content when used for language generation (a phenomenon of...

By Dobrik Georgiev, Kheeran K. Naidu, Alberto Cattaneo, Federico Monti, Carlo Luschi, Daniel Justus

llms rag nlp benchmarks safety

arXiv AI

Aug 11

KGCache: Amortized Subgraph Retrieval for KG Reasoning with LLMs

arXiv:2608. 07954v1 Announce Type: new Abstract: Large language models can answer knowledge-intensive questions more reliably when they are grounded with knowledge graphs, but systems such as Think-on-Graph and Reasoning-on-Graph repeatedly query the same graph neighborhoods across different questions.

By Uros Stanic, Changcheng Yuan, Sabuj Laskar, Ariful Azad

llms nlp

arXiv Computation and Language

Oct 7

Wikidata Search Traces: A Dataset for Training Knowledge Graph Search Agents

arXiv:2610.06650v2 Announce Type: replace Abstract: Wikidata is one of the largest open knowledge bases, yet answering a complex question over it still requires a SPARQL query that names the right en...

By Mohamed Chenene, Carlos Rosas-Hinostroza, Anastasia Stasenko, Shani Evenstein Sigalov, Pierre-Carl Langlais

llms agents

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

llms nlp benchmarks safety

Related stories