Prune as You Generate: Online Rollout Pruning for Faster and Better RLVR

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Xu, Haobo, Chen, Sirui, Qiu, Ruizhong, Yan, Yuchen, Luo, Chen, Cheng, Monica, He, Jingrui, Tong, Hanghang
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912982853746688
author Xu, Haobo
Chen, Sirui
Qiu, Ruizhong
Yan, Yuchen
Luo, Chen
Cheng, Monica
He, Jingrui
Tong, Hanghang
author_facet Xu, Haobo
Chen, Sirui
Qiu, Ruizhong
Yan, Yuchen
Luo, Chen
Cheng, Monica
He, Jingrui
Tong, Hanghang
contents Reinforcement Learning with Verifiable Rewards (RLVR) has significantly advanced the reasoning capabilities of Large Language Models (LLMs). However, methods such as GRPO and DAPO suffer from substantial computational cost, since they rely on sampling many rollouts for each prompt. Moreover, in RLVR the relative advantage is often sparse: many samples become nearly all-correct or all-incorrect, yielding low within-group reward variance and thus weak learning signals. In this paper, we introduce arrol (Accelerating RLVR via online Rollout Pruning), an online rollout pruning method that prunes rollouts during generation while explicitly steering the surviving ones more correctness-balanced to enhance learning signals. Specifically, arrol trains a lightweight quality head on-the-fly to predict the success probability of partial rollouts and uses it to make early pruning decisions. The learned quality head can further weigh candidates to improve inference accuracy during test-time scaling. To improve efficiency, we present a system design that prunes rollouts inside the inference engine and re-batches the remaining ones for log-probability computation and policy updates. Across GRPO and DAPO on Qwen-3 and LLaMA-3.2 models (1B-8B), arrol improves average accuracy by +2.30 to +2.99 while achieving up to 1.7x training speedup, and yielding up to +8.33 additional gains in average accuracy in test-time scaling. The code is available at https://github.com/Hsu1023/ARRoL.
format Preprint
id arxiv_https___arxiv_org_abs_2603_24840
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Prune as You Generate: Online Rollout Pruning for Faster and Better RLVR
Xu, Haobo
Chen, Sirui
Qiu, Ruizhong
Yan, Yuchen
Luo, Chen
Cheng, Monica
He, Jingrui
Tong, Hanghang
Computation and Language
Reinforcement Learning with Verifiable Rewards (RLVR) has significantly advanced the reasoning capabilities of Large Language Models (LLMs). However, methods such as GRPO and DAPO suffer from substantial computational cost, since they rely on sampling many rollouts for each prompt. Moreover, in RLVR the relative advantage is often sparse: many samples become nearly all-correct or all-incorrect, yielding low within-group reward variance and thus weak learning signals. In this paper, we introduce arrol (Accelerating RLVR via online Rollout Pruning), an online rollout pruning method that prunes rollouts during generation while explicitly steering the surviving ones more correctness-balanced to enhance learning signals. Specifically, arrol trains a lightweight quality head on-the-fly to predict the success probability of partial rollouts and uses it to make early pruning decisions. The learned quality head can further weigh candidates to improve inference accuracy during test-time scaling. To improve efficiency, we present a system design that prunes rollouts inside the inference engine and re-batches the remaining ones for log-probability computation and policy updates. Across GRPO and DAPO on Qwen-3 and LLaMA-3.2 models (1B-8B), arrol improves average accuracy by +2.30 to +2.99 while achieving up to 1.7x training speedup, and yielding up to +8.33 additional gains in average accuracy in test-time scaling. The code is available at https://github.com/Hsu1023/ARRoL.
title Prune as You Generate: Online Rollout Pruning for Faster and Better RLVR
topic Computation and Language
url https://arxiv.org/abs/2603.24840