What Effort Level Should I Choose? On the Economics of Reasoning Effort in LLM Agents
Abstract
Reasoning effort in generative models acts as a credence good where higher compute does not guarantee better instance-level results, and an escalation strategy from low effort improves cost-efficiency.
Generative models increasingly expose a reasoning effort setting that lets users scale inference-time compute, trading higher cost for potentially improved performance. Users must choose an effort level before knowing whether extra reasoning will help, and even a successful run does not reveal whether the effort purchased was necessary. Reasoning effort is therefore a credence good: buyers observe the outcome but cannot assess the marginal value of the computation they paid for. In this work, we measure the counterfactual effect of effort levels on both proprietary and open-weight models on four benchmarks, spanning single-call reasoning and long-horizon agentic tasks. Effort, it turns out, does not consistently preserve tasks that lower effort solves, can overspend, and can change trajectory behavior. First, we find that although higher effort can raise accuracy in aggregate, it frequently fails on tasks that lower effort solved. Second, on the subset of easy tasks that every effort level solves, higher effort is generally more costly, with the highest effort level costing up to 42x as much as the lowest. Lastly, effort changes not only how many tokens are used, but also how agents solve tasks: at higher effort, agents verify their own work more heavily and more often search for solutions than work through problems directly, both of which lengthen trajectories without necessarily altering the outcome. These findings show that naively choosing the highest level is not only cost-inefficient but also offers no guarantee of the best instance-level performance. A simple alternative, starting at the lowest effort and escalating only after a verified failure, matches or improves on fixed top effort across all models and benchmarks at lower cost for most proprietary models.
Community
Generative models increasingly expose a reasoning effort setting that lets users scale inference-time compute, trading higher cost for potentially improved performance. Users must choose an effort level before knowing whether extra reasoning will help, and even a successful run does not reveal whether the effort purchased was necessary. Reasoning effort is therefore a credence good: buyers observe the outcome but cannot assess the marginal value of the computation they paid for. In this work, we measure the counterfactual effect of effort levels on both proprietary and open-weight models on four benchmarks, spanning single-call reasoning and long-horizon agentic tasks. Effort, it turns out, does not consistently preserve tasks that lower effort solves, can overspend, and can change trajectory behavior. First, we find that although higher effort can raise accuracy in aggregate, it frequently fails on tasks that lower effort solved. Second, on the subset of easy tasks that every effort level solves, higher effort is generally more costly, with the highest effort level costing up to 42x as much as the lowest. Lastly, effort changes not only how many tokens are used, but also how agents solve tasks: at higher effort, agents verify their own work more heavily and more often search for solutions than work through problems directly, both of which lengthen trajectories without necessarily altering the outcome. These findings show that naively choosing the highest level is not only cost-inefficient but also offers no guarantee of the best instance-level performance. A simple alternative, starting at the lowest effort and escalating only after a verified failure, matches or improves on fixed top effort across all models and benchmarks at lower cost for most proprietary models.
Great to see a task-level audit of reasoning effort that includes open-weight models like Kimi K3 and GLM-5.2, with the code released. The "none" result surprised me most: on the always-solved set, GPT-5.6-luna averages 21.5 model calls at none versus 5.4 at low, so the input-token bill rises from $0.0021 to $0.0258 even without reasoning tokens. Naïve laddering is a really practical takeaway too, for example Kimi K3 on Terminal-Bench going from 73.0% to 84.3% success while cost falls by 30.5%. For self-hosted setups where GPU time matters more than API price, do you expect the same ordering when cost is measured purely as wall-clock, given that waiting time already made up over 80% of the estimated total cost in Figure 6?
Thanks for the comment! Because output sequence length is the major factor affecting the cost of effort level, the same observation likely applies to self-hosted models, too.
This is an automated message from the Librarian Bot. I found the following papers similar to this paper.
The following papers were recommended by the Semantic Scholar API
- StopLoss: Teaching Agents to Predict Failure and Stop Early (2026)
- How Much Can Language Models Gain from Test-Time Computation? (2026)
- Probe-and-Resume: When and How to Evaluate Agent Execution (2026)
- When Faster Decisions Do Not Make Better Agents: An Empirical Study of Jev in Agent Workflows (2026)
- From Token-Max to Outcome-Max: How You Use AI Determines Its Productivity (2026)
- Scaling Inference-Time Compute with Teams of Coding Agents (2026)
- Where Should a Stuck Agent Spend Its Next Tokens? Causal Attribution of Inference-Time Resources (2026)
Please give a thumbs up to this comment if you found it helpful!
If you want recommendations for any Paper on Hugging Face checkout this Space
You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend
Get this paper in your agent:
hf papers read 2610.34491 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Datasets citing this paper 1
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper