Beyond Parallel Sampling: Diverse Query Initialization for Agentic Search
On the map: LLM reasoning → Reasoning for agents, planning and code
also in 1 more
Abstract (arXiv)
Test-time scaling for agentic search typically increases depth (i.e., more turns and tokens per trajectory) or breadth (i.e., more parallel rollouts). Here we focus on breadth scaling, showing that standard parallel sampling yields diminishing returns, tracing this to query redundancy at the first turn. When models issue similar first queries across rollouts, the threads retrieve overlapping evidence, and subsequent turns are conditioned on this shared retrieval. We address this limitation with DivInit, a training-free intervention at the first turn. Rather than sampling k independent first queries, DivInit draws n candidates from a single call, picks k < n diverse seeds, and runs them as parallel trajectories. Across five open-weight models and eight benchmarks, DivInit consistently improves over standard parallel sampling, with average gains of five to seven points on multi-hop QA at matched compute. Code available at https://github.com/cxcscmu/diverse-query-initialization
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Reasoning for agents, planning and code, one of 17 directions in LLM reasoning. Builds on 18 of its 28 references that are in the map. First posted on arXiv 15 Jun 2026.
Builds on
18 of 28 references.
Closest ancestors · 2
Same direction, newest first
- 2026Agentic Aggregation for Parallel Scaling of Long-Horizon Agentic Tasks13 Apr
- 2026Benchmark Test-Time Scaling of General LLM Agents22 Feb
Other references · 16
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2023Let's Verify Step by Stepcited by 3,598
- 2019The Curious Case of Neural Text Degenerationcited by 2,881
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,928
- 2025Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learningcited by 1,371
- 2023GAIA: a benchmark for General AI Assistantscited by 1,084
- 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 946
- 2022Interleaving Retrieval with Chain-of-Thought Reasoning for Knowledge-Intensive Multi-Step Questionscited by 911
- 2022Solving math word problems with process- and outcome-based feedbackcited by 871
- 2016Diverse Beam Search: Decoding Diverse Solutions from Neural Sequence Modelscited by 299
4 more
- 2025ZeroSearch: Incentivize the Search Capability of LLMs without Searchingcited by 203
- 2024FlashRAG: A Modular Toolkit for Efficient Retrieval-Augmented Generation Researchcited by 165
- 2026SmartSearch: Process Reward-Guided Query Refinement for Search Agentscited by 12
- 2026RL with Learnable Textual Feedback: A Bilevel Approachcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2025Sample, Scrutinize and Scale: Effective Inference-Time Search by Scaling Verification
- 2026AgenticRAGTracer: A Hop-Aware Benchmark for Diagnosing Multi-Step Retrieval Reasoning in Agentic RAG
- 2025RAVine: Reality-Aligned Evaluation for Agentic Search
- 2026Share More, Search Less: Collaborative Parallel Thinking for Efficient Test-Time Scaling
- 2026HotelQuEST: Balancing Quality and Efficiency in Agentic Search
- 2026A-MapReduce: Executing Wide Search via Agentic MapReduce
- 2026FineVerify: Scaling Test-Time Compute with Fine-Grained Self-Verification for Agentic Search
- 2026A-RAG: Scaling Agentic Retrieval-Augmented Generation via Hierarchical Retrieval Interfaces