mlsanityData to 7 Oct 2026

DAGent: Evaluate-then-Grow Planning for Deep Research Agents

arXiv 2609.39154 ↗First posted 30 Sep 2026cs.CL cs.AIcited by 0

On the map: LLM agents and tool use → Web, search, and research agents

Abstract (arXiv)

Deep research tasks require agents to navigate large knowledge spaces, synthesize evidence across many sources, and adapt their plans as findings emerge. Directed acyclic graph (DAG)-based multi-agent systems suit this setting because they support parallel execution and isolate each sub-task within a focused dependency context. Yet existing DAG-based agents instantiate a task-level plan before execution and repair the graph only after failures or missing evidence are observed. This Plan-then-Patch strategy is brittle for deep research: the system commits most strongly when its evidence is weakest, and later revisions waste computation on branches that should not have been planned. We propose DAGent, a DAG-based multi-agent framework with Evaluate-then-Grow incremental planning: an Orchestrator grows the task graph one batch at a time, conditioning each expansion on confidence and uncertainty signals from completed nodes. A hierarchical context layer propagates compact QueryDocs by default while preserving full execution traces for on-demand recall. The recorded DAG topology admits structural RL signals that outcome-only recipes cannot define; DAGRPO, a GRPO adaptation, injects topology-conditioned credit on Executor rollouts and a structural compliance regularization on Orchestrator plans. Across BrowseComp-Plus, GAIA, and xbench-DeepSearch, DAGent surpasses the strongest open-source baseline by 5.3 / 5.8 / 2.0 points at the Qwen3-235B-A22B scale, and the lead replicates across four open-source backbones and extends to GPT-5 at 327K context. At the Qwen3-8B scale, DAGRPO improves over a same-budget outcome-only GRPO baseline by 3.0 average Pass@1 points. A same-architecture comparison shows that evidence-conditioned planning reaches higher accuracy at lower per-task token, tool-call, and step footprints than its Plan-then-Patch counterpart. Code: https://github.com/hanwenliu6825/DAGent

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Web, search, and research agents, one of 16 directions in LLM agents and tool use. Builds on 31 of its 47 references that are in the map. First posted on arXiv 30 Sep 2026.

Builds on

31 of 47 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025Flash-Searcher: Fast and Effective Web Agents via DAG-Based Parallel Execution29 Sep
  2. 2025BrowseMaster: Towards Scalable Web Browsing via Tool-Augmented Programmatic Agent Pair12 Aug
  3. 2025WideSearch: Benchmarking Agentic Broad Info-Seeking11 Aug
  4. 2025DeepResearch Bench: A Comprehensive Benchmark for Deep Research Agents13 Jun

Other references · 27

  1. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  2. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  3. 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
  4. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
  5. 2023GAIA: a benchmark for General AI Assistantscited by 1,084
  6. 2023ChatEval: Towards Better LLM-based Evaluators through Multi-Agent Debatecited by 724
  7. 2025BrowseComp: A Simple Yet Challenging Benchmark for Browsing Agentscited by 616
  8. 2025Group-in-Group Policy Optimization for LLM Agent Trainingcited by 442
  9. 2023An LLM Compiler for Parallel Function Callingcited by 170
  10. 2025Scaling Long-Horizon LLM Agent via Context-Foldingcited by 136
  11. 2025ReSum: Unlocking Long-Horizon Search Intelligence via Context Summarizationcited by 132
  12. 2025ACON: Optimizing Context Compression for Long-horizon LLM Agentscited by 126
15 more
  1. 2025Alita: Generalist Agent Enabling Scalable Agentic Reasoning with Minimal Predefinition and Maximal Self-Evolutioncited by 114
  2. 2025Nemotron 3 Nano: Open, Efficient Mixture-of-Experts Hybrid Mamba-Transformer Model for Agentic Reasoningcited by 85
  3. 2025Tree Search for LLM Agent Reinforcement Learningcited by 73
  4. 2024MindSearch: Mimicking Human Minds Elicits Deep AI Searchercited by 65
  5. 2025WebWeaver: Structuring Web-Scale Evidence with Dynamic Outlines for Open-Ended Deep Researchcited by 44
  6. 2025OAgents: An Empirical Study of Building Effective Agentscited by 28
  7. 2025You Don't Need Pre-built Graphs for RAG: Retrieval Augmented Generation with Adaptive Reasoning Structurescited by 23
  8. 2024Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generationcited by 11
  9. 2025GAP: Graph-Based Agent Planning with Parallel Tool Use and Reinforcement Learningcited by 11
  10. 2025FlowSearch: Advancing deep research with dynamic structured knowledge flowcited by 10
  11. 2026Counterfactual Credit Policy Optimization for Multi-Agent Collaborationcited by 10
  12. 2026Beyond Entangled Planning: Task-Decoupled Planning for Long-Horizon Agentscited by 9
  13. 2025FoldAct: Efficient and Stable Context Folding for Long-Horizon Search Agentscited by 6
  14. 2025DeepPlanner: Scaling Planning Capability for Deep Research Agents via Advantage Shapingcited by 5
  15. 2025OrchDAG: Complex Tool Orchestration in Multi-Turn Interactions with Plan DAGscited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026DuMate-DeepResearch: An Auditable Multi-Agent System with Recursive Search and Rubric-Grounded Reasoning
  2. 2025ADRA-Bank: A Modular Benchmark for Academic Deep Research Agents
  3. 2026A Tale of Two Graphs: Separating Knowledge Exploration from Outline Structure for Open-Ended Deep Research
  4. 2026Argus: Evidence Assembly for Scalable Deep Research Agents
  5. 2025IterResearch: Rethinking Long-Horizon Agents with Interaction Scaling
  6. 2026From Intent to Evidence: A Categorical Approach for Structural Evaluation of Deep Research Agents
  7. 2025Deep Research Agents: A Systematic Examination And Roadmap
  8. 2025WebResearcher: Unleashing unbounded reasoning capability in Long-Horizon Agents