IterSynth: Rethinking Deep Search Agents via Role-Decoupled Iterative Synthesis
Abstract
Deep search requires LLM agents to decompose complex queries, search for evidence, and synthesize grounded answers, yet existing ReAct-style agents suffer from two limitations: role coupling, where one policy must handle planning, evidence use, and synthesis; and context accumulation, where growing search histories introduce noise and obscure useful information. To address these issues, we propose IterSynth, a role-decoupled and summary-based paradigm that alternates between a Planner for identifying information needs and a Synthesizer for integrating evidence into an evolving summary state. This design separates planning from synthesis while using the summary as the persistent state of search, reducing both capability coupling and context noise. To train IterSynth effectively, we further introduce Role-Decoupled Policy Optimization (RDPO) for reinforcement learning, which combines terminal outcome rewards with turn-level rubric evaluations and computes role-specific advantages for more precise credit assignment. Experiments on five long-horizon deep-search benchmarks such as BrowseComp and Xbench-DS show that IterSynth-8B achieves an average score of 50.7, surpassing the strongest prior leq8B agent by +4.2\%. Moreover, IterSynth serves as a model-agnostic prompting paradigm, delivering substantial zero-shot gains over ReAct and similar prompting paradigms on frontier proprietary models.
Community
IterSynth: Rethinking Deep Search Agents via Role-Decoupled Iterative Synthesis
Deep-search agents that follow the ReAct recipe inherit two coupled bottlenecks: one policy has to plan, use evidence, and synthesize at the same time, while its context keeps growing until it suffocates — over 59% of ReAct trajectories on BrowseComp never even terminate within a 64K budget.

Figure 1: multi-agent specialization, summarization-based context refreshment, and IterSynth — capability decoupling on a single shared policy.
We propose IterSynth, a role-decoupled, summary-based paradigm that alternates two roles instantiated by a single shared parameter set:
- Planner — identifies unresolved information needs and formulates the next sub-query from a compact, persistent state;
- Synthesizer — integrates newly retrieved evidence into that summary, making summary updates a learned part of the search policy instead of an external compression module.
Figure 2: the Planner–Synthesizer loop; each iteration reasons over a bounded, reconstructed workspace.
To train it we introduce Role-Decoupled Policy Optimization (RDPO): a terminal outcome reward augmented with turn-level rubric rewards, with group-relative advantages computed independently per role — more precise credit assignment with no algorithmic change beyond GRPO.
Figure 3: RDPO blends the terminal outcome reward with per-turn rubric scores and normalizes advantages role by role.
Results:
- IterSynth-8B reaches 50.7 avg on GAIA-text-only, xBench-2505/2510, BrowseComp and BrowseComp-ZH — +4.2 over the strongest prior ≤8B agent, and competitive with several 30B-scale agents at less than one third of the parameters.
- Training recipe ablation: SFT 44.1 → outcome-only GRPO 48.9 → RDPO 50.7. Replacing the Planner with an untrained model costs ~41 points, showing that role decoupling is what turns the architecture into reliable long-horizon capability.
- It also works as a model-agnostic prompting paradigm: zero-shot gains over ReAct of +5.5 (Claude-4.5-Opus) and +4.5 (DeepSeek-V3.1) on average, up to +10.0 on BrowseComp-ZH.
- The bounded, reconstructed context translates into fewer search rounds (7–8 vs 12+), a <5% context-exhaustion rate, and 13–15% lower inference time than an equivalent dual-model deployment.
Code: https://github.com/Tencent/IterSynth
Feedback very welcome!
Get this paper in your agent:
hf papers read 2609.29444 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper

