CLJan 29

Distribution-Aware Reward Estimation for Test-Time Reinforcement Learning

arXiv:2601.21804v1h-index: 1
Originality Highly original
AI Analysis

This addresses a critical bottleneck in enabling LLMs to self-improve on unlabeled data, offering a more robust method for reward estimation in test-time reinforcement learning.

The paper tackled the problem of biased reward estimation in test-time reinforcement learning for large language models by proposing Distribution-Aware Reward Estimation (DARE), which improved final performance with relative gains of 25.3% on AIME 2024 and 5.3% on AMC benchmarks.

Test-time reinforcement learning (TTRL) enables large language models (LLMs) to self-improve on unlabeled inputs, but its effectiveness critically depends on how reward signals are estimated without ground-truth supervision. Most existing TTRL methods rely on majority voting (MV) over rollouts to produce deterministic rewards, implicitly assuming that the majority rollout provides a reliable learning signal. We show that this assumption is fragile: MV reduces the rollout distribution into a single outcome, discarding information about non-majority but correct actions candidates, and yields systematically biased reward estimates. To address this, we propose Distribution-AwareReward Estimation (DARE), which shifts reward estimation from a single majority outcome to the full empirical rollout distribution. DARE further augments this distribution-based reward with an exploration bonus and a distribution pruning mechanism for non-majority rollout exploration and reward denoise, yielding a more informative and robust reward estimation. Extensive experiments on challenging reasoning benchmarks show that DARE improves optimization stability and final performance over recent baselines, achieving relative improvements of 25.3% on challenging AIME 2024 and 5.3% on AMC.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes