Learning What to Skip: Counterfactual Credit Assignment for Efficient Multi-Agent LLM Workflows
On the map: LLM agents and tool use → Software engineering coding agents
Abstract (arXiv)
Multi-agent LLM workflows use planning, execution, verification, and summarization to improve task performance, yet the value of each component depends on the state already produced. Executing every component can waste computation or overwrite a correct intermediate answer. We formulate component omission as counterfactual credit assignment: full-workflow logs reveal the executed trajectory's reward, while controlled skip interventions reveal the consequences of omitting a future step. We introduce Learning What to Skip (LW2S), which learns action-specific safety models from these interventions and combines held-out calibration with domain-native guards to select skips. When an early skip is rejected, the controller can continue execution and reconsider a later component. Across mathematical reasoning, multiple-choice QA, and code generation with two instruction-model families, LW2S reduces recorded token cost while matching or improving aggregate full-workflow accuracy in the evaluated settings. Scale-up and second-topology experiments further examine component redundancy, while shared-error cases reveal why agreement alone is insufficient for skip selection. These findings connect efficient workflow execution to learning the conditional utility of individual components.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Software engineering coding agents, one of 16 directions in LLM agents and tool use. Builds on 14 of its 16 references that are in the map. First posted on arXiv 25 Sep 2026.
Builds on
14 of 16 references.
Closest ancestors · 1
Same direction, newest first
Other references · 13
- 2023Improving Factuality and Reasoning in Language Models through Multiagent Debatecited by 1,739
- 2017Selective Classification for Deep Neural Networkscited by 799
- 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
- 2024Mixture-of-Agents Enhances Large Language Model Capabilitiescited by 420
- 2019SelectiveNet: A Deep Neural Network with an Integrated Reject Optioncited by 333
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 322
- 2023AutoMix: Automatically Mixing Language Modelscited by 116
- 2025MasRouter: Learning to Route LLMs for Multi-Agent Systemscited by 80
- 2026GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMscited by 10
- 2025Stochastic Self-Organization in Multi-Agent Systemscited by 9
- 2026Exact Is Easier: Credit Assignment for Cooperative LLM Agentscited by 9
- 2025Scoring Verifiers: Evaluating Synthetic Verification for Code and Reasoningcited by 8
1 more
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Learning to Compose for Cross-domain Agentic Workflow Generation
- 2026Control-Data Flow Separation: Stable Prompt Optimization in Multi-Agent LLMs
- 2026PROTEA: Offline Evaluation and Iterative Refinement for Multi-Agent LLM Workflows
- 2026LHAW: Controllable Underspecification for Long-Horizon Tasks
- 2026VETTA: Coordinating Turn- and Token-Level Credit Assignment for Multi-Turn LLM Agents
- 2026From Static Templates to Dynamic Runtime Graphs: A Survey of Workflow Optimization for LLM Agents
- 2026Unifying Temporal and Structural Credit Assignment in LLM-Based Multi-Agent Prompt Optimization
- 2025Lessons Learned: A Multi-Agent Framework for Code LLMs to Learn and Improve