Large Multimodal Models (LMMs) excel at visual perception but struggle with real-time, knowledge-intensive queries due to their reliance on static parametric knowledge. While multimodal search agents offer a promising solution, developing them from vanilla LMMs presents two major challenges: the lack of open recipes to cultivate search agency from scratch, and the severe context explosion (attention dilution) that occurs during long-horizon multi-turn investigations. In this paper, we address both challenges by developing a native multimodal search agent. First, we introduce an open training recipe featuring Agentic Seeding, a formative training stage that bootstraps tool-use and planning abilities directly from a non-agentic foundation. Second, to overcome the context bottleneck, we propose V-Fold, an adaptive memory management mechanism. V-Fold retains recent interactions as high-fidelity text while folding stale historical context into the visual space via rendering, exploiting the model's cross-modal alignment to preserve raw evidence without text token redundancy. Combining these innovations, we present POINTS-Seeker-8B, which achieves state-of-the-art performance among models of comparable scale across six multimodal search benchmarks.
Figures & tables
Figure 1: Overview of POINTS-Seeker. Our model adaptively interacts with external tools to solve complex, multi-hop VQA tasks. By leveraging V-Fold compression, stale history is rendered into compact visual tokens, effectively bypassing long-context performance degradation while achieving efficiency and reasoning fidelity.
Figure 2: The framework of our agentic search system. (a) Training stages, including Agentic Seeding, SFT, and RL. (b) V-Fold, which adaptively compresses stale history into visual tokens for efficient long-context reasoning.
Figure 3: Motivation for history-aware compression. (a) Performance degradation in long-context scenarios. (b) The presence of GT in the failure case history indicates that compression must minimize historical information loss.
Model
MMSearch
MMSearch+
FVQA
SimpleVQA
LiveVQA
BC-VL
Direct Answer
GPT-5
33.3
19.1
57.3
61.7
57.5
47.2
Gemini-2.5 Flash
30.4
8.1
47.7
55.5
51.0
37.1
Qwen3-VL-8B-Instruct
15.2
3.2
28.0
42.9
41.0
25.1
RAG Workflow
GPT-4o
24.1
-
-
61.6
34.0
13.4
Table 1: Comparison with state-of-the-art models.
Seeding
SFT
RL
V-Fold
MMSearch
MMSearch+
FVQA
SimpleVQA
LiveVQA
BC-VL
POINTS-Seeker
✘
✔
✘
✘
63.2
18.0
67.9
65.1
70.8
32.3
✔
✔
✘
✘
66.1
23.0
68.9
66.4
76.8
39.8
✔
✔
✔
✘
69.6
23.4
71.2
68.0
77.3
42.6
✔
✔
✔
✔
70.8
25.2
71.2
68.8
77.7
44.4
Qwen3-VL-8B-Instruct
Table 2: Ablation study on our core design.
Method
Dataset
Acc
Resp. Len.
w/o V-Fold
BC-VL
42.6
9530
V-Fold
BC-VL
44.4 (1.8 ↑ )
7353 (22.8% ↓ )
w/o V-Fold
MMSearch+
23.4
9178
V-Fold
MMSearch+
25.2 (1.8 ↑ )
6871 (25.1% ↓ )
Table 3: Impact of V-Fold on length and accuracy.
Method
FVQA-H
LiveVQA-H
BC-VL-H
No Compression
48.0
48.8
21.3
Discard History
52.0
50.2
21.3
Summarization
50.0
48.8
22.7
Image Rendering
48.0
44.4
17.3
Our V-Fold
54.0
50.7
26.7
Table 4: Comparison under long-horizon settings.
Method
MMBench
MMStar
MMMU
MathVista
Hallu.
AI2D
OCRBench
MMVet
Avg.
POINTS-Baseline
74.9
55.5
52.4
75.7
53.2
81.6
85.1
67.8
68.3
POINTS-Seeker
79.1
59.7
52.6
73.7
54.2
84.8
86.7
73.9
70.6
Table 5: Performance on general VQA benchmarks.
Figure 4: Visualization of POINTS-Seeker. Additional qualitative results are in the supplementary materials.
τ
4k
8k
12k
8k
8k
8k
k
2
2
2
0
2
4
Acc.
25.2
25.2
23.4
23.4
25.2
25.2
Table 6: Ablation study on hyperparameters.
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
Method
MMSearch
MMSearch+
FVQA
SimpleVQA
LiveVQA
BC-VL
V-Fold RL
70.8
24.3
70.6
68.0
78.5
42.1
Our RL
70.8
25.2
71.2
68.8
77.7
44.4
Appendix
Table 7: Ablation study on RL training strategy.
Parameter
Value
page-size
595×842
dpi
72
margin-x
10
margin-y
10
font-path
Verdana.ttf
font-size
9
Appendix
Table 8: Parameter configuration for image rendering.
Figure 5: Case Study 1: SFT vs. RL. Details are simplified for visualization.
Figure 6: Case Study 2: SFT vs. RL. Details are simplified for visualization.
Figure 7: Tool usage analysis for POINTS-Seeker across six diverse evaluation benchmarks.
Multimodal deep search agents have shown great potential in solving complex tasks by iteratively collecting textual and visual evidence. However, managing the heterogeneous information and high token costs associated with multimodal inputs over long horizons remains a critical challenge, as existing methods often suffer from context explosion or the loss of crucial visual signals. To address this, we propose a novel Long-horizon MultiModal deep search framework, named LMM-Searcher, centered on a file-based visual representation mechanism. By offloading visual assets to an external file system and mapping them to lightweight textual identifiers (UIDs), our approach mitigates context overhead while preserving multimodal information for future access. We equip the agent with a tailored fetch-image tool, enabling a progressive, on-demand visual loading strategy for active perception. Furthermore, we introduce a data synthesis pipeline designed to generate queries requiring complex cross-modal multi-hop reasoning. Using this pipeline, we distill 12K high-quality trajectories to fine-tune Qwen3-VL-Thinking-30A3B into a specialized multimodal deep search agent. Extensive experiments across four benchmarks demonstrate that our method successfully scales to 100-turn search horizons, achieving state-of-the-art performance among open-source models on challenging long-horizon benchmarks like MM-BrowseComp and MMSearch-Plus, while also exhibiting strong generalizability across different base models. Our code will be released in https://github.com/RUCAIBox/LMM-Searcher.
Yifan Du, Zikang Liu, Jinbiao Peng +5
Gaoling School of Artificial Intelligence, Renmin University of China. · City University of Hong Kong.
Multimodal large language models (MLLMs) have demonstrated impressive capabilities in many visual tasks, but they often struggle with factual grounding when confronted with complex, open-world scenarios. While recent multimodal deep search agents attempt to address this issue by utilizing external tools, the visual-native search paradigm remains underexplored. Existing methods primarily rely on simple images with explicit semantics and text-only evidence trajectories, limiting the agent's ability to perform multi-hop, cross-modal reasoning and search. To address these limitations, we propose Visual-Seeker, a visual-native multimodal deep search agent via active visual reasoning. Rather than treating vision as a static input, our agent actively attends to fine-grained visual details, dynamically harvests visual evidence throughout the search process. To unlock its visual-native potential, we design an active visual reasoning data pipeline and synthesize 5K high-quality multimodal trajectories for model training. Extensive experiments demonstrate the state-of-the-art performance across five challenging multimodal search benchmarks, even surpassing several proprietary models, validating robust visual-native reasoning and search in real-world web environments. The code and data can be accessed at: https://github.com/ZhengboZhang/Visual-Seeker.
Zhengbo Zhang, Changtao Miao, Jinbo Su +10
School of Artificial Intelligence, UCAS · Institute of Automation, CAS · Ant Digital Technologies, Ant Group +2
Multimodal large language models (MLLMs) have demonstrated strong capabilities in visual understanding, yet they remain limited in complex, multi-step reasoning that requires deep searching and integrating visual evidence with external knowledge. In this work, we address this challenge by constructing high-quality, verified multi-hop vision-language training data for multimodal deep-search agents. We propose a Multi-hop Tool-Augmented Agent for Evidence-based QA Synthesis (MTA-Agent), which automatically selects tools and their parameters to retrieve and validate evidence from both visual and textual sources and generates structured multi-hop question-answer trajectories. Starting from diverse VQA seed datasets, our pipeline produces a large-scale training dataset, MTA-Vision-DeepSearch, containing 21K high-quality multi-hop examples. The data is filtered through a multi-stage verification process to ensure factual consistency and answer uniqueness. Using MTA-Vision-DeepSearch, a 32B open-source multimodal search agent achieves state-of-the-art performance, reaching an average of 54.63% across six challenging benchmarks, outperforming GPT-5 (51.86%), Gemini-2.5-Pro (50.98%), and Gemini-3-Pro (54.46%) under the same tool settings. We further show that training on our data improves both reasoning depth and tool-use behavior, increasing the average number of steps from 2.27 to 4.28, and leading to more systematic and persistent search strategies. Additionally, we demonstrate that training can be performed without real-time tool calls by replaying cached interactions, significantly reducing training cost. Importantly, we present MTA-Agent as a fully open recipe for multimodal deep search: we release the entire dataset, training trajectories, and implementation details to enable reproducibility and future research on open multimodal search agents.