arXiv AI

Think Parallax: Solving Multi-Hop Problems via Multi-View Knowledge-Graph-Based Retrieval-Augmented Generation

The paper introduces ParallaxRAG, a multi-view retrieval-augmented generation framework that addresses multi-hop reasoning challenges in large language models over knowledge graphs. It identifies that transformer attention heads specialize in distinct semantic relations across reasoning stages, forming a hop-aligned relay pattern, and proposes decoupling queries and KGs into head-specific semantic spaces to enforce relational diversity. Experiments on WebQSP, CWQ, and BioASQ show state‑of‑the‑art performance, reduced hallucination, and strong generalization.

arXiv AI
Oct 9

GLM-RAG: Graph Language Models for Graph-Based Retrieval-Augmented Generation

GLM-RAG introduces a graph language model (GLM) based retriever for retrieval‑augmented generation over knowledge graphs. The study compares GLM‑based, graph neural network (GNN)‑based, and vector‑search retrievers across single‑ and multi‑hop settings, emphasizing transferability to unseen domains. Results show that finetuned GLM retrievers achieve state‑of‑the‑art performance on two multi‑hop benchmarks and generalize better out of domain, while GNN retrievers excel at graph coverage and vector‑search performs best on single‑hop tasks.

By Maya Arseven, Anette Frank, Beni Egressy, Johann Higl, Moritz Plenz
arXiv Computation and Language
Oct 22

Graph Topology Meets Energy-Driven Pathfinding: Preserving Contextual Consistency in Retrieval-Augmented Generation

ThreadRAG is a retrieval‑augmented generation framework that preserves contextual consistency by structuring retrieved documents into Semantic Nodes and building a Semantic Topology Graph (STG). It uses Energy‑Driven Pathfinding (EDP) to identify query‑relevant subgraphs and linearize them into coherent textual evidence paths. Experiments on HotpotQA, 2WikiMultihop, and another benchmark show ThreadRAG outperforms strong baselines, achieving a 14.4% EM gain on HotpotQA and a 5.8% EM lead on 2WikiMultihop while cutting token cost to 23.3% of the strongest baseline.

By Yufeng Li, Zaijing Li, Fuchen Zhang, Zongzong Wu, Ming Zhao, Fengxiao Tang
arXiv AI
Jul 8

RSF-GLLM: Bridging the Semantic Gap in Multi-Hop Knowledge Graph QA via Recurrent Soft-Flow and Decoupled LLM Generation

arXiv:2607. 06527v1 Announce Type: cross Abstract: Multi-hop Question Answering over Knowledge Graphs faces a critical challenge: traditional retrieve-then-read pipelines break differentiability, preventing the retriever from learning to bridge the semantic gap where intermediate nodes lack lexical overlap with the query.

By Sambaran Bandyopadhyay, Ananth Muppidi
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