mlsanityData to 7 Oct 2026

V0: A Generalist Value Model for Any Policy at State Zero

arXiv 2602.03584 ↗First posted 3 Feb 2026cs.CL cs.AI cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Policy gradient methods rely on a baseline to measure the relative advantage of an action, ensuring the model reinforces behaviors that outperform its current average capability. In the training of Large Language Models (LLMs) using Actor-Critic methods (e.g., PPO), this baseline is typically estimated by a Value Model (Critic) often as large as the policy model itself. However, as the policy continuously evolves, the value model requires expensive, synchronous incremental training to accurately track the shifting capabilities of the policy. To avoid this overhead, Group Relative Policy Optimization (GRPO) eliminates the coupled value model by using the average reward of a group of rollouts as the baseline; yet, this approach necessitates extensive sampling to maintain estimation stability. In this paper, we propose V0, a Generalist Value Model capable of estimating the expected performance of any model on unseen prompts without requiring parameter updates. We reframe value estimation by treating the policy's dynamic capability as an explicit context input; specifically, we leverage a history of instruction-performance pairs to dynamically profile the model, departing from the traditional paradigm that relies on parameter fitting to perceive capability shifts. Focusing on value estimation at State Zero (i.e., the initial prompt, hence V0), our model serves as a critical resource scheduler. During GRPO training, V0 predicts success rates prior to rollout, allowing for efficient sampling budget allocation; during deployment, it functions as a router, dispatching instructions to the most cost-effective and suitable model. Empirical results demonstrate that V0 significantly outperforms heuristic budget allocation and achieves a Pareto-optimal trade-off between performance and cost in LLM routing tasks.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 37 of its 45 references that are in the map. First posted on arXiv 3 Feb 2026.

Builds on

37 of 45 references.

References · 37

  1. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  2. 2025Qwen3 Technical Reportcited by 8,195
  3. 2024Qwen2.5 Technical Reportcited by 4,713
  4. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
  5. 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,057
  6. 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 643
  7. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
  8. 2025Open-Reasoner-Zero: An Open Source Approach to Scaling Up Reinforcement Learning on the Base Modelcited by 450
  9. 2021Transformers Can Do Bayesian Inferencecited by 338
  10. 2025VAPO: Efficient and Reliable Reinforcement Learning for Advanced Reasoning Taskscited by 281
  11. 2022Is Reinforcement Learning (Not) for Natural Language Processing: Benchmarks, Baselines, and Building Blocks for Natural Language Policy Optimizationcited by 244
  12. 2025AReaL: A Large-Scale Asynchronous Reinforcement Learning System for Language Reasoningcited by 234
25 more
  1. 2024AlphaMath Almost Zero: Process Supervision without Processcited by 160
  2. 2025TabPFN-2.5: Advancing the State of the Art in Tabular Foundation Modelscited by 115
  3. 2025Act Only When It Pays: Efficient Reinforcement Learning for LLM Reasoning via Selective Rolloutscited by 108
  4. 2025What's Behind PPO's Collapse in Long-CoT? Value Optimization Holds the Secretcited by 95
  5. 2024RouterDC: Query-Based Router by Dual Contrastive Learning for Assembling Large Language Modelscited by 84
  6. 2024Vision Language Models are In-Context Value Learnerscited by 84
  7. 2025Universal Model Routing for Efficient LLM Inferencecited by 80
  8. 2025LongCat-Flash Technical Reportcited by 54
  9. 2025Improving Data Efficiency for LLM Reinforcement Fine-tuning Through Difficulty-targeted Online Data Selection and Rollout Replaycited by 52
  10. 2024Value Augmented Sampling for Language Model Alignment and Personalizationcited by 49
  11. 2025Prosperity before Collapse: How Far Can Off-Policy RL Reach with Stale Data on LLMs?cited by 49
  12. 2024EmbedLLM: Learning Compact Representations of Large Language Modelscited by 46
  13. 2024Why Larger Language Models Do In-context Learning Differently?cited by 44
  14. 2025Depth-Breadth Synergy in RLVR: Unlocking LLM Reasoning Gains with Adaptive Explorationcited by 40
  15. 2025The Avengers: A Simple Recipe for Uniting Smaller Language Models to Challenge Proprietary Giantscited by 37
  16. 2025Generalist Reward Models: Found Inside Large Language Modelscited by 34
  17. 2025Beyond GPT-5: Making LLMs Cheaper and Better via Performance-Efficiency Optimized Routingcited by 32
  18. 2024Efficient Reinforcement Learning with Large Language Model Priorscited by 30
  19. 2024Beyond Sparse Rewards: Enhancing Reinforcement Learning with Language Model Critique in Text Generationcited by 22
  20. 2025Knapsack RL: Unlocking Exploration of LLMs via Optimizing Budget Allocationcited by 21
  21. 2025CurES: From Gradient Analysis to Efficient Curriculum Learning for Reasoning LLMscited by 16
  22. 2025Soft Policy Optimization: Online Off-Policy RL for Sequence Modelscited by 12
  23. 2025VRPO: Rethinking Value Modeling for Robust RL under Noisy Supervision in LLM Post-Trainingcited by 9
  24. 2025Truncated Proximal Policy Optimizationcited by 8
  25. 2025Stable and Efficient Single-Rollout RL for Multimodal Reasoningcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 7.

7 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026VIMPO: Value-Implicit Policy Optimization for LLMs
  2. 2026Your Language Model is Its Own Critic: Reinforcement Learning with Value Estimation from Actor's Internal States
  3. 2025Single-stream Policy Optimization
  4. 2026CAPO: Critic-Guided Action-Aligned Policy Optimization for Advancing LLM Agent Capabilities
  5. 2026GVPO++: Group Variance Policy Optimization for LLM Post-Training and On-Policy Distillation
  6. 2026BV-Blend: Uncertainty-Weighted Historical Baselines for Stable Critic-Free RL with Verifiable Rewards
  7. 2026Value-Gradient Hypothesis of RL for LLMs
  8. 2026A First-Principles Derivation of LLM Policy Optimization: From Expected Reward to GRPO and Its Structural Extensions