pith. sign in

arxiv: 2603.21563 · v2 · pith:5NOE7AYJnew · submitted 2026-03-23 · 💻 cs.AI

Counterfactual Credit Policy Optimization for Multi-Agent Collaboration

classification 💻 cs.AI
keywords creditccpoassignmentcounterfactualoutcomereasoningagentcollaborative
0
0 comments X
read the original abstract

Collaborative multi-agent large language models (LLMs) can solve complex reasoning tasks by decomposing roles, but reinforcement learning for such systems is limited by credit assignment: shared terminal rewards obscure individual contributions and can encourage free-riding. We introduce Collaborative Credit Policy Optimization (CCPO), an optimizer-agnostic credit assignment layer that converts team-level outcomes into agent-specific learning signals. CCPO provides two complementary allocators. Counterfactual credit estimates an agent's marginal contribution by comparing the realized team outcome with a counterfactual outcome where that agent is removed. Verifier-anchored LLM self-evaluation is an exploratory allocator that uses constrained self- and peer-evaluations to redistribute credit while keeping the external verifier outcome dominant. The resulting role-specific rewards can be consumed by GRPO-style updates or other policy-gradient optimizers such as GSPO and REINFORCE++. We instantiate CCPO in a sequential Think--Solve setting and evaluate it on mathematical reasoning benchmarks. Results show that explicit credit assignment often improves dual-agent reasoning, especially on MATH500 and several out-of-distribution settings, while gains vary across models and datasets. Our code is available at https://github.com/bhai114/ccpo.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. COSAC: Counterfactual Credit Assignment in Sequential Cooperative Teams

    cs.LG 2026-04 unverdicted novelty 7.0

    CAPO derives a critic-free policy gradient method for sequential cooperative agents by extending aristocrat utility to compute closed-form per-agent advantages after fitting a group reward decomposition.

  2. COSAC: Counterfactual Credit Assignment in Sequential Cooperative Teams

    cs.LG 2026-04 unverdicted novelty 6.0

    COSAC enables scalable per-agent policy gradients in sequential cooperative teams via ridge regression on additive reward decomposition and counterfactual advantages from fictitious policy continuations, extending ari...

  3. Policy Improvement Reinforcement Learning

    cs.LG 2026-04 unverdicted novelty 6.0

    PIRL maximizes cumulative policy improvement across iterations instead of surrogate rewards and is proven aligned with final performance; PIPO implements it via retrospective verification for stable closed-loop optimization.