Luck Is Not Skill: When Do Paired Rollouts Help Group-Relative RL of LLM Agents?
cs.LG
Submitted: 2026-09-21
Updated: 2026-09-21
Comments: 24 pages, 5 figures, 14 tables. Code, task pools, pre-registration and numerical summaries: https://github.com/TheDeadcoder/paired-rollouts
Code: https://github.com/TheDeadcoder/paired-rollouts
License: http://creativecommons.org/licenses/by/4.0/
The gist: Group-relative reinforcement learning compares rollouts of the same prompt, but independent environment noise can obscure these comparisons.
Terminology
Abstract
Group-relative reinforcement learning compares rollouts of the same prompt, but independent environment noise can obscure these comparisons. We study paired rollouts, which share an event-keyed noise schedule within each group while preserving each rollout's marginal distribution. Pairing removes the between-schedule component of reward-contrast variance, but need not reduce gradient variance. For one-sided grader noise, we derive an exact condition for reduction and give a counterexample in which reward contrasts improve while gradient variance increases. A controlled study trains a 2B tool-use agent under tool faults and grader flips, with three seeds per design. The protocol was registered with a disclosed, previously completed pilot. Under tool faults, pairing improves final noisy-test success by +5.1 percentage points on average, with all three seed differences positive, but misses the registered learning-curve criterion. The criterion is also missed under grader flips: the validation-AUC difference is +0.003 (95% interval [-0.029, +0.033]). A gradient probe on eight distinct checkpoints from two fault-trained trajectories finds lower mean-centered covariance traces under both noise types: 21 to 30% for grader flips and 40 to 63% for tool faults. These finite-sample measurements support the variance mechanism without establishing a general learning-speed benefit. The results distinguish improving reward comparisons, reducing estimator variance, and improving learning.
Sources
- Back to Basics: Revisiting REINFORCE Style Optimization for Learning from Human Feedback in LLMs
- Realizing Common Random Numbers: Event-Keyed Hashing for Causally Valid Stochastic Models
- Learning to Act under Noise: Enhancing Agent Robustness via Noisy Environments
- LoRA: Low-Rank Adaptation of Large Language Models
- Efficient Memory Management for Large Language Model Serving with PagedAttention
- Trust Region Masking for Long-Horizon LLM Reinforcement Learning
- Understanding R1-Zero-Like Training: A Critical Perspective
- PEGASUS: A Policy Search Method for Large MDPs and POMDPs
- ToolRL: Reward is All Tool Learning Needs
- Spurious Rewards: Rethinking Training Signals in RLVR
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- AgentNoiseBench: Benchmarking Robustness of Tool-Using LLM Agents Under Noisy Condition
- $\tau$-bench: A Benchmark for Tool-Agent-User Interaction in Real-World Domains
- 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: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks