- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes AgentFugue, a multi-agent framework designed to improve long-horizon reasoning through intermediate information sharing among peer agents working on the same task. Unlike conventional multi-agent systems that rely on explicit role specialization or centralized task decomposition, AgentFugue allows multiple agents to explore independently while exchanging their intermediate findings through a shared reasoning hub.
The hub supports two main operations: (1) episode writing, which compresses completed interaction histories into concise notes while preserving the original trajectories for subsequent access; and (2) intent-driven reading, which retrieves and synthesizes relevant episodes from other agents according to the requesting agent's current information needs. The hub is initialized from Qwen3.5-9B and optimized using supervised fine-tuning followed by GRPO, while the task agents remain frozen.
The authors evaluate AgentFugue on BrowseComp, WideSearch, and Humanity's Last Exam (HLE), using both homogeneous and heterogeneous agent teams. The reported results show improvements over the selected single-agent and multi-agent baselines. Additional experiments investigate how performance changes with team size, answer aggregation strategies, and context budgets.
Critical strengths
(1) The paper addresses an important challenge in long-horizon multi-agent reasoning: how multiple agents working on the same task can benefit from one another's intermediate findings without relying on predefined roles or centralized task decomposition. The proposed shared reasoning hub provides a practical mechanism for asynchronous information exchange through episode summarization and intent-conditioned retrieval. Its separation from the underlying agent policies also makes the framework potentially applicable to different agent backbones.
(2) AgentFugue reports encouraging improvements over the selected multi-agent baselines across BrowseComp, WideSearch, and HLE, including substantial gains on BrowseComp. The experiments additionally examine homogeneous and heterogeneous agent teams, scaling with team size, and different answer aggregation strategies. The success and failure cases in Appendix E are particularly useful because they illustrate both the potential benefits of sharing intermediate exploration results and the risk of propagating misleading evidence across agents.
Critical weaknesses
(1) The central components of AgentFugue—trajectory summarization, shared memory, selective retrieval, and outcome-driven optimization—have been extensively explored in previous studies. In particular, AgentFold and Context Folding investigate long-horizon context compression; ParallelMuse studies parallel exploration and intermediate trajectory reuse; AggAgent investigates selective access to multiple reasoning trajectories; and MemSifter explores task-oriented memory retrieval through a separately optimized model.
While AgentFugue combines these components into an online peer-agent communication framework, the paper does not sufficiently establish which methodological contribution goes beyond their integration. The use of a shared hub for intermediate information exchange is practically meaningful, but the claimed distinction between collective reasoning and existing trajectory reuse or memory-augmented agent mechanisms remains underdeveloped. Moreover, the proposed target knowledge space is primarily conceptual and does not lead to measurable or theoretically grounded properties.
(2) The interaction budgets are not clearly comparable across systems. Appendix A states that Naive- and Swarm-Multi-Agent allocate up to 100 rounds to each subagent and 50 rounds to the meta-agent, whereas each AgentFugue peer can use up to 150 rounds. This difference introduces a potential confounding factor, particularly because the paper attributes the improvements primarily to the shared reasoning hub.
(3) Several essential ablations are missing. In particular, the paper does not provide sufficiently controlled comparisons with single-agent memory using the same hub, independent peer agents with identical context management but without cross-agent communication, or untrained/SFT-only hub variants. Consequently, the individual contributions of shared communication and hub optimization remain unclear.
(4) The claim that collective reasoning provides capability gains beyond simply increasing computation is not adequately supported. Although Figure 2 shows decreasing search and visit calls per agent as team size increases, this does not imply a reduction in total per-task computation. The additional agents and hub calls must also be considered. Comparisons under matched total token budgets, tool calls, or inference costs are necessary to substantiate this claim.
(5) The evaluation lacks sufficient uncertainty estimates and statistical analysis. BrowseComp and HLE are evaluated on 200-question samples, with only 100 questions used in the scaling study. The paper does not clearly report independent-run variance or confidence intervals. Moreover, Appendix H shows that changing the hub budget from 64K to 32K increases BrowseComp BoN@2 accuracy from 50.0% to 58.0%, suggesting substantial sensitivity to an important configuration parameter whose effects are not sufficiently disentangled.
Questions for authors
(1) Could the authors clarify how AgentFugue differs technically from ParallelMuse, AggAgent, and MemSifter, beyond integrating their related ideas into an online multi-agent setting? In particular, which component or mechanism is responsible for a capability that cannot be obtained through a straightforward combination of existing methods?
(2) Appendix A states that each subagent in Naive-/Swarm-Multi-Agent is limited to 100 rounds, whereas each AgentFugue peer receives 150 rounds. How are the total computational budgets made comparable, including meta-agent and hub inference costs? Do the reported improvements persist when the systems are matched in total model tokens, tool calls, and interaction budgets?
(3) Could the authors provide controlled ablations comparing (a) AgentFugue without cross-agent reading but with identical context compression, (b) a single agent using the same hub, (c) an untrained hub, and (d) an SFT-only hub? These comparisons would help distinguish the contributions of shared reasoning, memory management, and reinforcement learning.
(4) Does each sampled policy output correspond to an individual write/read operation or an entire multi-agent rollout? How are task-level rewards assigned to multiple hub interactions, and are the write and read models optimized separately or jointly? Please clarify the reward formulation, group size, rollout construction, and training budget.
(5) Appendix H reports a substantial performance difference between 32K and 64K configurations. Can the authors explain whether this effect arises from episode granularity, communication frequency, or context length? Additionally, can they provide confidence intervals or multiple-run statistics for the main comparisons and clarify the evaluation protocol underlying the reported accuracy values?
11 comments
[ Part 2/4 ] Rebuttal for Reviewer sR7y
W2 / W4 / Q2: Compute
You pointed out the round limits in Appendix A and asked whether the advantage holds under matched compute when the coordinator and hub are included. The round limits align the maximum interaction depth of a single task path. We measure team usage across all roles, including the coordinator and hub. We report the limits and how often systems reach them, then compare systems under a common budget.
-
Path depth and how often systems reach the limit. In Naive and Swarm, the coordinating agent assigns tasks and combines the results, and subagents carry out the work. A path through one subagent can use up to 150 rounds, with 50 for the coordinating agent and 100 for the subagent. AgentFugue has a 150-round limit per peer, since each peer searches and answers on its own. Giving both levels 150 rounds would allow up to 300 rounds along a path through the coordinator and a subagent.
Benchmark Naive Swarm AgentFugue WideSearch (200 questions) 2/200 (1.0%) 3/200 (1.5%) 1/200 (0.5%) HLE (200 questions) 3/200 (1.5%) 4/200 (2.0%) 2/200 (1.0%) The rate is at most 2% on both benchmarks. We therefore expect the round limits to have little effect on the results for these two benchmarks.
-
Actual team resource use. In the BrowseComp scaling experiment in Figure 2(b), increasing the team size from one to two reduces mean search and visit calls per agent from 40.49 to 37.14. The two-agent team makes a total of about 74.28 search and visit calls per question, plus 1.09 memory calls. The per-agent retrieval count in Figure 2(b) measures the work of an individual agent. For total team usage, we sum input and output tokens from the task agents, coordinator, hub reads and writes, and final aggregation for each question. We count tool calls and actual interaction rounds separately.
-
Sharing during exploration improves accuracy under a common budget. We compare independent parallel exploration with AgentFugue on the same BrowseComp questions. Both use two Qwen3.5-35B-A3B task agents, the same local context compression, and the same final aggregator. The independent peers can access only their own notes and raw episodes. Both groups explore in parallel and select an answer at the end, so the comparison tests access to peer findings during exploration. Naive and Swarm use the same team budget. The per-question limits are 1.25M total team tokens and 80 search and visit calls.
Method Accuracy Mean team tokens per question Mean search and visit calls per question Naive 44.0% 1.12M 65 Swarm 45.0% 1.18M 77 Independent peers with local compression and the same aggregator 45.5% 1.23M 76 AgentFugue 48.0% 1.22M 74 AgentFugue and the independent peers have similar mean token usage. AgentFugue makes 2 fewer search or visit calls per question and scores 2.5 percentage points higher. The task model, team size, local compression, and aggregator are the same. Agents can use their peers' checks and ruled-out leads and spend their remaining searches on unresolved parts of the problem.
[ Part 3/4 ] Rebuttal for Reviewer sR7y
W3 / Q3: Ablations
Thank you for suggesting controlled ablations to distinguish the contributions of the system's components. Your four proposed controls address two questions about how much cross-agent communication contributes and how much hub training contributes. We examine communication ablations, training stages, and a comparison that holds local memory management fixed.
1. Communication mechanism. The content and manner of sharing both affect performance.
On BrowseComp, we hold the task agents, tools, context budget, and answer aggregation rule fixed.
| Configuration | Change | Accuracy |
|---|---|---|
| No write | Disable writes of exploration episodes to the shared hub. | 38.5% |
| No read | Retain episode writes and shared notes, and disable intent-conditioned reads of raw episodes. | 41.0% |
| Raw broadcast | Expose peers' raw trajectories directly, with no selective reading or intent-conditioned synthesis. | 39.0% |
| Prompt-only hub | Use the untuned Qwen3.5-9B with prompts for writing and reading. | 45.5% |
| SFT hub | Use Qwen3.5-9B after supervised fine-tuning. | 48.0% |
| SFT+GRPO hub | Full AgentFugue. | 50.0% |
- Shared notes and intent-conditioned reads serve different purposes. No read still lets peers see compact notes and follow the team's progress. Its accuracy is 41.0%, 9.0 percentage points below the full method. Access to raw evidence for the agent's current question improves performance beyond this overview.
- Selective access is more effective than direct broadcast in this setting. Raw broadcast reaches 39.0%, 11.0 percentage points below the full method. Organizing shared information into notes and reading relevant details on demand yields higher accuracy than exposing raw trajectories directly.
No write disables writes of shared episodes and reaches 38.5%. The isolation experiment below retains local compression and each peer's own memory, and blocks only cross-agent access. It tests the contribution of cross-agent communication while preserving local memory management.
2. Hub optimization. SFT and GRPO each improve accuracy under a fixed communication interface.
The prompt-only, SFT, and SFT+GRPO variants share the same 9B backbone and communication interface. Their accuracies are 45.5%, 48.0%, and 50.0%, respectively.
- Prompt-only to SFT: +2.5 percentage points. Supervising episode writing and intent-conditioned reading improves task performance under the same interface.
- SFT to SFT+GRPO: +2.0 percentage points. Downstream task feedback provides an additional benefit after supervised training.
- Prompt-only to full training: +4.5 percentage points. This comparison measures the gain from hub training under a fixed communication interface.
A 27B hub trained with LoRA reaches 48.5%, below the full 9B hub at 50.0%. This gives an additional comparison between two hub configurations with different backbones and training methods. Our estimate of the training gain comes from the three variants of the same 9B backbone above.
3. Local memory. Cross-agent communication improves accuracy when local memory management is held fixed.
To address your request for single-agent memory and independent-peer controls, we compare three configurations on the same BrowseComp questions. All three use the same trained hub, local write threshold, compression method, and read interface. The two-agent configurations also use the same team budget limits and final aggregator.
| Configuration | Local memory management | Cross-agent access | Accuracy |
|---|---|---|---|
| Single agent with the same hub | Retained | No peers | 40.0% |
| Two independent peers with the same hub | Retained separately for each peer | Blocked for both notes and raw episodes | 45.0% |
| Two peers with full AgentFugue | Retained | Shared notes and intent-conditioned reads enabled | 50.0% |
- Adding an independent peer raises accuracy from 40.0% to 45.0%. This measures the gain from an additional independent search path and answer aggregation.
- Enabling cross-agent communication in the two-agent setup raises accuracy from 45.0% to 50.0%. Local compression, the hub checkpoint, and final aggregation are the same. The 5.0-percentage-point gain measures the benefit of giving agents access to peer findings during exploration within this setup.
[ Part 1/4 ] Rebuttal for Reviewer sR7y
Thank you for reading our work carefully. We first explain the motivation for the study and its design, then respond to your comments.
First, this paper studies whether scaling out by adding parallel agents can improve reasoning. As with test-time scaling, this approach uses more inference compute in pursuit of better results. Parallel agents naturally use more resources than a single agent. The direct comparison is with the same number of agents exploring independently and aggregating answers at the end. If sharing during exploration cuts redundant searches and helps agents find better paths, it may improve accuracy under the same team budget or achieve the same accuracy at lower cost. Our efficiency experiments examine this trade-off.
Second, AgentFugue's design was inspired by the practice of internal “team races” in companies. Several teams work on the same difficult problem in parallel, with each team choosing its own direction. If teams compare outcomes only at the end, early discoveries and ruled-out directions arrive too late to help others. AgentFugue preserves each agent's ability to choose its next action while allowing it to use its peers' evidence, ruled-out directions, and unverified leads. We ask whether this exchange changes what agents search for next and improves their chances of solving the task. We therefore measure final team accuracy and individual accuracy before aggregation.
With these two points in mind, we address your comments in the five sections below.
W1 / Q1: Online Sharing
Thank you for comparing AgentFugue with these related works. You asked how AgentFugue differs from prior work on context compression, trajectory reuse, and memory retrieval. We focus on how discoveries from one peer's search can guide another peer that is still exploring the same task.
1. The methods differ in when exploration results enter another reasoning process.
Each AgentFugue peer works on the full task and chooses its own next action. A peer can use another peer's discoveries before its own search ends. This communication can change which candidate answers are produced even when the final aggregator stays the same. We therefore examine both final team accuracy and individual accuracy before aggregation.
2. An unfinished search can still help another agent.
Even before finding a correct answer, a peer can rule out candidates, verify constraints, or leave a lead worth following. Appendix E.1 shows this in a task about the founding year of a Shanghai shop. Two peers ultimately answer 1885 and 1848, but their intermediate findings help Agent-0 solve the task.
The trace shows how a peer's intermediate work guides a new search even when that peer eventually answers incorrectly.
3. The mechanism leads to observable changes in the search.
To let a peer act on another peer's work during exploration, the system must make episodes available promptly, help peers locate relevant episodes, and return evidence suited to their current search. In AgentFugue, peers write episode notes asynchronously. A receiving peer uses the notes to find relevant episodes and asks the hub to synthesize the raw content for its current search intent. The result can guide the peer's next action.
The target knowledge space describes the evidence and reasoning needed to solve a task. Different trajectories may uncover different parts of that space. We assess sharing through final team accuracy, individual accuracy before aggregation, and how agents use shared information in their search traces.