Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research paper addresses the optimization challenges of long-horizon reinforcement learning agents by integrating Muon, an optimizer designed to handle sparse rewards and asynchronous rollouts more effectively than standard baselines. The study demonstrates improved training success rates for complex tasks like repository-level issue resolution across different model families, highlighting a significant advancement in algorithmic efficiency for extended interaction scenarios.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Long-Horizon RL Needs Muon

arXiv2 min read

arXiv:2610.20256v1 Announce Type: new 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.

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.

7 pages, 5 figures. Work in progress

Machine Learning (cs.LG); Artificial Intelligence (cs.AI)

arXiv:2610.20256 [cs.LG]

(or arXiv:2610.20256v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2610.20256 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 202 words

Related coverage