SearchHorizonBench is a new benchmark that evaluates how AI agents decide whether the cost of an additional search is justified by its expected benefit. It provides 45,632 executions on 3,168 questions, using paired continuations and repeated runs to separate true search gain from generation noise. The dataset shows that historical calibration can reduce Brier error by 16.2% and that free‑selection observations offer a 2.49‑point utility advantage over a constant action, highlighting the importance of accurate search‑value estimation.
arXiv:2610.05107v2 Announce Type: replace-cross Abstract: Search agents repeatedly make short decisions about relevance, evidence sufficiency, and search actions. Using generative language models for...
arXiv:2606.00660v2 Announce Type: replace Abstract: Agentic search requires language model agents to explore many sources and answer complex information-seeking questions. Scaling test-time compute i...
The paper introduces ZEST-Search, a zero-label framework that trains search agents by co-evolving task generation and solver learning. It constructs validated search tasks online from unlabeled questions, using a heterogeneous proposer to adapt task difficulty to the solver’s evolving capabilities. The approach rewards the proposer for intermediate difficulty and the solver for tool-aware performance, leading to improved search efficiency and accuracy across multiple question‑answering benchmarks.
The paper introduces Strategy Accumulation and Guided Execution (SAGE), a two-stage framework that makes automated fine-tuning of large language models cumulative. In the first stage, a multi-agent pipeline uses Monte Carlo Tree Search to explore training strategies while a Distillation Agent records task-specific insights and cross-task confidence scores into a structured repository. In the second stage, SAGE retrieves relevant experience from this repository to guide training on new tasks, achieving a 12.4‑percentage‑point improvement over a baseline pipeline without accumulated experience on nine unseen tasks.
arXiv:2604.18235v3 Announce Type: replace-cross Abstract: Search agents achieve strong question-answering performance through multi-turn interactions with search engines, with Group Relative Policy O...
arXiv:2608.01822v2 Announce Type: replace Abstract: Training LLM-based search agents requires high-quality search data: tasks that demand genuine multi-hop retrieval and trajectories that use search...
arXiv:2606. 07074v1 Announce Type: cross Abstract: Deep research agents have demonstrated remarkable capabilities in complex information-seeking tasks, yet this power comes at a steep computational cost.
Large language models (LLMs) are increasingly extended into deep search agents that solve complex questions through multi-step interaction with external search and browsing tools. However, existing agents often incur substantial computational and interaction costs, generating lengthy trajectories that contain redundant queries, inefficient exploration, and irrelevant observations.
arXiv:2608. 13940v1 Announce Type: new Abstract: AI research agents (AIRA) can now propose, implement, and evaluate their own machine learning experiments, but progress on frontier tasks is throttled by cost: a candidate solution can be written in minutes, whereas evaluating it can take hours to days of GPU time.
AdaSearch introduces a two‑stage reinforcement learning framework that separates problem solving from the decision to search in large language models. By using an F1‑based decision metric, it explicitly evaluates when external search is needed, reducing unnecessary search calls while maintaining high question‑answering performance. Experiments show that AdaSearch improves search‑decision quality with only a minor impact on accuracy compared to always‑search strategies.
arXiv:2608. 07531v1 Announce Type: cross Abstract: Search-augmented language agents should retrieve external information only when necessary and ground their answers in retrieved evidence.
The paper introduces Conformalized Agentic Search (CAS), a framework that applies Conformal Prediction to improve the reliability of search agents during reinforcement learning fine-tuning. CAS uses an Adaptive Prediction Set (APS) to dynamically truncate retrieved documents based on statistical coverage, and Adaptive Conformal Inference (ACI) to construct confidence-aware prediction sets that penalize low‑confidence trajectories in the Group Relative Policy Optimization objective. Experiments on single‑hop and multi‑hop QA datasets show that CAS enhances reasoning accuracy and reduces redundant tool invocations, offering a more reliable and efficient agent paradigm.