- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies the training of agents for open-web video research, where an agent must discover relevant videos, navigate their temporal content, and answer questions using grounded visual evidence. The paper identifies an important practical bottleneck: training directly with live video-search and video-access services is slow, expensive, and unreliable, whereas a conventional local simulator is stable but may fail to reproduce the variability and failure modes of the deployed environment. Policies trained in such a simplified simulator may therefore exploit simulator-specific shortcuts and transfer poorly to the real web.
The proposed VideoResearchAgent framework contains three main components. First, it synthesizes multi-hop video-research tasks from visual evidence and filters questions that can be answered through text-only shortcuts. Second, it constructs a field-aligned local video simulator that preserves the policy-facing search and video-access interfaces of the live environment. Third, it introduces Retrieval-Domain-Randomized GRPO (RDR-GRPO), which perturbs result rankings, injects hard negatives, corrupts displayed metadata, varies result counts, and occasionally returns empty results. These perturbations simulate not only the functionality of the online tools but also their uncertainty, errors, and structural variability.
The method is evaluated on Video-BrowseComp. For Qwen3.5-4B, supervised fine-tuning improves accuracy from 30.00% to 36.67%, and RDR-GRPO further improves it to 40.48%. The trained policy also uses fewer tool calls and 74.9% fewer cumulative API tokens than the untrained model. Additional analyses suggest that retrieval-domain randomization improves transfer from the local simulator to the live web and reduces repetitive or non-convergent interactions.
Critical strengths
-
The paper identifies an important and practically consequential training bottleneck. Live video search, download, and inspection are slow and unreliable, but a clean and fixed local environment does not adequately represent deployment conditions. This tension is central to scalable training of open-web video agents and is not resolved by simply reproducing the functional API of a search service.
-
The simulator models deployment-time uncertainty rather than only interface functionality. The most valuable aspect of the work is that it explicitly simulates ranking changes, hard distractors, metadata corruption, variable result counts, missing gold results, and empty responses. These perturbations encourage the policy to reformulate queries, inspect alternative candidates, and recover from failures. The resulting improvements in live-web accuracy, interaction convergence, tool-use efficiency, and API-token consumption indicate meaningful practical value even though the underlying algorithmic ideas are relatively incremental.
Critical weaknesses
-
The algorithmic novelty is limited. High-fidelity simulation, domain randomization, synthetic task generation, supervised warmup, and GRPO are established ideas. The primary contribution is their careful adaptation and integration for open-web video research rather than a fundamentally new learning algorithm. I consider this acceptable given the practical importance of the problem, but the paper should characterize the contribution as a video-specific training framework and empirical recipe rather than a broadly novel reinforcement-learning principle.
-
The evidence for sim-to-real generalization could be stronger. Video-BrowseComp contains only 210 tasks, and the key fixed-retrieval versus RDR-GRPO transfer analysis is conducted on a randomly sampled 30% subset of 63 tasks. The comparison emphasizes fitted accuracy trends over training checkpoints, but repeated evaluation on the same small subset may not provide a sufficiently independent estimate of generalization. The main trained result also focuses on one policy backbone. These limitations reduce confidence in how broadly the proposed randomization strategy transfers across models, web conditions, and video domains, although they do not invalidate the central result.
Questions for authors
-
Which retrieval perturbations are most important? Please provide an ablation separating rank intervention, hard-negative injection, metadata corruption, and structural noise/empty results. This would clarify whether the gain comes from general exposure to noise or from a particular deployment failure mode.
-
How much of the final improvement comes from the synthesized task data, SFT trajectory quality, and RDR-GRPO respectively? The reported Base → SFT → RDR-GRPO progression is useful, but an additional control using the same SFT initialization followed by fixed-retrieval GRPO on the full evaluation set would better isolate the contribution of retrieval randomization.
We thank Reviewer HTAC for the insightful review. We are grateful for the precise characterization of our core contribution: identifying the critical training bottleneck for open-web video agents and addressing it via a simulator that explicitly models deployment-time uncertainty rather than mere functional APIs. The constructive suggestions on conceptual positioning and experimental controls are invaluable. Below, we address each point in detail.
W1: Clarification on Algorithmic Novelty and Paper Positioning
We agree with your perspective. Our core contribution lies in designing a video-specific training framework and empirical sim-to-real recipe for open-web video research—a critical, high-impact domain that previously lacked a viable, scalable training methodology due to the severe latency and fragility of live web environments. As you noted, merely reproducing the functional API of a search backend is insufficient because agents easily exploit static retrieval shortcuts. Our key contribution is the disciplined adaptation and end-to-end integration of grounded task synthesis, accelerated simulation, and retrieval domain randomization, enabling a compact 4B model to match the accuracy of Gemini-3-Flash-Preview while slashing cumulative API token consumption by 74.9%. We will reposition the paper's claims around this practical training framework and empirical recipe.
W2 & Q2: Disentangling Gains Across Synthetic Tasks, SFT Quality, and RDR-GRPO on the Full Benchmark (210 Tasks)
We evaluated the entire progression across all 210 tasks on Video-BrowseComp under the same 85-step budget:
This matched-budget control provides a clean decomposition of our framework's gains:
Q1: Dissecting the Impact of Individual Retrieval Perturbations
To evaluate which retrieval perturbations drive policy robustness, we conducted single-factor and leave-one-out replays across 500 training tasks under identical local corpus settings:
Key Findings: