CANTANTE: Optimizing Agentic Systems via Contrastive Credit Attribution [R]
Summary
CANTANTE introduces a contrastive credit attribution method to optimize multi-agent LLM systems by decomposing global rewards into per-agent signals, enabling automated prompt tuning. It outperforms baselines on programming, math, and retrieval benchmarks, achieving up to +18.9 points improvement without increased inference cost.
Similar Articles
Solving the Credit Assignment Problem in Multi-Agent Systems (CANTANTE Framework)
CANTANTE is an open-source framework that solves the credit assignment problem in multi-agent systems by converting system-level rewards into per-agent update signals, outperforming DSPy-based baselines on coding and math reasoning benchmarks.
TACO: Tool-Augmented Credit Optimization for Agentic Tool Use
TACO introduces a novel credit optimization method for code-tool agents that uses a differential reward probe and outcome-gated advantage routing to distinguish useful from redundant or misleading tool calls, improving multimodal agent performance.
Reducing Credit Assignment Variance via Counterfactual Reasoning Paths
Introduces Implicit Behavior Policy Optimization (IBPO), a counterfactual comparison-based credit assignment framework that improves training stability and performance in multi-step reasoning tasks for large language models by converting sparse terminal rewards into step-sensitive learning signals.
@SharonYixuanLi: Scaling outcome-based RL won't solve long-horizon agentic tasks. Credit assignment is the bottleneck, and turn-level re…
TRACE introduces a turn-level reward assignment method using frozen reference model log-probabilities and temporal-difference learning to address credit assignment in long-horizon agentic tasks, achieving significant improvements in search benchmarks without critic or process labels.
ACPO: Adaptive Credit Policy Optimization via Fine-Grained Surrogate Entropy
Introduces ACPO, a token-level credit assignment framework for reinforcement learning in LLMs that uses fine-grained surrogate entropy to improve reasoning performance on math and coding benchmarks, outperforming strong baselines like DAPO, GTPO, and SAPO.