Sign inGet started
Paper · arXiv

Recursive Agent Optimization

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, generaliz...

AuthorsApurva Gandhi, Satyaki Chakraborty, Xiangjun Wang et al.
Primary categorycs.LG
Published7 May 2026
Last updated at source2 October 2026
cs.LGcs.AIcs.CLcs.MA
Embed this entry
<iframe src="https://silytics.si/embed/item/236f58b3-7121-4e58-bac8-1658e28047fc" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Connected in the knowledge graph

Explore this entry in the graph

Models and datasets referencing this paper

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.