← Latest papers
🤖 AI

SPO++: Stream-Aligned Policy Optimization for Asynchronous Agentic RL

SPO++ enhances the online learning efficiency of asynchronous agentic reinforcement learning by correcting the mismatch between trajectory-level advantage centering and token-weighted actor optimization through action-token-measure normalization and event-aligned evidence organization.

Original authors: Kai Ruan, Jinghao Lin, Qianshan Wei, Ziqi Zhou, Zihe Huang

Published 2026-08-26
📖 6 min read🧠 Deep dive

Original authors: Kai Ruan, Jinghao Lin, Qianshan Wei, Ziqi Zhou, Zihe Huang

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the rapidly evolving field of artificial intelligence, researchers are teaching computer programs to solve complex problems by letting them try, fail, and learn from the results. This process, known as reinforcement learning, is particularly useful for training large language models to act as agents that can use tools, navigate virtual environments, or solve math problems. A central challenge in this work is how to measure success when the path to an answer is long and unpredictable. Traditional methods often require the system to generate many different attempts at the same problem simultaneously, waiting for every single one to finish before it can learn from the results. This creates a bottleneck: if one attempt takes a long time to complete because it gets stuck or tries many tools, the entire learning process pauses, waiting for that slowest attempt to catch up.

To solve this inefficiency, a newer approach called Single-stream Policy Optimization was developed. Instead of waiting for a group of attempts, this method allows the system to learn from one attempt at a time, using a persistent memory of past successes and failures to guide future decisions. However, a team of researchers led by Kai Ruan and Jinghao Lin discovered that while this method removed the waiting time, it introduced a subtle but significant mismatch in how the computer calculated its progress. They found that the way the system averaged its rewards did not align with how it actually processed the steps of a solution. By correcting this alignment, they created an improved version of the method, which they named SPO++, that allows the artificial intelligence to learn significantly faster and more efficiently.

The core of the problem lay in how the computer handled the length of its responses. In the original method, the system would calculate a single score for an entire attempt, such as whether a robot successfully cleaned a room or a math solver found the correct answer. It would then spread this single score across every word or "token" the model generated during that attempt. This seemed logical, but it created a distortion. If one attempt was very long and another was short, the long attempt would dilute its score over many words, while the short attempt would concentrate its score on fewer words. When the system tried to learn from these scores, the length of the response silently changed the center point of the learning, causing the model to optimize for the wrong things. It was as if the system was trying to balance a scale, but the weights on the scale were shifting depending on how many items were placed on them, rather than the value of the items themselves.

The researchers identified two specific areas where this misalignment occurred. First, the system was tracking when it received the results of an attempt rather than when the attempt was actually generated. In an asynchronous system where tasks are sent out and completed at different speeds, the order in which results arrive is often random and dependent on network speed or computer load. The original method used this arrival order to update its memory, which meant the learning signal was influenced by the timing of the computer system rather than the logic of the task itself. Second, and more critically, the method of averaging the scores did not account for the fact that the model learns from every word it generates, not just the final outcome. The researchers realized that to fix the learning process, they needed to standardize the scores based on the number of action words generated, ensuring that the reward signal matched the actual volume of work the model was doing.

To address these issues, the team introduced SPO++, which makes two key changes to the learning process. First, they reorganized the memory system to track the "policy event," which is the specific moment a request was sent out, rather than when the result came back. This ensures that the system's memory of past successes is tied to the state of the model at the time the task was created, making the learning signal consistent regardless of how long the task took to finish. Second, they changed how the scores are averaged. Instead of treating every attempt as a single unit, the new method calculates the average score based on the total number of action words generated across all attempts. This ensures that the learning signal is perfectly aligned with the way the model actually updates its knowledge, word by word.

The results of these changes were tested on two different types of tasks: a set of 128 simulated household chores where an agent must move objects to specific locations, and a dataset of 1,500 math problems requiring the use of a Python calculator. The researchers ran experiments using two different sizes of language models, one with 0.8 billion parameters and another with 2 billion parameters. In every single test, the new method, SPO++, learned faster than the original approach. On the household chores task, the improvement was substantial, with the new method achieving a significantly higher total reward over the course of training. On the math problems, the gains were smaller but still consistent, showing that the model reached a higher level of performance more quickly. The researchers found that the most powerful part of the new method was the change in how the scores were averaged, which alone accounted for the majority of the improvement.

These findings suggest that in the complex world of training artificial intelligence agents, the details of how data is processed can be just as important as the data itself. By ensuring that the way a system measures its progress matches the way it actually learns, researchers can unlock significant gains in efficiency without needing more computing power or larger models. The work demonstrates that even small misalignments in the learning process can slow down progress, and that correcting these mismatches allows the system to focus its energy on solving the problem rather than compensating for a flawed measurement. As artificial intelligence continues to tackle more difficult and varied tasks, methods like SPO++ offer a clearer path forward, ensuring that every step the model takes is measured accurately and contributes effectively to its growth.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →