arXiv:2605.10236cs.LGcs.AI2026-05

低数据量时,非均匀重放能显著提升强化学习效率。

When Does Non-Uniform Replay Matter in Reinforcement Learning?

论文配图:When Does Non-Uniform Replay Matter in Reinforcement Learning?
图 1 · 摘自论文原文
  • 用截断几何分布设计重放策略,偏向近期经验但保持高熵。
  • 在低重放体积下,新方法比均匀重放提升样本效率。
  • 适用于数据稀缺场景,尤其适合大规模并行训练任务。

现代离策略强化学习算法通常依赖简单的均匀重放采样,但非均匀重放何时有效仍不明确。我们发现其效果受三个因素影响:重放体积(每环境步的重放过渡数)、期望时效性(采样过渡的新近程度)以及重放采样分布的熵。研究表明,非均匀重放最有益于重放体积较低的情况,且即使在相似时效性下,高熵采样也至关重要。基于此,我们提出一种简单高效的截断几何重放策略,偏向近期经验但保持高熵,计算开销极小。在大规模并行模拟、单任务和多任务设置中,包括三种现代算法在五个基准测试套件上的评估,该策略在低重放体积下显著提升样本效率,高重放体积下仍具竞争力。

原文摘要 · Abstract (English)

Modern off-policy reinforcement learning algorithms often rely on simple uniform replay sampling and it remains unclear when and why non-uniform replay improves over this strong baseline. Across diverse RL settings, we show that the effectiveness of non-uniform replay is governed by three factors: replay volume, the number of replayed transitions per environment step; expected recency, how recent sampled transitions are; and the entropy of the replay sampling distribution. Our main contribution is clarifying when non-uniform replay is beneficial and providing practical guidance for replay design in modern off-policy RL. Namely, we find that non-uniform replay is most beneficial when replay volume is low, and that high-entropy sampling is important even at comparable expected recency. Motivated by these findings, we adopt a simple Truncated Geometric replay that biases sampling toward recent experience while preserving high entropy and incurring negligible computational overhead. Across large-scale parallel simulation, single-task, and multi-task settings, including three modern algorithms evaluated on five RL benchmark suites, this replay sampling strategy improves sample efficiency in low-volume regimes while remaining competitive when replay volume is high.

强化学习重放机制样本效率离策略

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