- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper introduces LAGO (Language Agents with Reusable Growing Options), a framework that treats specialized language agents as reusable, temporally extended actions ("options"). For each task, a meta-agent: breaks the task into sub-tasks; for each sub-task, either retrieves a suitable agent from a persistent library or spawns a new one; verifies each sub-agent's result; adds newly spawned agents to the library if they succeed and are novel. The library is maintained through deduplication, pruning and versioning, and model weights are never updated. With frozen Qwen3.5-35B-A3B as both meta-agent and executor, LAGO resolves 58.6% of SWE-bench Verified. On a 150-task subset it scores 60.3%, compared with 57.3% for Terminus 2 and 49.3% for mini-SWE-agent. The paper also reports results on SWE-bench Pro and BrowseComp, and an optional fine-tuning (SFT) step for the meta-agent.
Critical strengths
- Treating specialized agents as reusable actions, in a library that grows over a stream of tasks, is a sensible way to avoid solving recurring sub-problems from scratch.
- Disabling decomposition or the library lowers performance, which offers some evidence that both components help.
Critical weaknesses
- The agent library is presented as the main contribution, yet its core operations are not defined. The admission rule on Line 184 depends on a "novelty" score. The novelty metric is never defined, and the threshold values are never given. For deduplication and pruning, the paper does not say how "similar specifications and behavior" is measured, how two agents are merged, what counts as "rarely used," what the regression checks are, or how often these steps run. For routing, it says only that retrieval uses "a similarity function over option specifications," without giving the similarity measure, the number of candidates, or the threshold for a "suitable" option. The reuse-or-spawn decision appears to be left to the LLM's judgement. Finally, all experiments start from a 123-option seed library, but the paper never explains how it was created. It says only that it came from tasks disjoint from the evaluation set.
- The paper is hard to follow, and the figures and captions need significant polishing. There are formatting errors (e.g., Line 239). Internal identifiers appear without explanation, such as "max_branch_turns" in Figure 2 and "agent_library_seed350" in Lines 393–395. Important details are also spread across the main text and the appendices.
Questions for authors
- How exactly are novelty, the similarity used for retrieval and deduplication, and the admission and pruning thresholds computed? What values were used?
- How was the seed library built? How does performance change when starting from an empty library?
- What is the inference cost (tokens and LLM calls) of LAGO compared with the baselines?