Rethinking Critic Learning in PPO: Understanding and Mitigating Value Flattening
Summary
The paper identifies Value Flattening as a failure mode in PPO critic learning for LLMs and introduces SP3O, a sparse supervision method, to mitigate it, showing consistent improvements in experiments.
View Cached Full Text
Cached at: 09/17/26, 06:52 AM
Paper page - Rethinking Critic Learning in PPO: Understanding and Mitigating Value Flattening
Source: https://huggingface.co/papers/2609.18708 Published on Sep 16
·
Submitted byhttps://huggingface.co/ramiroluo
Luoon Sep 17
Authors:
,
,
,
,
,
,
,
,
,
,
Abstract
Inreinforcementlearningforlargelanguagemodels,ProximalPolicyOptimization(PPO)commonlyusesacritictoestimatestatevaluesandreducethevarianceofpolicyupdates.However,weuncoverasystematicfailuremodeinPPOcritics,whichwecallValueFlattening:statevalues,estimatedfrommultipleMonteCarlocontinuations,changesharplyacrossintermediatestateswhilecriticpredictionsremaincomparativelyflat.WefurtherobservethisphenomenoninacontrolledFrozenLakeenvironmentandfindthatitbecomesmorepronouncedasthestatespacegrows.OurtheoreticalandempiricalanalysesrelateValueFlatteningtoanimplicitvariancepenaltyinthecriticlossandredundantupdatesfromtemporallycorrelatedstateswithsimilargradients.Motivatedbythesefindings,weintroduceSParseProximalPolicyOptimization(SP^3O),whichappliesthevaluelosstoonlyafewwell-separatedstatesineachresponsetomitigatebotheffects.ExperimentsonQwen3-BaseshowthatSP^3OwithonlythreestatessupervisedperresponsecanmitigateValueFlatteningandconsistentlyimprovethelearnedpolicyacrossmodelsizesandevaluationsuites.Together,ourresultsidentifyValueFlatteningasanimportantyetoverlookedfailuremodeofcriticlearninginstandardPPOandshowthatasimplesparsesupervisionstrategycanmitigateit.
View arXiv pageView PDFProject pageGitHubAdd to collection
Get this paper in your agent:
hf papers read 2609\.18708
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2609.18708 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2609.18708 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2609.18708 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
Weak Critics Make Strong Learners: On-Policy Critique Distillation for Scalable Oversight
Proposes on-policy critique distillation (Opcd) using weak models as critics to provide revision directions for strong models, improving reasoning and alignment without requiring weak models to solve tasks.
Your Language Model is Its Own Critic: Reinforcement Learning with Value Estimation from Actor's Internal States
This paper introduces POISE, a method for stable policy optimization in large reasoning models by estimating baselines using the model's own internal states, reducing computational overhead compared to PPO and GRPO.
KLip-PPO: A per-sample KL perspective on PPO-Clip
This paper shows that the gradient of the clipped surrogate in Proximal Policy Optimization (PPO) is exactly reproduced by a per-sample Kullback-Leibler penalty with a variable coefficient, revealing structural features of the clipped surrogate and suggesting new design directions.
Value-Gradient Hypothesis of RL for LLMs
This paper introduces the value-gradient hypothesis to explain why critic-free RL methods like PPO and GRPO work well for LLMs, showing that the actor backward pass carries a value-gradient-like signal. It derives a predictive criterion for when RL is most effective along the pretraining trajectory.
@johnschulman2: PPO had a second wave in the LLM era for reasons unanticipated by the original paper - the importance-ratio objective f…
This paper reveals that the clipping mechanism in PPO and GRPO biases entropy in RLVR for LLMs: clip-low increases entropy, clip-high decreases it. The authors prove that standard clipping reduces entropy even with random rewards, and show that adjusting clip-low can prevent entropy collapse and promote exploration.