Skip to content
Preprint

GraphLoom: Reliability-Calibrated Graph Evidence Routing for Multimodal KG-RAG

Aug 2026 · 1 citation · 38 references
Computer Science

TL;DR

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.

Abstract

Multimodal retrieval-augmented generation (RAG) systems often rely on long unstructured contexts or aggressively expanded evidence graphs, which can introduce noisy evidence, weaken multi-hop reasoning, and increase unsupported generation. We present GraphLoom, a reliability-calibrated multimodal knowledge-graph RAG framework for compact and faithful evidence routing. Given a question and its associated multimodal input, GraphLoom constructs an instance-level multimodal knowledge graph from grounded scene descriptions, extracted relational triples, and external commonsense knowledge. Instead of injecting all retrieved evidence into the generator, GraphLoom performs reliability-aware subgraph retrieval with bounded expansion and selectively routes high-utility evidence through hierarchical graph memory slots and joint graph-sequence attention in a frozen language model. To improve robustness in complex reasoning settings, GraphLoom further combines interleaved retrieval with budgeted corrective retrieval, enabling adaptive multi-hop evidence refinement under noisy retrieval conditions. We evaluate GraphLoom on ScienceQA, MultiModalQA, and OK-VQA, including large distractor evidence pools that approximate noisy external knowledge retrieval. 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. Additional analyses using MiniCheck-based verification, human evaluation, and latency profiling show that reliability-calibrated graph evidence routing provides an effective alternative to long-context multimodal evidence injection.

View source

Similar papers

Preprint Aug 2026

LivingRAG: Augmenting Graph RAG with Experience

LivingRAG adds a writable experience store to a graph-based retrieval backbone, enabling verified experiences to be reused during inference in two ways, and analyzes online QA streams and finds reusable signals from shared entities, graph neighborhoods, and question templates.

Yuqing Cui, Zongye Zhang, Qing-Jie Liu · 0 citations
Jul 2026

HVM-GraphRAG: Holistic-View Multimodal Graph Retrieval-Augmented Generation on Complex Document

HVM-GraphRAG uses a holistic view to guide graph construction, thereby reducing noisy and conflicting graph updates and building reliable indices between concept-level graph nodes and supporting multimodal chunks and enabling the answering model to better integrate heterogeneous evidence.

Xingbo He, Yi-Li Wang, Wenqi Fan et al. · 1 citation
Preprint Aug 2026

MEGRAG: Multi-Granular Evidence Graphs for Answer-Aware Multi-Hop RAG

MEGRAG is an answer-aware framework that represents multi-hop reasoning as a path-structured multi-granular evidence graph and uses the resulting intermediate answer and prior reasoning to decide whether the Initial Query has been resolved.

Weidong Bao, Yingying Sun, Jun Yang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

MOSAIC: Query-Aware Exploration Policy Adaptation for GraphRAG

Mosaic is presented, a training-free framework that formulates GraphRAG retrieval as a per-query control problem that converts query-specific evidence requirements into a bounded policy over seed selection, graph traversal, stopping, and evidence selection while the corpus graph, indexes, scoring functions, grounding p...

Eunkyeong Lee, Kyeong-Jin Oh, Jinwon Kim et al. · 0 citations
Preprint Aug 2026

GraphMemix: Query-Aware Evidence Forests for Long-Term Multimodal Agent Memory

Organizing long-term memory for multimodal agents remains challenging because existing methods either suffer from expensive question-agnostic offline summaries or naive embedding similarity matching that introduces incomplete and redundant context. To address these issues, we propose GraphMemix, a combinatorial-optimiz...

Geng Li, Yuheng Wang, Dong Li 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.