mlsanityData to 7 Oct 2026

REGEN: Replay-recycling for Expert-to-Generalist distillation with Offline Reinforcement Learning

arXiv 2607.19450 ↗First posted 21 Jul 2026cs.LG cs.AIcited by 1

On the map: LLM agents and tool use → Reinforcement learning for LLM agents

also in 1 more
Abstract (arXiv)

Large-scale online reinforcement learning (RL) is the predominant means of eliciting advanced abilities including long-term reasoning and agentic tool use in large language models (LLMs). However, continuing to scale it across vast task domains of interest remains challenging in both computational infrastructure and cost, especially when considering RL as merely a one-off learning stage. Recently, a widely used technique for distilling knowledge across various domains and training stages, multi-teacher on-policy distillation (MOPD), helps to decouple the RL stage, saving costs, while maintaining generality across vast domains. Nonetheless, similar to online RL, MOPD requires coupled inference and backward passes, which continues to limit its scalability and computational efficiency. To address these challenges, we propose REGEN: Replay-recycling for Expert-to-Generalist Distillation with Offline RL. Instead of distilling from multiple teacher models, REGEN trains a generalist by simply recycling the replay memory -- the free by-product of the teachers' specialized RL training -- and employing offline RL algorithms. REGEN completely decouples the rollout sampling from the backward training process and thus greatly reduces the training cost. Across mathematical reasoning, code generation, and instruction following, REGEN matches the accuracy of MOPD at substantially lower cost. It potentially turns online RL into a data synthesis process instead of a one-off learning stage, and can be extended to large-scale post-training without requiring heavy computational load. Code is available at https://github.com/yunjie-sysu/REGEN.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Reinforcement learning for LLM agents, one of 16 directions in LLM agents and tool use. Builds on 34 of its 48 references that are in the map. First posted on arXiv 21 Jul 2026.

Builds on

34 of 48 references.

Closest ancestors · 1

Same direction, newest first

  1. 2025The Landscape of Agentic Reinforcement Learning for LLMs: A Survey2 Sep

Other references · 33

  1. 2022Training language models to follow instructions with human feedbackcited by 15,712
  2. 2017Proximal Policy Optimization Algorithmscited by 14,441
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  5. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  6. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  7. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
  8. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
  9. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  10. 2024Qwen2.5 Technical Reportcited by 4,713
  11. 2017Deep reinforcement learning from human preferencescited by 3,846
  12. 2021Program Synthesis with Large Language Modelscited by 3,509
21 more
  1. 2024HybridFlow: A Flexible and Efficient RLHF Frameworkcited by 1,980
  2. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  3. 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,777
  4. 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,239
  5. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
  6. 2020Gradient Surgery for Multi-Task Learningcited by 1,210
  7. 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
  8. 2025Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?cited by 948
  9. 2023On-Policy Distillation of Language Models: Learning from Self-Generated Mistakescited by 840
  10. 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 833
  11. 2016Sequence-Level Knowledge Distillationcited by 761
  12. 2019On the Efficacy of Knowledge Distillationcited by 377
  13. 2026MiMo-V2-Flash Technical Reportcited by 163
  14. 2025KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Codingcited by 115
  15. 2025Tapered Off-Policy REINFORCE: Stable and efficient reinforcement learning for LLMscited by 61
  16. 2026MOPD: Multi-Teacher On-Policy Distillation for Capability Integration in LLM Post-Trainingcited by 60
  17. 2025Revisiting Group Relative Policy Optimization: Insights into On-Policy and Off-Policy Trainingcited by 33
  18. 2023Beyond Uniform Sampling: Offline Reinforcement Learning with Imbalanced Datasetscited by 24
  19. 2025Imbalanced Gradients in RL Post-Training of Multi-Task LLMscited by 19
  20. 2026LLMs Can Learn to Reason Via Off-Policy RLcited by 10
  21. 2026Efficient RL Training for LLMs with Experience Replaycited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Reinforcement-aware Knowledge Distillation for LLM Reasoning
  2. 2026Off-Policy Value-Based Reinforcement Learning for Large Language Models
  3. 2025Improving RL Exploration for LLM Reasoning through Retrospective Replay
  4. 2025Stabilizing Reinforcement Learning with LLMs: Formulation and Practices
  5. 2026Replay What Matters: Off-Policy Replay for Efficient LLM Reinforcement Unlearning
  6. 2025RePO: Replay-Enhanced Policy Optimization
  7. 2025RLEP: Reinforcement Learning with Experience Replay for LLM Reasoning
  8. 2025Refined Policy Distillation: From VLA Generalists to RL Experts