Knowledge-Based Visual Question Answering (KB-VQA) relies on retrieving external information to answer queries involving long-tail entities. However, existing retrieval pipelines predominantly employ CLIP-style dual encoders, which prioritize surface-level visual similarity over entity-level semantic alignment. This paradigm often fails when semantically identical concepts exhibit large visual variations or when distinct entities appear visually similar. To address this, we propose KBMR, the first MLLM-based embedding retriever tailored for KB-VQA. Leveraging the robust autoregressive capabilities of MLLMs, KBMR maps images into a semantic space that better preserves concept identity. To tackle the challenge of noisy supervision in Wikipedia-scale retrieval, we introduce an MLLM-based semantic discriminator that generates continuous entity-consistency weights. These weights guide a novel continuous semantic distillation objective, enabling effective hard negative sampling and soft supervision beyond rigid binary labels. Extensive experiments demonstrate that KBMR significantly outperforms CLIP baselines, yielding up to a 14.7% improvement in retrieval Recall@1 and a 9.4% gain in end-to-end VQA accuracy. Code is available at https://github.com/realHarryX/KBMR.
Figures & tables
Figure 1. Motivation and overview of KBMR for KB-VQA retrieval. Traditional CLIP retrieval prioritizes surface-level visual similarity, which is fragile to view inconsistency and often leads to entity confusion, recalling semantically mismatched evidence and producing incorrect answers. Our method leverages MLLM to retrieve entity-aware semantic knowledge entries, providing a higher-fidelity candidate pool and improving downstream answer grounding.
Figure 2. KBMR with hard negative sampling and continuous semantic distillation. Given an entity-centric KB-VQA query, Stage-1 uses a frozen encoder to retrieve a candidate pool. Stage-2 applies an MLLM-based Semantic Discriminator to score each query–candidate pair and produce entity consistency weights. Stage-3 samples hard negatives via weights to form training data. We train the retriever via continuous semantic distillation by aligning its similarity distribution with the discriminator-induced soft prior using a KL-based loss. Right: training data construction. Left: continuous semantic distillation training.
Method
w/ KBMR
E-VQA
InfoSeek
Single-Hop
All
Unseen-Q
Unseen-E
All
EchoSight † ( 61 )
✗
19.1
19.4
27.1
27.9
27.7
✓
26.7
27.6
35.1
36.3
36.0
Δ
+7.6
+8.2
+8.0
+8.4
+8.3
EchoSight ‡ ( 61 )
✗
42.0
41.8
30.7
31.5
31.3
✓
51.3
51.0
38.7
39.6
39.2
Table 1. VQA accuracy on E-VQA and InfoSeek. † indicates the EchoSight model without reranking, and ‡ indicates the EchoSight model with reranking. ⋄ indicates that MMKB-RAG is not open source, so we obtained the results by replicating the paper. Rows in blue correspond to replacing the retriever with KBMR. Red values denote absolute performance improvements.
Retriever
E-VQA
InfoSeek
R@1
R@5
R@10
R@20
R@1
R@5
R@10
R@20
CLIPs
CLIP I-T ( 42 )
3.3
7.7
12.1
16.5
32.0
54.0
61.6
68.2
CLIP ViT-L/14 ( 42 )
9.9
22.0
27.8
31.7
22.5
40.4
42.7
44.1
EVA-CLIP-8B ( 43 )
13.3
31.3
41.0
48.8
45.6
67.1
73.0
77.9
MLLM Retriever
Table 2. Retrieval performance on E-VQA and InfoSeek. ▲ denotes the universal retrieval methods.
Method
Pseudo Recall@5
VQA score
PreFLMR ( 28 )
70.9
61.9
OMGM ( 63 )
73.4
66.6
Wiki-PRF-7B ( 12 )
-
77.8
KBMR(Qwen2-VL-7B)
78.1
76.3 *
KBMR(LLaVA-OV-7B)
80.4
79.3 *
Table 3. Comparison of the retrieval and VQA results on OK-VQA. * Results obtained by replacing OMGM’s retriever.
Negative Sampling
Training Weights
E-VQA
InfoSeek
R@1
R@5
R@1
R@5
Random
Hard one-hot weights
9.1
18.7
20.3
36.8
CLIP similarity
Hard one-hot weights
14.7
34.9
47.1
70.3
SD
Hard one-hot weights
16.4
40.1
53.1
71.6
SD
30% inverted SD weights
12.1
30.4
43.3
62.1
SD
10% inverted SD weights
19.9
38.2
54.4
68.8
Table 4. Analysis of different hard-negative construction and supervision strategies for studying the effectiveness of SD signals. All settings use 8 hard negatives per query.
SD
E-VQA
InfoSeek
R@1
R@5
R@1
R@5
InternVL3-8B
20.7
44.3
54.4
67.9
InternVL3-14B
24.4
49.1
59.1
73.4
Qwen2.5-VL-7B
24.7
48.7
60.3
74.7
Table 5. Ablation study on different Semantic Discriminator.
#Negatives
E-VQA
InfoSeek
R@1
R@5
R@1
R@5
4
22.5
45.1
57.7
69.8
6
23.3
46.8
59.1
72.4
8
24.7
48.7
60.3
74.7
10
24.2
48.7
60.2
74.8
Table 6. Ablation study on the number of hard negatives.
Model
γ
E-VQA
InfoSeek
R@1
R@5
R@1
R@5
KBMR (LLaVA-OV-7B)
0.9
23.3
46.0
57.6
71.2
1.0
24.1
47.8
59.1
72.4
1.1
24.7
48.7
60.3
74.7
1.2
24.4
48.0
59.4
73.2
Table 7. Ablation on the semantic sharpness coefficient γ .
Figure 3. Global distribution of semantic consistency weights across the Top-50 highest-similarity negative candidates.
Figure 4. Qualitative analysis on KB-VQA retrieval . (a) shows the query with an image of a Corvus albicollis; (b) shows the GT document of Corvus albicollis; (c) and (d) show the top-5 retrieved images from EVA-CLIP and our proposed KBMR, respectively. The answer is highlighted in green.
Knowledge-based visual question answering combines image understanding with external or learned knowledge to answer questions requiring facts beyond the image.
Knowledge-Based Visual Question Answering (KB-VQA) requires retrieving entity knowledge from external sources to answer visually grounded questions. Existing retrieval-augmented systems suffer from two critical limitations. First, relying on a single retrieval modality creates a Single-Source Retrieval Bottleneck, missing ground-truth entities that are only accessible through complementary sources. Second, dual-tower pointwise rerankers suffer from Retrieval-Source-Blind Reranking, as they overlook retrieval origins and candidate-level retrieval priors, leading to redundant modality reliance. To address these challenges, we propose UniHEAR, a unified lightweight framework for heterogeneous-source entity retrieval and reranking. UniHEAR constructs a Coarse Retrieval Descriptor for each candidate entity, and introduces Retrieval-Guided Attentive Modality Gating to condition modality attention weights on this descriptor, complemented by Entropy-Weighted Source Fusion of coarse retrieval priors. A hybrid training strategy combining contrastive learning with an auxiliary modality-preserving loss unifies entity-level and section-level retrieval within a single model. Extensive experiments on E-VQA and InfoSeek demonstrate that UniHEAR achieves state-of-the-art retrieval and VQA performance, improving Recall@1 by 6.7 and 1.2 points over the strongest baselines while maintaining a lightweight reranking architecture. Code and model are available at https://github.com/iven-luo/UniHEAR.
Ganzhong Luo, Yang Ren, Hanyong Wang +2
School of Aeronautics and Astronautics, Sichuan University
Knowledge-based Visual Question Answering (KB-VQA) requires models to retrieve visual entities matching the query image from large-scale encyclopedic knowledge bases and answer related questions. Existing multimodal Retrieval Augmented Generation (mRAG) methods rely on global visual features to match candidate entities, yet when the knowledge base contains numerous visually similar entities, the retriever struggles to distinguish them, populating the candidate set with visually similar but factually mismatched distractors. Since subsequent processing steps such as noise filtering are also confined to this fixed candidate set, errors from failed retrieval inevitably propagate to the final answer. To address these challenges, we propose MMAgent-R2, an agentic mRAG framework that integrates visual reranking and active rejection as its internal verification mechanism. Visual reranking directly compares query and candidate images, capturing discriminative details beyond textual descriptions to precisely identify the target entity among similar candidates; active rejection discards unreliable results and retrieves additional candidates when no confident match is found, moving beyond the fixed candidate pool. We design a composite reward function with step-level verification rewards and achieve joint optimization of external retrieval, internal verification, and answer generation via GRPO training. Experiments on InfoSeek, E-VQA, and MMhops demonstrate that \ours{} achieves state-of-the-art performance, with particularly notable advantages in challenging retrieval scenarios and complex multi-image multi-hop reasoning tasks.
Tao Zhang, Ziqi Zhang, Zongyang Ma +7
State Key Laboratory of Multimodal Artificial Intelligence Systems, CASIA · School of Artificial Intelligence, University of Chinese Academy of Sciences · Beijing Key Laboratory of Super Intelligent Security of Multi-Modal Information +3
Knowledge-Based Visual Question Answering (KB-VQA) requires grounding visual queries to external knowledge beyond directly observable content in images. While recent multi modal large language models (MLLMs) show strong perceptual abilities, they struggle on KB-VQA tasks requiring groundings from both fine-grained entity and evidence levels. Most existing multi-modal retrieval augmented generation (MM-RAG) methods tightly couple entity discrimination and section-level evidence ranking into a single re-ranking stage, leading to high cost and limited generalization. In this work, we revisit existing MM-RAG solutions from a workflow perspective and argue both entity-level and fact-level groundings are key bottlenecks. We observe that although MLLMs often fail under open-ended entity naming, they can better identify the correct entity when selecting from a small set of candidate names. Based on this insight, we propose a simple and training-free identify-before-answer IBA framework that decouples entity identification from section-level re-ranking. Our approach prompts an MLLM to select high-confidence entities using only candidate names, followed by an off-the-shelf textual re-ranker for evidence selection. Experiments on Encyclopedic-VQA and InfoSeek show that our method consistently outperforms fine-tuned multi-modal re-ranking baselines while reducing training and inference complexity. Additional analyses reveal that the improvements arise not only from better entity identification, but also from selecting more informative evidence once correct entity is fixed. Our implementation is made public to ease reproducibility.
Qian Ma, Qiong Wu, Zhengyi Zhou +1
Rensselaer Polytechnic Institute · AT&T Chief Data Office