Skip to main content
Search

# Agentic Search

11 related articles

Subscribe to updates
  1. arXiv

    Video anomaly understanding stops relying on pre-sampled frames: SEEK-VAU lets an agent search and verify, lifting evidence F1 from 28.1 to 43.7

    Video anomaly understanding has long used fixed observation: a model receives a bundle of sampled frames or clustered events and then judges the anomaly, with no way to go back for missing evidence once reasoning starts. SEEK-VAU recasts this as budget-bounded agentic search and verification, letting the policy gather evidence across the precursor, trigger and aftermath stages of an event chain and check sufficiency before closing the case. On its SEEK-Bench, built on a Qwen3-VL-8B backbone, it reaches 55.6 Temporal mIoU, 45.5 QA Accuracy and 43.7 Evidence F1, against 44.2, 37.7 and 28.1 for the fixed-observation Qwen3-VL baseline.

  2. arXiv

    Search interfaces stop being hand-fixed: SearchWeaver rewrites tools and instructions per corpus, lifting answer accuracy from 71.6% to 78.4%

    How well a language-model agent searches depends on the interface it is given, yet existing interfaces are set by hand and applied unchanged to every corpus. SearchWeaver jointly revises corpus artifacts, executable tools and usage instructions using the agent's execution trajectories and task rewards, then selects by downstream search performance. With GPT-5.4-nano, the optimized interfaces raise BrowseComp-Plus answer accuracy from 71.6% to 78.4% and average nDCG@10 across four BRIGHT subsets from 45.7 to 55.0, while cutting tool execution time.

  3. arXiv

    Patent review gets a trainable agent testbed: a 4B model holds its own against far larger general agents at prior-art search

    Patent examination asks an agent to find sparse prior art, refine queries, inspect evidence and write a novelty judgment, yet existing benchmarks mostly stop at static candidate sets. PatEx-Gym turns that process into a runnable environment: PatEx-Bench supplies 1K examination tasks, retrieval corpora of over 1M patents and 52K scientific papers, and a runtime supporting iterative search and Office Action generation. PASS synthesizes search trajectories by treating document visits as implicit relevance signals, and the 4B PatEx-Agent fine-tuned on them performs competitively against substantially larger general-purpose agents.

  4. Reward the search, not just the answer: process supervision lifts retrieval recall and holds up out of domain

    Search agents for multi-hop information seeking are trained on step-level judgments of each search action instead of only on final-answer correctness. RAG-Gym casts search as a Markov decision process and compares architecture, parameter optimization and action evaluation, combining a reasoning-reflection architecture, preference optimization and critic-guided inference into Re2Search++. Trained on HotpotQA, it beats outcome-supervised baselines on the unseen Bamboogle benchmark with higher retrieval recall at comparable or fewer search steps, and a critic trained on Llama-3.1-8B raises GPT-4o-mini MedQA accuracy.

  5. arXiv

    Project Greenhouse pre-trained a 3B model from scratch on 8 H100s and fine-tuned it into a pointwise reranker that beats comparable open-weight baselines on TREC DL and BEIR, trailing only GPT-6.1 Sol

    Project Greenhouse models LLM training as a directed property hypergraph and uses it to define what makes a model fully open and sovereign; as a first milestone, the authors pre-train a 3.29B-parameter causal language model from scratch on ClimbMix using only publicly available datasets, then fine-tune it on RLHN-250K with localized contrastive estimation to obtain the pointwise reranker Gaggle (base reranker). Its mean nDCG@10 exceeds all compared fine-tuned pointwise and listwise rerankers on TREC DL 2019–2023 and seven BEIR collections, with only GPT-6.1 Sol scoring higher on TREC DL.

  6. arXiv

    How Retrieval Credit Is Assigned Decides Search-Agent Training Gains: Local Credit Lifts Qwen3-4B Average F1 from 51.25 to 54.34

    The study builds corpus-grounded QA data with intermediate evidence annotations and compares three retrieval signals (evidence coverage Cov, coverage with dependencies Cov-Dep, answer match AM) under scalar reward bonuses versus action-aligned local credit, training Qwen3-4B on seven QA benchmarks and finding local credit outperforms scalar, with Cov-local reaching 54.34 average F1 versus 51.25 for outcome-only training.

  7. arXiv

    Sub-2B agents using semantic search for code localization beat grep on SWE-bench Lite and Multi-SWE-bench Flash while cutting CPU latency by 44.1%

    The authors introduce a two-stage training framework around colgrep, a local semantic search tool, combining supervised fine-tuning with turn-level credit based on retrieval outcomes and reinforcement learning on localization quality, and train three 1–1.7B-parameter models for file localization; on SWE-bench Lite and Multi-SWE-bench Flash, colgrep-equipped agents outperform matched grep agents at every training stage, with Qwen3-1.7B reaching 67.29 and 54.00 file F1 after weighted SFT plus RL, while using 29.1% fewer tokens and reducing end-to-end CPU latency by 44.1% and transferring better to seven languages unseen during fine-tuning.

  8. arXiv

    LexiHorizon trains a 9B search agent with a 128K context budget and a reasoning-preserving observation window, beating its base model and MiroThinker-1.7-mini on XBench, WebWalkerQA, and BrowseComp-ZH

    The work proposes LexiHorizon, a long-horizon deep-search training framework that expands the trajectory context budget to 128K, manages accumulated retrieval content with a context window that keeps only recent tool observations in full while preserving the reasoning history, and adds an outcome-gated search-effort reward that applies only to trajectories with nonzero answer reward, training Qwen3.5-9B online with GSPO; the resulting LexiHorizon-9B outperforms both its base model and MiroThinker-1.7-mini on XBench, WebWalkerQA, and BrowseComp-ZH, with maximum absolute gains of 8.7 and 23.8 percentage points, and ablations show that a 64K budget lowers the valid answer rate from 99.88% to 66.97% while removing the window reduces accuracy on all three benchmarks.

  9. arXiv

    Long-MDR pushes online RL for multimodal deep-research agents to 128k context and 75 tool turns, with a 9B model leading five of six benchmarks among 7B–9B agents at a 50-turn evaluation budget

    This work scales online reinforcement learning for multimodal deep-research agents to 128k context and 75+ tool-interaction turns and introduces Long-MDR, a three-component recipe of On-Policy Distillation Warmup, Progressive Horizon Expansion, and Entropy-Triggered Rescue, to address slow early reward growth and later entropy collapse in long-horizon training; at a 50-turn tool-interaction evaluation budget, the trained Long-MDR-9B ranks first on five of six benchmarks among the compared 7B–9B agents.

  10. arXiv

    184 authors labeled what inspired 207 papers, and the best retriever recovers only 48% of those catalyst papers from a 191K corpus

    The authors built ScholarCatalyst, a benchmark in which 184 researchers annotated 894 early-stage research questions and the prior "catalyst" papers that did or could have advanced 207 recent computer science projects, then evaluated retrieval over a 191K-paper corpus restricted to work published before each project; the strongest system reached only 0.48 Recall@20, agentic search (0.42) did not beat embedding retrieval, and even Claude Fable 5.1, whose training data may include the source papers, reached only 0.51.