mlsanityData to 14 Oct 2026

CREDO: Variance-Guided Rubric Evolution for Replay-Corrected Credit Assignment

arXiv 2609.24174 ↗First posted 21 Sep 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Long-horizon language agents receive sparse terminal feedback, while intermediate rubrics provide structured but potentially misspecified assessments of progress. In resettable training environments, counterfactual continuation rollouts can measure local credit, but exhaustive replay is costly. We propose Credo, a framework that couples evolving semantic rubrics with selective, execution-based credit correction. A frozen judge maps visible transitions to rubric features, and a credit head predicts the change in expected terminal reward associated with the realized transition. Independently sampled two-sided replays correct prediction residuals using their recorded inclusion probabilities. We derive conditional unbiasedness and a variance decomposition that connects two design choices: which rubric features to retain, and where to allocate a fixed expected replay budget. The resulting criterion weights prediction errors by policy-score sensitivity and missing replay coverage; its allocation rule additionally accounts for continuation cost. We also describe a practical mixture with terminal leave-one-out advantages and distinguish its clipped, token-normalized PPO implementation from the ideal policy-gradient estimator. This preliminary report provides the method, proofs, an exact finite-model audit, and a controlled evaluation protocol. It makes no claim of empirical superiority on language-agent benchmarks.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 20 references that are in the map. First posted on arXiv 21 Sep 2026.

Builds on

12 of 20 references.

References · 12

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  3. 2020ALFWorld: Aligning Text and Embodied Environments for Interactive Learningcited by 1,205
  4. 2025τ2-Bench: Evaluating Conversational Agents in a Dual-Control Environmentcited by 627
  5. 2025Group-in-Group Policy Optimization for LLM Agent Trainingcited by 497
  6. 2024AppWorld: A Controllable World of Apps and People for Benchmarking Interactive Coding Agentscited by 401
  7. 2017Backpropagation through the Void: Optimizing control variates for black-box gradient estimationcited by 106
  8. 2016Q-Prop: Sample-Efficient Policy Gradient with An Off-Policy Criticcited by 81
  9. 2026Branching Policy Optimization: Sandbox-Native Language Agent Reinforcement Learningcited by 12
  10. 2026When Denser Credit Is Not Enough: Evidence-Calibrated Policy Optimization for Long-Horizon LLM Agent Trainingcited by 7
  11. 2026DRACO: Fine-Grained Credit Assignment with Dynamic Rubrics for Long-Horizon Agent Trainingcited by 5
  12. 2026Policy-Conditioned Counterfactual Credit for Verifiable Reinforcement Learning of Long-Horizon Language Agentscited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026TRCA: Transition-wise Rubric Credit Assignment for Long-horizon LLM Agents
  2. 2026CoCA: Criterion-Aware Credit Assignment for Rubric-Based Reinforcement Learning
  3. 2026CoRT: Counterfactual Replay for Token-Level Rubric-Guided Policy Optimization
  4. 2026CARE: Contrastive Anchor-based Rubric Evolution for Large Language Model Post-Training
  5. 2026Credit Without Ground Truth: Auditing Step-Level Credit Assignment in LLM Agents Against Executed Replay
  6. 2026Inducing Reward-Free Judging Rubrics that Reduce Over-Crediting in Agent Evaluation
  7. 2026From Reasoning to Agentic: Credit Assignment in Reinforcement Learning for Large Language Models
  8. 2026A Survey on Rubric-Guided Reinforcement Learning for Language Models