JA EN
LearnAgents
·★ MEMBER·PAPER·9 min read

Paper Explained: Video-DeepResearch — Agents That Watch a Video, Then Chase Down Every Lead

A walkthrough of Video-DeepResearch, which pulls visual clues out of a video and corroborates them with web search. We follow the primary source to see how two failure modes — a modality bias that makes models dodge visual tools, and knowledge leakage that lets them answer from memory alone — are beaten with stage-wise tool unlocking and a two-phase SFT + GRPO recipe.

ModalityimageTaskagents

Video-DeepResearch: Towards the Next-Generation Multimodal Deepresearch Agent

Primary source — what this article is built on

undefined2026-08-04undefined2026-08-13same month

Video-DeepResearch: Towards the Next-Generation Multimodal Deepresearch AgentZhen Fang, Yu Zeng, Wenxuan Huang et al. · 2026-08-04 · v1arXiv:2608.03979Paper page·PDF
undefined

We introduce Video-DeepResearch (Video-DR), extending multimodal agents from static images to continuous video streams, a setting that demands dense spatiotemporal grounding coupled with open-web exploration. Preliminary evaluations reveal two critical bottlenecks in current models: (1) modality bias, where agents bypass visual tools in favor of textual search, and (2) parametric knowledge leakage, where models rely on internal memory rather than genuine tool-augmented execution. To address these challenges, we propose Video-DR, featuring a decoupled perception-exploration pipeline with stage-wise tool unlocking that compels exhaustive cross-frame visual grounding prior to web retrieval. Our framework adopts a two-stage training recipe: supervised fine-tuning followed by Group Relative Policy Optimization (GRPO), enabling autonomous exploration that breaks the imitation-learning ceiling. Furthermore, we curate Video-DR-Bench, a human-AI collaborative benchmark comprising 200 complex, multi-hop VQA instances. Empirical results demonstrate that our Video-DeepResearch-35B-A3B establishes a new state-of-the-art of 64.0% average accuracy, surpassing proprietary Claude-4.5-Sonnet (59.0%) by 5.0 points and significantly outperforming GPT-5 (52.5%) and Gemini 2.5 Pro (57.5%). The 30B-A3B variant achieves 59.3%, competitive with Claude-4.5-Sonnet and demonstrating the effectiveness of our training paradigm even at compact scale. Code: https://github.com/Osilly/Vision-DeepResearch.


What makes "researching" a video hard for an AI

"In which city was the award ceremony held for the prize later won by the person in this video?" Answering that takes two entirely different skills. First, the visual job: watch the footage carefully enough to establish who and what is on screen. Then the investigative job: search the web about that person and stitch several sources together. Think of a detective story — one part is the forensics team lifting a suspect's face from the security footage; the other is the officers taking that photo door to door.

Text-only Deep Research agents came first, then Vision-DeepResearch for still images. What this paper takes on is the continuous video stream — the setting the authors call Video-DeepResearch (Video-DR). Unlike a still image, video carries dense information that changes over time, so the agent has to decide for itself which moment and which region to look at (§1).

Two pathologies in today's agents

The authors begin with a preliminary study, dropping existing models straight into Video-DR tasks, and isolate two failure modes (§2, Empirical Study).

Pathology 1: modality bias, or dodging the visual tools. By the paper's measurements, even Qwen3.5-397B-A17B — among the strongest open-source models available — averages just 0.10 visual tool calls per task. Text search, meanwhile, runs at 1.27. The numbers show the tendency plainly: rather than look at the video, the model tries to get by on text search.

Pathology 2: parametric knowledge leakage. GPT-5 made 0.00 visual and 0.12 text tool calls — essentially reaching for nothing — and still scored 57% on an existing benchmark. It wasn't answering by investigating the video; it was answering from knowledge memorized during training. That says less about the model than about the benchmark: something meant to measure tool-use ability was measuring recall instead.

These two findings are the starting point for everything that follows — the data design, the training recipe, and the benchmark.

Putting the problem in an equation

The paper formalizes Video-DR as sequential decision-making (§2, Problem Formulation). Given a question QQ and a sequence of video frames VV, the agent picks an action aia_i at each step ii.

aiπθ(aHi)a_i \sim \pi_\theta(a \mid \mathcal{H}_i)
(1)

Read aloud: the next move aia_i is drawn stochastically by the policy πθ\pi_\theta — the model that serves as the agent's brain — from everything it has seen so far, the history Hi\mathcal{H}_i (the question, the video, and every past action together with what that action returned).

Spelled out in words: at every step the agent is not following a fixed script, it is drawing its next move, and the only thing it draws on is the record of what has happened up to that point. Change what the earlier steps returned and the next step changes with it — which is exactly why the order in which tools are made available, the subject of the rest of this article, can steer the agent's behavior at all.

The menu of actions includes Select_Keyframe, which pulls out the information-dense moments; Crop_Search, which cuts a rectangle around an object in a frame and runs image search on it; and ordinary text search.

Keyframe selection rests on similarity between embedding vectors. In the paper's data construction, consecutive frames whose CLIP similarity exceeds 0.8 are thrown out as redundant, and each video is narrowed to at most 20 frames (Appendix C).

FIG 1Rotate the two vectors and watch the dot product and cosine similarity respond. The closer their directions, the larger the value — this is the property used to score how alike two frames are, and thinning out near-identical consecutive frames on that basis is the foundation of the paper's keyframe extraction (Appendix C)

A 30K data engine — throwing away anything memory can solve

No training data existed for this, so the authors built a pipeline that synthesizes VQA (video question-answering) pairs from raw footage (§3.1), in three stages. First, videos are gathered from existing datasets and YouTube, cut down by length rules, and then screened by a model (Qwen3.5-35B-A3B) that judges how complex the content is, discarding anything too simple. Next, keyframe candidates proposed by CLIP similarity are confirmed by a larger model, objects inside those frames are cropped with bounding boxes, and image search is run on the crops. A separate model checks whether the search results actually match the meaning of the crop, producing metadata of the form ⟨frame, rectangle, object name, search summary⟩. Finally, that metadata is turned into questions: factual ones about a single object, and compositional ones spanning several.

The step that does the real work here is the leak check. For every generated question, four rollouts are run with all tools disabled, and any question answered correctly even once is discarded permanently (§3.1, Step 2). What survives is guaranteed to be unanswerable without investigation. That process yields 30K VQA p

What's behind this

§

Members-only from here

371 walkthroughs, 26 textbook chapters, 48 student units and 6 close readings — all included for $4.99/mo, with three new explainers every day. Cancel any time; access runs to the end of the period.

Already a member? Sign in to keep reading

References

  1. Zhen Fang, Yu Zeng, Wenxuan Huang, Yiming Zhao et al.. (2026-08-04) Video-DeepResearch: Towards the Next-Generation Multimodal Deepresearch Agent. arXiv:2608.03979Paper page·PDF

This article is written from the source paper above. Where they differ, the original is authoritative.

Comments

Sign in to comment