2026· Annual Meeting of the Association for Computational Linguistics· pp. 37508-37531· 0 citations· 54 references
Computer Science
TL;DR
TH-RAG is proposed, a hierarchical framework that organizes triplets into subtopics and topics, enhancing connectivity, integrating dispersed information, and supporting robust multi-hop reasoning, providing a scalable foundation for graph-based RAG systems.
Abstract
Retrieval-augmented generation (RAG) enables large language models (LLMs) to incorporate external knowledge at inference. Graph-based RAG extends this by organizing corpora into knowledge graphs, improving multi-hop reasoning and offering a global understanding of the corpus. However, triplet-based graphs generated by LLMs are often fragmented and poorly connected, which reduces coherence and hinders reasoning. Prior enrichment meth-ods such as clustering, community detection, or approximate graph algorithms attempt to restore connectivity but incur high computational cost and risk semantic distortion. To address these issues, we propose TH-RAG, a hierarchical framework that organizes triplets into subtopics and topics, enhancing connectivity, integrating dispersed information, and supporting robust multi-hop reasoning. Experiments on abstractive and specific QA benchmarks show that TH-RAG outperforms strong baselines in accuracy and robustness while remaining efficient, providing a scalable foundation for graph-based RAG systems. To support further research, we release our code in our GitHub repository.
This work introduces a GLM-based retriever and investigates the comparative strengths of GLM-based, GNN-based, and traditional vector-search-based retrievers in single- and multi-hop RAG settings, and suggests that finetuned GLM retrievers generalize better out of domain.
Experimental results demonstrate that the VDGR-RAG method significantly outperforms a variety of RAG baselines in terms of both knowledge retrieval recall and QA accuracy.
Wenqi Chen, Haofei Yang, Rui Yang et al.· 0 citations
A unified framework that embeds unstructured text into structured knowledge graphs, creating a heterogeneous network for flexible evidence retrieval, outperforming SOTA baselines in answer accuracy and reasoning fidelity while maintaining extremely low token costs and near real-time inference is proposed.
This work proposes Dynamic Decomposition and Filtering for Multi-Hop Reasoning-Augmented Generation (D2F-ReAG), a novel paradigm that adaptively controls reasoning depth by judging the reliability of the root-level reasoning.
Jiaoyang Li, Junhao Ruan, Sheng-Wei Tang et al.· 0 citations
NGM-RAG is introduced, a novel framework that leverages graph structures to effectively capture and utilize relational knowledge for improved retrieval and answer generation and proposes a neural graph matching approach that combines text-based matching with Graph Neural Networks (GNNs).
Guo Chen, Ziwen Li, Mao Zheng et al.· arXiv.org· 0 citations
Experimental results show consistent gains in answer quality and evidence faithfulness over strong multimodal RAG, graph-retrieval, and open-source vision-language baselines, with improved retrieval quality on MultiModalQA and stable performance under noisy evidence pools.
Zafar Ali, Asad Khan, Aalia Malik et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.