Skip to content

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

Sep 2026 · 0 citations · 20 references
Computer Science

TL;DR

Credo is proposed, a framework that couples evolving semantic rubrics with selective, execution-based credit correction, and derives 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.

Abstract

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.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

DRACO: Fine-Grained Credit Assignment with Dynamic Rubrics for Long-Horizon Agent Training

This work proposes DRACO: Distributing Rubric-based Advantage for Credit Optimization, which generates rubrics dynamically during training to track the policy's evolving capability, scores those rubrics once per completed trajectory, and redistributes that judgment over the steps responsible for annotated rubrics to pr...

Shubham Gandhi, Saurabh Goyal, K. Kate et al. · 5 citations
#machine learning Preprint Sep 2026

GraphHCA: Closed-Form Hindsight Credit Assignment for Long-Horizon LLM Agents

GraphHCA is proposed, a model-free realization of HCA that eliminates explicit hindsight-distribution estimation and achieves state-of-the-art results on ALFWorld and WebShop at both LLM scales, and on Sokoban with a vision-language agent.

Hao-Dong Zhu, Yang-Yang Ren, Chang-Bai Li et al. · 0 citations
Preprint Aug 2026

TRCA: Transition-wise Rubric Credit Assignment for Long-horizon LLM Agents

Transition-wise Rubric Credit Assignment (TRCA) is proposed, which derives step-level supervision directly from action-induced transitions without learned evaluators or successful anchors for long-horizon tasks with sparse successful anchors.

Huan-Xi Zhang, Ming-Ju Chen, Dongxu Zhou et al. · 7 citations
#machine learning Preprint Oct 2026

TreeHCA: Hindsight-Guided Exploration and Credit Assignment for Multi-Turn LLM Agents

Outcome-supervised group-relative policy optimization (GRPO) assigns the same advantage to every token in an LLM agent trajectory, leaving useful and unhelpful decisions undifferentiated. Hindsight credit assignment (HCA) can refine this feedback, but its estimates rely on trajectories containing informative alternativ...

Debajoy Mukherjee, Jeremy Carleton, Sushil Vemuri et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Semifactual Credit-Augmented Policy Optimization

Reinforcement learning with verifiable rewards (RLVR) has improved the reasoning capabilities of large language models (LLMs), yet their predictions remain sensitive to task-irrelevant prompt features. We investigate this sensitivity through semifactual prompt interventions that preserve the underlying problem and its...

Jun-Shu Pan, Zhi-Zhang Fu, Shu-Lin Huang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

SWE-MILE: Asynchronous Potential-Induced Milestone Credit Assignment for Long-Horizon Software Engineering Agents

SWE-MILE is proposed, an asynchronous potential-induced milestone credit assignment framework that derives fine-grained process supervision from workflow runtime, without auxiliary reward models or external evaluators, and demonstrates substantial improvements in agent performance.

Chao-Qun Cui, Hao Zhou, Mei-Qi Chen et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.