LAGO: Language Agents with Reusable Growing Options

Yuran Wu, Mengkang Hu, Qionglin Qiu, Fanqing Meng, Qiguang Chen +3 more
10/14/2026
cs.AIcs.MA

No confident code implementation found for this paper.

Abstract

Long-horizon tasks expose a weakness of monolithic tool-use loops: one agent must decompose, execute, and verify a task within a single trajectory. We introduce LAGO, which treats specialized language agents as reusable temporally extended options. A meta-agent retrieves options from a persistent library or spawns new ones, dispatches sub-tasks, verifies results, and admits successful novel options. The library grows across tasks without updating model weights. On 500 SWE-bench Verified tasks, frozen Qwen3.5-35B-A3B in both roles resolves 58.6% under single-attempt evaluation with the official Docker evaluator. On a fixed 150-task subset, we re-run mini-SWE-agent, Terminus 2, and LAGO with the same policy, temperature, task IDs, and evaluator; their resolve rates are 49.3%, 57.3%, and 60.3%, respectively. Cross-model experiments provide evidence consistent with a role for decomposition quality. A 50-task component ablation finds four fewer resolved tasks without decomposition, two fewer with shuffled reused content, and six fewer without the library. These results support reusable agent-options as a practical abstraction for task streams, while leaving component-level causality task- and model-dependent.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wu2026lago,
  title  = {LAGO: Language Agents with Reusable Growing Options},
  author = {Yuran Wu and Mengkang Hu and Qionglin Qiu and Fanqing Meng and Qiguang Chen and Yuhang Zhou and Qiudan Zhang and Xu Wang},
  year   = {2026},
  eprint = {2610.19843},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.19843v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2610.19843.svg)](https://codeofpaper.com/paper/2610.19843)

Discussion