mlsanityData to 14 Oct 2026

Verifiable Rewards for Calibrated Probabilistic Forecasting

arXiv 2607.00164 ↗First posted 30 Jun 2026cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Reinforcement learning with verifiable rewards can in principle train calibrated probabilistic forecasters, since a proper scoring rule such as the Brier score is computed from outcomes alone and is minimized in expectation by the true probability. In practice it degrades calibration, and existing remedies address epistemic uncertainty, where a model's confidence accompanies a verifiably correct or incorrect answer. We study aleatoric forecasting, where the forecast itself is the output and the label is one stochastic outcome, taking NFL in-game win probability as a testbed with the betting market as a reference. Rewarding the realized per-play outcome fails, because the single outcome is a noisy target and the policy gradient corrupts the chain of thought. We introduce a verifiable, label-free reward, a state-conditioned empirical win rate estimated from past outcomes, that removes the label noise, and we keep the gradient off the reasoning, by direct prediction or a gradient mask, so it cannot be corrupted. Trained with this reward alone, without human labels or supervised fine-tuning, a 7B model reaches the calibration of the betting market by direct prediction and is better calibrated than a zero-shot frontier model. That frontier model and a tabular estimator reach the same Brier score as this model, identifying the market's small remaining edge as live in-game information beyond their shared inputs. Masking the gradient, rather than dropping the chain of thought, preserves reasoning from which the forecast follows, which ordinary chain-of-thought training corrupts.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 20 of its 39 references that are in the map. First posted on arXiv 30 Jun 2026.

Builds on

20 of 39 references.

References · 20

  1. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  2. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  3. 2017On Calibration of Modern Neural Networkscited by 4,960
  4. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
  5. 2025Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoningcited by 559
  6. 2025GPG: A Simple and Strong Reinforcement Learning Baseline for Model Reasoningcited by 150
  7. 2025Beyond Binary Rewards: Training LMs to Reason About Their Uncertaintycited by 117
  8. 2024Taming Overconfidence in LLMs: Reward Calibration in RLHFcited by 112
  9. 2024ForecastBench: A Dynamic Benchmark of AI Forecasting Capabilitiescited by 110
  10. 2024Approaching Human-Level Forecasting with Language Modelscited by 107
  11. 2024Linguistic Calibration of Long-Form Generationscited by 60
  12. 2025Stabilizing Knowledge, Promoting Reasoning: Dual-Token Constraints for RLVRcited by 39
8 more
  1. 2025On the Design of KL-Regularized Policy Gradient Algorithms for LLM Reasoningcited by 30
  2. 2020Evaluating probabilistic classifiers: Reliability diagrams and score decompositions revisitedcited by 26
  3. 2025Pitfalls in Evaluating Language Model Forecasterscited by 23
  4. 2025Outcome-based Reinforcement Learning to Predict the Futurecited by 22
  5. 2025LLMs Can Teach Themselves to Better Predict the Futurecited by 14
  6. 2026Decoupling Reasoning and Confidence: Resurrecting Calibration in Reinforcement Learning from Verifiable Rewardscited by 14
  7. 2024Can Language Models Use Forecasting Strategies?cited by 13
  8. 2024Exploring the Difficulty of Estimating Win Probability: A Simulation Studycited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Reinforcement Learning with Verifiable yet Noisy Rewards under Imperfect Verifiers
  2. 2026Rate or Fate? RLV^varepsilonR: Reinforcement Learning with Verifiable Noisy Rewards
  3. 2026Reinforcement Learning with Conditional Expectation Reward
  4. 2025ConfClip: Confidence-Weighted and Clipped Reward for Reinforcement Learning in LLMs
  5. 2026Beyond Verbalized Confidence: Calibrating Reasoners with Differentiable Readouts
  6. 2026Trade-R1: Bridging Verifiable Rewards to Stochastic Environments via Process-Level Reasoning Verification
  7. 2026Discounted Beta-Bernoulli Reward Estimation for Sample-Efficient Reinforcement Learning with Verifiable Rewards
  8. 2025Reinforcement Learning with Verifiable Rewards: GRPO's Effective Loss, Dynamics, and Success Amplification