Follow the Winners: Conservative Policy Improvement with the Cross-Entropy Method for Critic-Free RFT
cs.LG, cs.AI
Submitted: 2026-10-02
Updated: 2026-10-02
Comments: Poster at NeurIPS 2026
Code: https://github.com/mpSchrader/gym-sokoban
License: http://creativecommons.org/licenses/by/4.0/
The gist: Critic-free reinforcement fine-tuning (RFT) for agentic large language models is often done through GRPO-style methods, which compute a group baseline over repeated rollouts to reduce target variance.
Abstract
Critic-free reinforcement fine-tuning (RFT) for agentic large language models is often done through GRPO-style methods, which compute a group baseline over repeated rollouts to reduce target variance. However, this setup is ill-suited to agents acting in stateful environments such as live services or security sandboxes, where repeated rollouts are impractical to obtain and aggressive updates entrench the noise of long, sparsely verified trajectories. We propose Follow the Winners (FTW), a critic-free policy-learning algorithm that adapts the cross-entropy method to RFT, replacing group rollouts with an ordinal filter on replay-buffer samples that yields polynomial concentration in the order statistic of returns. We derive FTW through a control-as-inference lens, which also recovers GRPO and DPO as specific modelling choices, identifying GRPO as risk-neutral while DPO and FTW share a bounded risk-seeking offset that FTW controls. We identify this offset as an inherent trade-off of variance reduction through ordinal filters on samples, whereas a critic model induces a different trade-off between bias and variance. Scaled to agentic LLM post-training, FTW matches GRPO and PPO on Sokoban and Search-R1 baselines, showing a viable trade-off from a value model or group rollouts to CPU memory.
Sources
- Sequential Monte Carlo for Policy Optimization in Continuous POMDPs
- Efficient RL Training for LLMs with Experience Replay
- Layer Normalization
- VariBASed: Variational Bayes-Adaptive Sequential Monte-Carlo Planning for Deep Reinforcement Learning
- Reinforced Self-Training (ReST) for Language Modeling
- REINFORCE++: Stabilizing Critic-Free Policy Optimization with Global Advantage Normalization
- Search-R1: Training LLMs to Reason and Leverage Search Engines with Reinforcement Learning
- Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Review
- Qwen2.5 Technical Report
- Proximal Policy Optimization Algorithms
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- RAGEN: Understanding Self-Evolution in LLM Agents via Multi-Turn Reinforcement Learning
- It Takes Two: Your GRPO Is Secretly DPO
- A Minimalist Approach to LLM Reasoning: from Rejection Sampling to Reinforce
- DAPO: An Open-Source LLM Reinforcement Learning System at Scale
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks