aiqbench analysis
This paper is squarely about AI: it proposes AR3PO, a reinforcement learning method for training large language models with verifiable rewards, aimed at reducing wasted rollouts when GRPO groups yield zero advantage. The headline result is a reported up-to-4.2x reduction in generated responses for comparable performance to DAPO on math benchmarks, though the evidence is limited to four math benchmarks and 7B/8B models plus a single 32B comparison. For ML practitioners, the practical question is whether the sampling savings hold across domains and training scales beyond math.
Improving Sampling Efficiency in RLVR through Adaptive Rollout and Response Reuse
arXiv:2509.25808v2 Announce Type: replace Abstract: Group relative policy optimization (GRPO) trains large language models with verifiable rewards by normalizing rewards within response groups. When every response in a group receives the same reward, the advantages vanish and the group provides no policy gradient signal. We propose Adaptive Rollout and Response Reuse Policy Optimization (AR3PO) to obtain informative groups with fewer generations. Adaptive rollout samples responses to each prompt in stages and stops sampling once the model generates a correct response. If all sampled responses are incorrect, response reuse replaces one of them with a past correct response to the same prompt, when available, and recomputes the group advantages. Policy-recomputed reuse trains on the updated groups using probabilities recomputed under the rollout policy; advantage-only reuse uses historical responses only to compute advantages. Across four mathematical benchmarks with 7B and 8B models, AR3PO consistently improves over GRPO and achieves performance comparable to DAPO while requiring up to $4.2\times$ fewer generated responses. Experiments with a 32B model also show comparable performance to DAPO at a similar training stage with substantially fewer generated responses.
Abstract:Group relative policy optimization (GRPO) trains large language models with verifiable rewards by normalizing rewards within response groups. When every response in a group receives the same reward, the advantages vanish and the group provides no policy gradient signal. We propose Adaptive Rollout and Response Reuse Policy Optimization (AR3PO) to obtain informative groups with fewer generations. Adaptive rollout samples responses to each prompt in stages and stops sampling once the model generates a correct response. If all sampled responses are incorrect, response reuse replaces one of them with a past correct response to the same prompt, when available, and recomputes the group advantages. Policy-recomputed reuse trains on the updated groups using probabilities recomputed under the rollout policy; advantage-only reuse uses historical responses only to compute advantages. Across four mathematical benchmarks with 7B and 8B models, AR3PO consistently improves over GRPO and achieves performance comparable to DAPO while requiring up to $4.2\times$ fewer generated responses. Experiments with a 32B model also show comparable performance to DAPO at a similar training stage with substantially fewer generated responses.
Machine Learning (cs.LG)
arXiv:2509.25808 [cs.LG]
(or arXiv:2509.25808v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2509.25808 Focus to learn more arXiv-issued DOI via DataCite
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 · 267 words
Related coverage
Humans Are Not Chinchillas: Revisiting “How Quick and Big Would A Software Intelligence Explosion Be?”
LessWrong · Oct 5, 2026
Lightning Weave: Improving the Accuracy-Efficiency Frontier of Reasoning Models through Capability Composition
arXiv · Sep 16, 2026

PagedAttention vs. RadixAttention: Optimizing LLM KV Cache Management
Analytics Vidhya · Aug 21, 2026
Recursive self-improvement of AI research agents
arXiv · Sep 24, 2026