TensorX
返回文献探索

Paper · arXiv 2604.08706

Efficient RL Training for LLMs with Experience Replay

Charles Arnal, Vivien Cabannes, Taco Cohen, Julia Kempe, Remi Munos

23 upvotesApril 9, 2026arXiv 预印本
AI 摘要

Experience replay techniques for large language model post-training balance staleness variance and computational costs while maintaining performance and policy entropy.

Experience Replayrolloutsreinforcement learningLLM post-trainingon-policy samplingreplay buffersstaleness-induced variancesample diversityinference computepolicy entropy

Abstract

While Experience Replay - the practice of storing rollouts and reusing them multiple times during training - is a foundational technique in general RL, it remains largely unexplored in LLM post-training due to the prevailing belief that fresh, on-policy data is essential for high performance. In this work, we challenge this assumption. We present a systematic study of replay buffers for LLM post-training, formalizing the optimal design as a trade-off between staleness-induced variance, sample diversity and the high computational cost of generation. We show that strict on-policy sampling is suboptimal when generation is expensive. Empirically, we show that a well-designed replay buffer can drastically reduce inference compute without degrading - and in some cases even improving - final model performance, while preserving policy entropy.

北京市昌平区探索星信息技术及软件开发工作室

京ICP备2026059466号
Efficient RL Training for LLMs with Experience Replay | TensorX