Skip to content

Counterfactual Shapley Credit Assignment

Jul 2026 · arXiv.org · Vol abs/2607.16999 · 0 citations · 46 references
Computer Science

TL;DR

Counterfactual Shapley Credit Assignment is introduced, a novel framework grounded in causal theory that attributes credit and blame via the Counterfactual Shapley Value ($\phi$-value) to enhance temporal credit assignment across three critical dimensions: sparse causality, high stochasticity, and delayed rewards, all while preserving the optimal policy.

Abstract

The Credit Assignment Problem (CAP) is fundamental to developing efficient and explainable Reinforcement Learning (RL) agents. Existing frameworks, whether relying on temporal contiguity or hindsight-conditioned reward reweighting, frequently fail to attribute properly between an agent's policy (skill) and environmental stochasticity (luck). A principled approach to CAP must isolate the true causal drivers of observed outcomes from spurious correlations and environmental randomness. We introduce Counterfactual Shapley Credit Assignment, a novel framework grounded in causal theory that attributes credit and blame via the Counterfactual Shapley Value ($\phi$-value). By redistributing environmental rewards, $\phi$-values enhance temporal credit assignment across three critical dimensions: sparse causality, high stochasticity, and delayed rewards, all while preserving the optimal policy. We derive a consistent estimator that computes $\phi$-values efficiently, enabling a new class of policy gradient methods, $\phi$-PPO, combined with Prioritized Trajectory Replay (PTR). Empirical results demonstrate that $\phi$-values align precisely to the ground truth causes of task rewards with superior sample efficiency in challenging environments where prior state-of-the-art methods fail to converge.

View source

Similar papers

#machine learning Preprint Oct 2026

Minimax Optimal Regret for Causal Logistic Bandits with Counterfactual Fairness

We study causal logistic bandits with counterfactual fairness constraints. The causal structure is given through known factual and counterfactual feature maps that share an unknown logistic reward parameter, but the learner observes only factual rewards. Consequently, the directions determining counterfactual feasibili...

Junhyuk Huh, Seoungbin Bae, Dabeen Lee · 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
#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
#artificial intelligence Preprint Sep 2026

Coverage, Not Targeting: A Structural Regime in Multi-Turn Agent Credit Assignment

Multi-turn agentic RL increasingly treats credit assignment as a targeting problem: given a terminal verifiable reward, per-turn methods localize credit onto the turns that mattered. We identify the structural quantity that predicts when this is the right move, the verifier information density V_d = k/C (the fraction o...

Chen-Yu Zhou, Qi-Liang Jiang, Shu-Ning Wu et al. · 1 citation
Preprint Sep 2026

Bayesian Confidence Recalibration and Research-Equilibrium Criticality: Temporal Support in Robust Portfolios

Robust portfolio rules that reconstruct confidence sets after learning need not preserve the evaluator obtained by prior-by-prior Bayesian transport. In the Gaussian model, this discrepancy is summarized by natural-coordinate displacement: inherited transport preserves it whereas fresh reconstruction can replace it. We...

Han Yanç · 0 citations
#machine learning Preprint Oct 2026

Rethinking Least-Core Computation in Contextual-Distractor Games

Game-theoretic attribution explains a model by assigning credit to its features or training examples. The least core has attracted interest as an alternative to Shapley-style averaging because it can expose players that cause substantial harm in rare, high-value contexts. However, least-core allocations are generally n...

Hiroshi Kera, Toshinori Yamauchi, Sai Ganesh Nagarajan · 0 citations

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