AIAug 22, 2025

MMAPG: A Training-Free Framework for Multimodal Multi-hop Question Answering via Adaptive Planning Graphs

arXiv:2508.16051v22 citationsh-index: 17EMNLP
Originality Incremental advance
AI Analysis

This addresses the issue of error propagation and high computational costs in multimodal reasoning for researchers and practitioners, though it is incremental as it builds on existing retrieval and reasoning methods.

The paper tackles the problem of multimodal multi-hop question answering by proposing a training-free framework that uses an adaptive planning graph to dynamically explore reasoning paths, achieving performance that matches or outperforms trained models on benchmarks like MultimodalQA and WebQA.

Multimodal Multi-hop question answering requires integrating information from diverse sources, such as images and texts, to derive answers. Existing methods typically rely on sequential retrieval and reasoning, where each step builds on the previous output. However, this single-path paradigm makes them vulnerable to errors due to misleading intermediate steps. Moreover, developing multimodal models can be computationally expensive, often requiring extensive training. To address these limitations, we propose a training-free framework guided by an Adaptive Planning Graph, which consists of planning, retrieval and reasoning modules. The planning module analyzes the current state of the Adaptive Planning Graph, determines the next action and where to expand the graph, which enables dynamic and flexible exploration of reasoning paths. To handle retrieval of text to unspecified target modalities, we devise modality-specific strategies that dynamically adapt to distinct data types. Our approach preserves the characteristics of multimodal information without costly task-specific training, enabling seamless integration with up-to-date models. Finally, the experiments on MultimodalQA and WebQA show that our approach matches or outperforms existing models that rely on training.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes