Sign inGet started
Paper · arXiv

OpenSeeker-v2: Pushing the Limits of Search Agents with Informative and High-Difficulty Trajectories

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...

AuthorsYuwen Du, Rui Ye, Shuo Tang et al.
Primary categorycs.AI
Published5 May 2026
Last updated at source5 May 2026
cs.AIcs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/e32f1aed-772f-4fdf-86a5-555ebe2162d1" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Connected in the knowledge graph

Explore this entry in the graph

Models and datasets referencing this paper

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.