arXiv:2603.24840cs.CL2026-03ACL被引 9

通过生成时动态剪枝,提升大模型强化学习推理效率与准确率。

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

  • 生成过程中实时剪枝低价值轨迹,保留更均衡的正确样本。
  • 在Qwen-3和LLaMA-3.2上平均准确率提升2.30~2.99,训练提速最高1.7倍。
  • 适合追求高效高精度强化学习推理的开发者与研究者。

基于可验证奖励的强化学习(RLVR)显著提升了大语言模型的推理能力。然而,GRPO和DAPO等方法因每轮提示需大量采样轨迹,导致计算开销巨大。此外,RLVR中的相对优势常呈稀疏分布:许多样本几乎全对或全错,组内奖励方差小,学习信号弱。本文提出arrol(加速RLVR的在线轨迹剪枝方法),在生成过程中动态剪枝,同时引导剩余轨迹更趋正确性均衡,以增强学习信号。具体地,arrol在生成时训练轻量级质量头,预测部分轨迹的成功概率,并据此进行早期剪枝决策;该质量头还可用于测试阶段加权候选结果,提升推理精度。为提高效率,系统设计将剪枝嵌入推理引擎,并对剩余轨迹重新批处理以计算对数概率与策略更新。在Qwen-3和LLaMA-3.2(1B-8B)模型上的实验表明,arrol使平均准确率提升2.30至2.99,训练速度最高提升1.7倍,测试阶段缩放下额外增益达+8.33。代码已开源。

原文摘要 · Abstract (English)

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.

强化学习大模型推理剪枝效率优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。