NTH

What Effort Level Should I Choose? On the Economics of Reasoning Effort in LLM Agents

AuthorsKaiser Sun, Yongchan Kwon, Zain Hasan, Shang Zhu, Kaitlyn Zhou, Federico Bianchi

AffiliationsJohns Hopkins University · Together AI · Cornell University

November 4, 2026 3 min read
Watch on YouTube
The one-line take

More reasoning effort can cost much more without reliably improving an LLM agent’s result, so escalating only after verified failure may be a better strategy.

Key results

42
Maximum relative cost on always-solved tasks

Highest effort cost up to 42 times the lowest-effort setting.

25.3%
AIME 2026 laddering median cost savings

Savings versus fixed highest effort across models.

41.5%
GPQA Diamond laddering median cost savings

Savings versus fixed highest effort across models.

15.5%
Corrected SWE-Bench Pro laddering median cost savings

Savings versus fixed highest effort across models.

What the paper found

This study tests whether choosing a higher reasoning-effort setting reliably improves LLM agents enough to justify its cost. Across AIME 2026, GPQA Diamond, Terminal-Bench 2.1, and SWE-Bench Pro, it evaluates eight models, including OpenAI’s GPT-5.6 variants, Anthropic’s Claude Sonnet 5, and DeepSeek V4 Flash. Higher effort can raise aggregate accuracy, but it does not reliably preserve tasks solved at lower effort; on tasks every setting solves, the most expensive setting can cost up to 42 times the least expensive. The researchers also find that effort changes agent behavior: models may spend more time verifying work or searching for existing fixes, producing longer trajectories without necessarily improving the result. A practical alternative is “naïve laddering”: start at the lowest effort, then retry at the highest only after an external correctness check finds a failure. This matches or improves success over fixed maximum effort, with median cost savings of 25.3% on AIME 2026, 41.5% on GPQA Diamond, and 15.5% on corrected SWE-Bench Pro. The takeaway is that more reasoning is not a dependable default; allocating effort after observing a failure can preserve lower-effort successes while avoiding unnecessary high-effort runs.

Original abstract

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.

Read the original paper

More in AI Agents

Browse all 71 papers →
02Agent

ToolSpace: Scaling Tool-Centric Environment Synthesis for Long-Horizon Agents

Guanting Dong, Zhichao Sun, Xinyu Yang, Rui Wang, Xin Deng, Jiajie Jin, Zhixiong Yang, Junhao Huang, Han Han, Mingyu Ma, Xiaotao Wang, Yuyang Hu, Xiaoshuai Song, Xiaoxi Li, Jiejun Tan, Zhecan Wang, Shihan Dou, Honglin Guo, Zhiheng Xi, Tao Gui, Tao Ji, Qi Zhang, Yutao Zhu, Ji-Rong Wen, Zhicheng Dou

ToolSpace builds tougher, more realistic tool-use environments from real execution traces to train and evaluate long-horizon AI agents.

Read analysis