cs.CVOct 15, 2026

MMSearch-OPD: Easy Made Hard, Hard Made Learnable for Long-Horizon Multimodal Search Agents

Authors: Huanyao Zhang, Jiepeng Zhou, Jiaye Lin, Ontai Tang, Jingtian Hao, Mugeng Liu, Ru Peng, Lang Mei, 

Organizations: Peking University · HKUST(GZ) · Tsinghua University · The University of Hong Kong · 

Abstract

Multimodal deep search is moving from short queries to long-horizon investigations that continually acquire evidence. However, training such agents remains constrained by limited challenging training questions and insufficient process feedback. We introduce MMSearch-OPD, combining controllable data refinement with joint reinforcement learning (RL) and on-policy distillation (OPD). Our Refine pipeline performs targeted expansion of reasoning chains derived from existing simple multimodal questions. Parameterized transformations control search depth and cross-modal evidence requirements while reusing existing image--question pairs. For training, answer rewards and lightweight behavior penalties guide RL, while the reward gap modulates token-level teacher guidance on imperfect student trajectories. An exponentially decaying distillation coefficient reduces teacher dependence as training proceeds. Experiments show gains from data refinement and further improvements from joint training after SFT, indicating stronger long-horizon multimodal deep search capabilities.

Figures & tables

Explore similar work

CardsList
  1. OpenSearch-VL: An Open Recipe for Frontier Multimodal Search Agents

    May 6, 2026Shuang Chen, Kaituo Feng, Hangting Chen +7Multimodal IRMultimodal Search Agents

  2. MTA-Agent: An Open Recipe for Multimodal Deep Search Agents

    Apr 7, 2026Xiangyu Peng, Can Qin, An Yan +4Multimodal Search AgentsMultimodal QA