Recursive Agent Optimization

arXiv:2605.06639v2 Announce Type: replace-cross Abstract: We introduce Recursive Agent Optimization (RAO), a reinforcement learning approach for training recursive agents: agents that can spawn and delegate sub-tasks to new instantiations of themselves recursively. Recursive agents implement an inference-time scaling algorithm that naturally allows agents to scale to longer contexts and generalize to more difficult problems via divide-and-conquer. RAO provides a method to train models to best take advantage of such recursive inference, teaching agents when and how to delegate and communicate. We find that recursive agents trained in this way enjoy better training efficiency, can scale to tasks that go beyond the model's context window, generalize to tasks much harder than the ones the agent was trained on, and can enjoy reduced wall-clock time compared to single-agent systems.

Related

• LiteResearcher: A Scalable Agentic RL Training Framework for Deep Research Agent
• Recursive Entropic Risk Optimization in Discounted MDPs: Sample Complexity Bounds with a Generative Model
• Learning to Control LLM Agent Harnesses with Offline Reinforcement Learning
• Reasoning as Gradient: Scaling MLE Agents Beyond Tree Search

Source: arXiv cs.AI | 2026-10-05