CORTEXA
← Browse
arxivcs.CLcs.AI2026-07-07

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

Sambaran Bandyopadhyay, Ananth Muppidi

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. To address this, we propose RSF-GLLM, a framework decoupling differentiable graph reasoning from answer generation. Our Recurrent Soft-Flow (RSF) module employs a GRU-guided query updater to propagate continuous relevance scores, utilizing a dynamic gating mechanism to traverse semantically dissimilar bridge nodes via structural cues. We introduce flow sparsity regularization to theoretically guarantee convergence from soft probabilities to discrete reasoning paths. These paths are extracted and textualized to fine-tune a Large Language Model (LLM), ensuring generation is grounded in factual topology. Experiments on WebQSP and CWQ demonstrate that RSF-GLLM achieves competitive performance with superior inference efficiency compared to LLM based computationally expensive approaches.

View free PDFSource page

Related papers

arxivcs.CLcs.AI2026-06-30

Gated Multi-Graph Fusion via Graph Attention Networks for Alzheimer's Disease Detection

Jinyu Li, Xiao Wei, Bin Wen, Kai Li, Yuqin Lin, Xiaobao Wang, et al.

Spontaneous speech is a vital non-invasive biomarker for Alzheimer's Disease (AD), yet many systems overlook non-linear structural disruptions and clinical heterogeneity in pathological language. We propose a Multi-View Gated Graph Attention Network that transcribes audio via Aut…

View free PDFSource page
arxivcs.CLcs.AI2026-07-03

Conditional Diffusion Guided Knowledge Transfer for Multi-Domain Knowledge Graph Completion

Jiawei Sheng, Taoyu Su, Xixun Lin, Xiaodong Li, Tingwen Liu

Multi-domain knowledge graph completion (MKGC) aims to improve missing triple prediction in a target KG by transferring knowledge from other support KGs. Existing methods typically enforce consistency constraints on equivalent entities across KGs to transfer knowledge, which risk…

View free PDFSource page
arxivcs.CLcs.AI2026-07-20

DeLIVeR: Decomposed Learning for Information-grounded Veracity Recognition via Reinforced Knowledge Graph Exploration

Cong Hoan Nguyen, Thomas Hoang, Hieu Minh Duong, Long Nguyen

Automated fact-checking remains a challenge for Large Language Models (LLMs) due to "query brittleness" in traditional retrieval systems. We propose DeLIVeR (Decomposed Learning for Information-grounded Veracity Recognition), a framework that treats evidence retrieval as a reinfo…

View free PDFSource page
arxivcs.AIcs.CL2026-07-12

STEC: Evidence Compression for Deep Search in Open-domain Multi-Hop QA

Xinkang Li, Rong Jiang, Xin Song, Ye Wang, Yue Han, Changjian Li

In open-domain multi-hop question answering (QA), LLM-based search agents offer a promising approach to knowledge-intensive QA by combining retrieval with reasoning. Existing methods mainly improve open-domain multi-hop QA through reasoning paradigms, retrieval interaction, and s…

View free PDFSource page
arxivcs.CLcs.AIcs.LG2026-07-01

DiscoLoop: Looping Discrete Embeddings and Continuous Hidden States for Multi-hop Reasoning

Hengyu Fu, Tianyu Guo, Zixuan Wang, Hanlin Zhu, Jason D. Lee, Jiantao Jiao, et al.

Large language models achieve strong performance on many reasoning tasks when allowed to externalize intermediate steps as Chain-of-Thought (CoT). However, many questions require the model to internalize the multi-step reasoning within a single forward pass before generating the…

View free PDFSource page
arxivcs.DBcs.AIcs.CL2026-07-22

Demonstrating GenDB: Instance-Optimized and Customized Query Processing Code Generation via LLM Agents

Jiale Lao, Immanuel Trummer

Traditional query processing engines require continuous development and extensions to support new techniques and user requirements, and in some cases, entirely new systems must be built from scratch. However, these engines are difficult to extend due to their internal complexity,…

View free PDFSource page