RREDCoT: Segment-Level Reward Redistribution for Reasoning Models
Why This Matters
Directly addresses fine-tuning and LLM integration through the proposal of RREDCoT, a method for reward redistribution in reasoning language models. The paper also presents empirical results and analysis of the method.
Abstract
Recent advancements in reasoning language models have been driven by Reinforcement Learning (RL) fine-tuning. Most often, these rely on the Group Relative Policy Optimization (GRPO) algorithm or modifications thereof to steer the models to produce Chain-of-Thought (CoT) traces. The final answer can only be verified, and the reward assigned, after the CoT trace is complete, making it a delayed reward problem. GRPO and its modifications correspond to Monte Carlo methods in standard RL, which are known to suffer from high variance. A possible solution to this problem is the redistribution of rewards through credit assignment, where segments of the CoT trace that are important for arriving at the desirable solution are emphasized by assigning a higher reward. While Monte Carlo sampling can be used to provide an unbiased estimate of intermediate state values, its computational overhead makes it unsuitable for train-time credit assignment in long contexts at high granularity. We introduce RREDCoT (Reward REDistribution for Chain of Thoughts), which utilizes the model itself to approximate the optimal reward redistribution without additional generation. We investigate the advantages of our method compared to MC sampling and several attribution methods. We further analyze several aspects relevant to the construction of the redistribution such as segmentation of CoT traces and state value estimation.
Links
Metadata
Save to Vault
Save this article directly to your Obsidian vault. Opens Obsidian with the note pre-filled.
Will save to: vault/inbox/signals/2026-06-07-rredcot-segment-level-reward-redistribution-for-reasoning-models.md