🤖 AI Summary
This paper addresses the challenge of jointly leveraging on-policy and off-policy data in reinforcement learning fine-tuning of large language models (LLMs). To this end, we propose AGRO—a novel algorithm grounded in the principle of generative consistency, which establishes a unified policy gradient optimization framework across heterogeneous policies. AGRO is the first method enabling joint training on both on-policy and off-policy data within a single algorithm. Theoretically, it provides convergence guarantees; technically, it integrates generative consistency modeling with policy gradient estimation, circumventing the high-variance issues inherent in conventional importance sampling. Empirical evaluation on mathematical reasoning tasks demonstrates that AGRO significantly outperforms mainstream baselines—including PPO and GRPO—validating its effectiveness, robustness, and generalization capability in cross-policy data co-training.
📝 Abstract
We introduce a novel reinforcement learning algorithm (AGRO, for Any-Generation Reward Optimization) for fine-tuning large-language models. AGRO leverages the concept of generation consistency, which states that the optimal policy satisfies the notion of consistency across any possible generation of the model. We derive algorithms that find optimal solutions via the sample-based policy gradient and provide theoretical guarantees on their convergence. Our experiments demonstrate the effectiveness of AGRO in both on-policy and off-policy settings, showing improved performance on the mathematical reasoning dataset over baseline algorithms.