aiqbench analysis
CoBRA introduces a counterfactual framework that optimizes the decision boundaries for when large language models should invoke external tools, directly addressing latency and cost issues in tool-augmented systems. By estimating instance-level marginal benefits rather than relying on absolute signals, this method improves efficiency and accuracy for knowledge-intensive queries without sacrificing performance on out-of-distribution tasks.
CoBRA: Learning Tool-Use Boundaries via Counterfactual Margins
arXiv:2609.00967v1 Announce Type: new Abstract: As large language models increasingly act through external tools, deciding when to call a tool has become a central problem alongside deciding how to use it. Unnecessary tool calls introduce latency, cost, retrieval noise, and error propagation, while missed calls hurt knowledge-intensive queries or questions requiring up-to-date evidence. Existing methods typically trigger tools from absolute query or generation signals, such as difficulty, confidence, or final task reward, and therefore lack an explicit estimate of the instance-level marginal benefit of tool use. We propose CoBRA, a counterfactual boundary-learning framework for tool-augmented language models. CoBRA first constructs internal and external experts from the same base model, collects paired trajectories, and estimates the reward margin between answering with and without tools. This margin partitions data into internal-favored, external-favored, and ambiguous cases. CoBRA then uses clear-margin samples for Boundary-Aware Cold-Start SFT, followed by MARS-RL with reference-split rollouts and counterfactual marginal advantages to optimize boundary decisions. Experiments with retrieval as the main tool on Qwen3-4B show that CoBRA improves tool-use efficiency and boundary-sensitive answer accuracy while maintaining strong performance on tool-dependent out-of-distribution questions.
Abstract:As large language models increasingly act through external tools, deciding when to call a tool has become a central problem alongside deciding how to use it. Unnecessary tool calls introduce latency, cost, retrieval noise, and error propagation, while missed calls hurt knowledge-intensive queries or questions requiring up-to-date evidence. Existing methods typically trigger tools from absolute query or generation signals, such as difficulty, confidence, or final task reward, and therefore lack an explicit estimate of the instance-level marginal benefit of tool use. We propose CoBRA, a counterfactual boundary-learning framework for tool-augmented language models. CoBRA first constructs internal and external experts from the same base model, collects paired trajectories, and estimates the reward margin between answering with and without tools. This margin partitions data into internal-favored, external-favored, and ambiguous cases. CoBRA then uses clear-margin samples for Boundary-Aware Cold-Start SFT, followed by MARS-RL with reference-split rollouts and counterfactual marginal advantages to optimize boundary decisions. Experiments with retrieval as the main tool on Qwen3-4B show that CoBRA improves tool-use efficiency and boundary-sensitive answer accuracy while maintaining strong performance on tool-dependent out-of-distribution questions.
Artificial Intelligence (cs.AI)
arXiv:2609.00967 [cs.AI]
(or arXiv:2609.00967v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2609.00967 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 272 words
Related coverage
Re-feeding Is Not Replaying: Measuring Replay Noise in Counterfactual Token-Credit Estimation
arXiv · Jun 17, 2026
Safe Skill Retirement for Physical Agents
arXiv · Sep 25, 2026
Deep Convolutional Large-Margin $\ell_p$-SVDD for Visual Anomaly Detection
arXiv · Jul 27, 2026
A Geometric View of Counterfactual Behavior: Interaction of Boundary Proximity and Local Support
arXiv · Jun 5, 2026