Search arXiv⌕ Search

arXiv · 2610.22818

FuseRAG: Fusing Structure and Evidence into Inference for Cost-Efficient Graph-based RAG

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tingqi Wang, Yingshu Li, Zhipeng Cai. 2026-10-16. FuseRAG: Fusing Structure and Evidence into Inference for Cost-Efficient Graph-based RAG. https://arxiv.org/abs/2610.22818

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Contextual Utility of Quantization Moves in Extreme Low-Bit LLMs

Accurate measurements of isolated weight replacements need not predict their joint effect on a quantized model. We study this gap for legal replacements at a fixed bitrate, separating isolated pricing error, composition error, and changes in evaluation data. On Llama-3.2-1B and activation-ordered 3B GPTQ bases, option-KL composition residuals are 26x and 42x the sums of absolute midpoint pricing errors; large residuals remain with exact-singleton prices. Exhaustive Qwen3-0.6B lattices reveal context-dependent effects: six of eight moves in the stratified lattice have statistically resolved ARC-KL sign reversals, excluding an exact monotone additive representation. Pair measurements improve prediction of unqueried combinations on both Qwen and Llama. Their value for selection depends on the criterion: the stratified Qwen front retains a quality-coverage advantage after refitting, whereas the 3B additive and quadratic fronts are nearly equal in quality at a one-standard-error tolerance. Low-order endpoint structure leaves continuous gradient responses undetermined, and shared-midpoint prices can differ from those of the executed subset. Support-matched controls show that restricting the number of replacements curbs the failures of large combinations, while additional endpoint search gives bank-dependent NLL/ARC trade-offs.

cs.DB↗

NL2SQL with Iterative Self-Refinement

Bridging the gap between human intent and machine logic remains a critical challenge in data access for non-technical users, yet Large Language Models (LLMs) remain unreliable: they hallucinate schema elements, generate syntactically invalid queries, or fail to capture user intent. These limitations are especially critical in domains such as insurance, where KPIs, regulatory constraints, and legacy relational systems demand high precision. We introduce a multi-agent, persona-driven NL2SQL framework that combines (1) domain relevance detection, (2) schema-grounded knowledge construction, (3) KPI-aware SQL synthesis, (4) syntax-level self-repair using sqlite execution feedback, and (5) semantic consistency checking via SQL-to-NL reverse engineering. Our system significantly reduces query hallucination and improves semantic fidelity compared to direct LLM prompting. Evaluated on 60 queries (50 from a HuggingFace text-to-SQL dataset and 10 custom domain queries), the system achieves 90% correctness using Mistral across seven coordinated LLM calls showing that this approach can substantially increase the reliability of NL2SQL pipelines in high-stakes environments.

cs.DB↗

An Error Taxonomy for Property Graph Data

Graph data are increasingly used in applications where relationships and topology matter. Yet, compared to tabular data, the notions of data quality and error types for graphs are less established. Tabular error concepts often fail to capture structural properties and context inherent in graph data, hindering systematic quality assessment in graph-based systems. We focus on property graphs (PGs) in graph databases. PGs are often managed without a prescriptive schema, enabling data insertion without explicit validation, while still exhibiting an implicit schema of recurring structural patterns. Irregularities in these patterns may indicate errors, but their interpretation depends on the surrounding graph context. To address these challenges, we provide a systematic view of errors in graph data by proposing a comprehensive graph-specific taxonomy of error types. To position these errors with respect to established work on tabular data quality, we derive a mapping between graph errors and corresponding error notions in tabular data. This mapping highlights which concepts transfer across data models and where structural properties of graphs introduce fundamentally different challenges requiring extensions. Overall, the taxonomy and mapping provide a shared vocabulary for describing, characterizing, comparing, and studying graph data errors, and they lay the groundwork for future work on error detection and repair in graph data.

cs.DB↗