EPIG-Tree: Compute-Optimal Branching for Gradient-Efficient Reinforcement Learning.

arXiv:2609.20004v1 Announce Type: cross Abstract: Reward-based reinforcement learning for language models, exemplified by Group Relative Policy Optimization (GRPO), collapses an entire stochastic trajectory into a single scalar reward. This is clean and scalab