This work proposes FuseRAG, a cost-efficient graph-based RAG framework that shifts most retrieved evidence from explicit textual contexts to latent representations, and preserves graph structure through latent interactions, enables evidence reuse beyond exact token-prefix matching.
Abstract
Graph-based retrieval-augmented generation (RAG) exploits relationships among evidence to support multi-hop question answering. However, conveying retrieved graphs through non-unique linear textual contexts to Large Language Models (LLMs) leads to graph-structure degradation and inefficient KV-cache reuse. Meanwhile, graph-structure order optimization is already NP-hard, and the additional KV-cache reuse objective further complicates the search by introducing potentially conflicting orders. To tackle these issues, we propose FuseRAG, a cost-efficient graph-based RAG framework that shifts most retrieved evidence from explicit textual contexts to latent representations. Our main idea is to separate reusable evidence content from query-aware structural interactions in latent space, while retaining only a few explicit facts as semantic anchors. The resulting latent representations are injected into decoder self-attention, where they reshape attention over evidence and thereby influence hidden states and next-token probabilities. This design preserves graph structure through latent interactions, enables evidence reuse beyond exact token-prefix matching. Experiments on three multi-hop question-answering datasets with Llama-3-8B and Qwen3.5-9B show that FuseRAG improves answer quality while achieving up to 2.7x and 2.2x TTFT speedups over the fastest graph-based baseline, respectively.
PoP-RAG is proposed, which features a passage-on-edge (PoE) graph that links the passages with graph edges to resolve the one-to-many entity-passage mapping problem and enables targeted retrieval for each sub-query and ensures transparent response derivation logic, thus enhancing explainability.
Xin-Tong Hu, Qi-Ming Zeng, Yu-Hao Lin et al.· Transactions on Graph Intell...· 1 citation
Graph-based retrieval-augmented generation (GraphRAG) answers multi-hop questions by organizing a corpus into a graph and retrieving along its structure. Existing retrieval methods face two limitations. Diffusion- and similarity-based methods expand retrieval along fixed edge weights or by similarity to the question, w...
Jia-Te Liu, Liu-Yi Chen, Xiao-Fei Yuan et al.· 0 citations
Results show that geometric structure can support efficient multi-hop evidence discovery without LLM-based graph construction, and introduce Geometric Gain Graph RAG, a document-only framework whose offline graph construction uses no LLM calls or generated tokens.
Ze-Liang Li, Xiao-Fen Xing, K. Guo et al.· arXiv.org· 0 citations
Retrieval-Augmented Generation (RAG) mitigates hallucination and knowledge staleness in large language models (LLMs) by injecting external knowledge into the context window, yet its effectiveness is rigidly constrained by attention dilution and inference cost. Existing knowledge-graph-enhanced methods follow a sequenti...
Zi-Hao Zhou, Gang Yin, Ze-Jian Lu et al.· Electronics· 0 citations
Graph-based retrieval-augmented generation supports multi-hop retrieval by organizing corpus information into graphs. However, existing relation-free graph retrieval methods rely primarily on query-sentence similarity to search for evidence. This can exclude useful bridging evidence with low query similarity and activa...
Ba-Xian Liu, Tong Wei· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.