Long-Horizon RL Needs Muon

Kai Ruan, Jinghao Lin, Tao Chen, Ziqi Zhou, Qianshan Wei, Zihe Huang

Renmin University of China · Duke University · Institute of Automation, Chinese Academy of Sciences · Institute of Computing Technology, Chinese Academy of Sciences

Published October 14, 2026 · on the feed October 15, 2026 · ▲ 16 · arXiv 2610.20256

Code & software No code arXiv ↗Hugging Face ↗

The abstract

Long-horizon agents must coordinate reasoning, tool use, and environment feedback over extended interactions. Learning from sparse outcome rewards requires weighting trajectories of different lengths and updating the policy while rollouts are still being collected. We examine a single-rollout asynchronous recipe combining Muon, token-averaged loss, truncated importance sampling, and auxiliary length and tool-error penalties. Single-rollout sampling allows asynchronous learning without waiting for multiple trajectories for the same issue. We study optimizer choices and recipe components for repository-level issue resolution across two model families. The evaluated training runs show higher training success with the full recipe than with the baselines.

The Brief

1:38

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Long-Horizon RL Needs Muon. By Kai Ruan and five others, from Renmin University of China, Duke University, and two other institutions. Published on the fourteenth of October. No code repository is linked to it.

Long-horizon agents have to coordinate reasoning, tool use, and feedback from their environment over extended interactions. Training them from sparse outcome rewards brings two practical demands. Trajectories of different lengths have to be weighted against each other, and the policy has to be updated while rollouts are still being collected. The claim, carried in the title, is that the Muon optimizer belongs in the recipe for this kind of training, as part of a combination that trains more successfully than the baselines.

The recipe is asynchronous and uses a single rollout. It combines four parts: Muon, a token-averaged loss, truncated importance sampling, and auxiliary penalties on length and on tool errors. The single rollout is what enables asynchrony: learning can proceed without waiting for several trajectories on the same issue to come back. The authors study both the choice of optimizer and the individual components of the recipe, on repository-level issue resolution, across two model families. In the evaluated training runs, the full recipe reaches higher training success than the baselines.

The evidence as stated is about training success, in the runs that were evaluated, on one kind of task, repository-level issue resolution, with two model families. The comparison is the full recipe against baselines, so it speaks to the combination as a whole.

The outline is brief. Long horizons and sparse rewards push toward asynchronous, single-rollout training, and there the authors put Muon at the head of the recipe.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.