Visually Interpretable Subtask Reasoning for Visual Question Answering
Yu Cheng, Arushi Goel, Hakan Bilen
TL;DR
This work addresses the interpretability gap in vision-language large language models for visual question answering by introducing VISTAR, a subtask-aware reasoning framework. VISTAR generates Subtask-of-Thought (SoT) rationales via LLM prompts and then fine-tunes MLLMs to produce both textual explanations and object-level visual grounding, eliminating the need for external program execution. The authors create GQA-SoT, an augmented dataset with over 200k SoTs for training and validation, and demonstrate state-of-the-art compositional VQA performance on GQA while improving interpretability metrics such as bounding-box grounding and rationale quality. They also show zero-shot generalization to CRIC and perform comprehensive ablations to validate the contribution of bounding boxes and intermediate steps, highlighting the practical impact of structured, interpretable reasoning in multimodal tasks.
Abstract
Answering complex visual questions like `Which red furniture can be used for sitting?' requires multi-step reasoning, including object recognition, attribute filtering, and relational understanding. Recent work improves interpretability in multimodal large language models (MLLMs) by decomposing tasks into sub-task programs, but these methods are computationally expensive and less accurate due to poor adaptation to target data. To address this, we introduce VISTAR (Visually Interpretable Subtask-Aware Reasoning Model), a subtask-driven training framework that enhances both interpretability and reasoning by generating textual and visual explanations within MLLMs. Instead of relying on external models, VISTAR fine-tunes MLLMs to produce structured Subtask-of-Thought rationales (step-by-step reasoning sequences). Experiments on two benchmarks show that VISTAR consistently improves reasoning accuracy while maintaining interpretability. Our code and dataset will be available at https://github.com/ChengJade/VISTAR.
