TL;DR
OpenSeeker-v2 demonstrates that a simple supervised fine-tuning approach, fueled by informative high-difficulty trajectories and data synthesis, can achieve state-of-the-art search agent performance with minimal data and no heavy reinforcement learning.
Contribution
The paper introduces a novel data synthesis method and shows that a straightforward SFT approach can outperform complex pipelines in training frontier search agents.
Findings
OpenSeeker-v2 achieves state-of-the-art results on four benchmarks.
Training on only 10.6k data points suffices for top performance.
Purely academic development with no reinforcement learning is feasible.
Abstract
Deep search capabilities have become an indispensable competency for frontier Large Language Model (LLM) agents, yet their development remains dominated by industrial giants. The typical industry recipe involves a highly resource-intensive pipeline spanning pre-training, continual pre-training (CPT), supervised fine-tuning (SFT), and reinforcement learning (RL). In this report, we show that when fueled with informative and high-difficulty trajectories, a simple SFT approach could be surprisingly powerful for training frontier search agents. By introducing three simple data synthesis modifications: scaling knowledge graph size for richer exploration, expanding the tool set size for broader functionality, and strict low-step filtering, we establish a stronger baseline. Trained on merely 10.6k data points, our OpenSeeker-v2 achieves state-of-the-art performance across 4 benchmarks…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
