mlsanityData to 7 Oct 2026

Free Everywhere, Exact on Trees: PPO's Dropped Correction Buys Sample Efficiency Under Aggressive Reuse

arXiv 2609.39634 ↗First posted 30 Sep 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Common policy improvement methods, including TRPO, PPO, and GRPO, estimate policy improvement under the behavioral policy's state-visitation distribution rather than the improved policy's own. The substitution makes the objective estimable from the behavioral policy's rollouts but adds a bias growing with policy divergence, hence the trust region or clip, and hence no reuse of a batch far off-policy. We show that under history-injective dynamics, where each state is reached by exactly one history, the dropped state-visitation ratio equals the product of per-step policy ratios along the sampled prefix, on every trajectory and not only in expectation. The ratio is therefore restored exactly, from log-probabilities PPO already computes. Autoregressive generation and canonical-order constructive optimization are both history-injective. The exact correction pays importance-sampling variance that grows with the horizon, so we generalize it to a one-parameter family with PPO (α=0) and the full correction (α=1) as endpoints: a single bias--variance knob. A gradient-level analysis of the unclipped surrogate identifies two channels the correction acts through and three conditions under which it carries signal; an enumerable testbed confirms the conditions' predictions. On hard credit-assignment scheduling tasks, a short corrected warmup with aggressive early sample reuse learns faster than PPO and than the same reuse uncorrected; the marginal gain grows with task difficulty (+0.02 to +0.09 learning-curve AUC), and the early win over PPO tracks the prefix bias that reuse incurs. A correction held throughout, or applied where clipping already contains the reuse bias, is null to harmful.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 29 references that are in the map. First posted on arXiv 30 Sep 2026.

Builds on

15 of 29 references.

References · 15

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  3. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
  4. 2024Qwen2.5 Technical Reportcited by 4,713
  5. 2015Trust Region Policy Optimizationcited by 2,503
  6. 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
  7. 2018Attention, Learn to Solve Routing Problems!cited by 646
  8. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  9. 2016Safe and Efficient Off-Policy Reinforcement Learningcited by 260
  10. 2018Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimationcited by 226
  11. 2019Towards Optimal Off-Policy Evaluation for Reinforcement Learning with Marginalized Importance Samplingcited by 118
  12. 2018Policy Optimization via Importance Samplingcited by 47
3 more
  1. 2019Conditional Importance Sampling for Off-Policy Learningcited by 12
  2. 2026A Step Back: Prefix Importance Ratio Stabilizes Policy Optimizationcited by 7
  3. 2026Rethinking Importance Sampling in LLM Policy Optimization: A Cumulative Token Perspectivecited by 4

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026OR Else: A Differentiable Trust Region for Policy Optimization
  2. 2026OPTS-TTPO: Enhancing Finite-Sample Policy-Gradient Learning with Tree Search
  3. 2025Learning More with Less: A Dynamic Dual-Level Down-Sampling Framework for Efficient Policy Optimization
  4. 2025Understanding the Impact of Sampling Quality in Direct Preference Optimization
  5. 2026Success Conditioning as Policy Improvement: The Optimization Problem Solved by Imitating Success
  6. 2026Beyond Importance Sampling: Rejection-Gated Policy Optimization
  7. 2026Fine-Tuning on Self-Generated and Reward-Weighted Data: Learning Dynamics, Convergence Rates, and Benefits of Off-Policyness
  8. 2026Reusing Rollouts under Policy Lag: Prefix-Normalized Policy Optimization for LLM Reinforcement Learning