Don't Overthink, Don't Underthink: Toward Adaptive Reasoning in Agentic AI
Summary
The paper proposes adaptive reasoning in agentic AI systems to dynamically allocate computational effort based on task demands, avoiding over-reasoning and under-reasoning through evaluation on MATH-500 and GAIA benchmarks.
View Cached Full Text
Cached at: 08/28/26, 09:35 AM
# Toward Adaptive Reasoning in Agentic AI
Source: [https://arxiv.org/html/2608.26442](https://arxiv.org/html/2608.26442)
## Don’t Overthink, Don’t Underthink: Toward Adaptive Reasoning in Agentic AI
Md Jueal Mia and M\. Hadi Aminiemail:[\{mmia001, moamini\}@fiu\.edu](mailto:{mmia001,%20moamini}@fiu.edu)Affiliation:Knight Foundation School of Computing and Information Sciences, Security, Optimization, and Learning for InterDependent Networks Laboratory \(solid lab\) Florida International University,Miami,Florida,USA
###### Abstract\.
Recent advances in Large Language Models \(LLMs\) have shown that increased inference\-time reasoning can improve performance on complex tasks\. However, many existing approaches rely on fixed or preallocated reasoning controls, such as fixed token budgets, pre\-execution difficulty estimates, or activation\-space interventions, and are often evaluated on standalone reasoning benchmarks rather than full agentic workflows\. These assumptions may not hold in agentic AI systems, where reasoning requirements evolve dynamically through planning, tool use, memory retrieval, and agent\-to\-agent interactions\. Consequently, reasoning can become either excessive or insufficient, resulting in unnecessary computation, increased latency, planning drift, excessive tool use, or incomplete solutions\. We argue that a major challenge for next\-generation agentic AI is not merely how much reasoning a language model should perform, but how it should allocate reasoning according to evolving task demands\. We characterize over\-reasoning and under\-reasoning as recurring failure modes of misallocated reasoning and evaluate them on MATH\-500 and the GAIA public validation benchmark\. Using tool\-decision latency, token consumption, token\-limit exhaustion, and answer correctness, our results suggest that cases classified as over\-reasoning are associated with higher computational cost without proportional accuracy gains, whereas cases classified as under\-reasoning are consistently associated with incorrect or incomplete solutions\. These findings motivate future research on adaptive reasoning mechanisms for agentic AI\.
###### Keywords:
agentic AI, adaptive reasoning, over\-reasoning, under\-reasoning, reasoning efficiency
## 1\.Introduction
Recent advancements in LLMs have significantly enhanced their reasoning capabilities, enabling them to solve complex problems through step\-by\-step deliberation\. This progress has led to the emergence of a class of models known as Large Reasoning Models \(LRMs\), which are typically developed through supervised fine\-tuning \(SFT\) and reinforcement learning from human feedback \(RLHF\)\. By generating chain\-of\-thought \(CoT\) reasoning traces, LRMs can perform sophisticated tasks involving logical deduction, mathematical reasoning, planning, and decision\-making\([Sui et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib1)\)\. As a result, these models have demonstrated strong performance across a wide range of challenging benchmarks\. These advances build upon a series of foundational developments, including Chain\-of\-Thought prompting for explicit reasoning\([Wei et al\., 2022](https://arxiv.org/html/2608.26442#bib.bib14)\), reasoning\-and\-acting frameworks such as ReAct\([Yao et al\., 2022](https://arxiv.org/html/2608.26442#bib.bib15)\)and the emergence of dedicated reasoning models including OpenAI o1\([OpenAI, 2024](https://arxiv.org/html/2608.26442#bib.bib16)\)and Phi\-4\-reasoning\([Abdin et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib20)\)\.
Despite these improvements, explicit reasoning introduces substantial computational overhead during inference by increasing latency and token consumption, leading to higher inference costs\. Recent surveys identify efficient inference as a key challenge for next\-generation language models, emphasizing the need for mechanisms that better allocate computational resources during inference\([Amini et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib17)\)\. Although extensive reasoning is often beneficial for complex tasks, it is frequently unnecessary for simpler queries, and existing LRMs often allocate reasoning inefficiently by over\-computing on easy problems while under\-reasoning on more difficult ones, creating a trade\-off between reasoning quality and computational efficiency\([Aggarwal et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib2)\)\. This challenge becomes even more pronounced in agentic AI systems, where one or more LLMs coordinate planning, tool use, memory retrieval, environment interaction, and multi\-step decision making\([Sapkota et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib3)\)\. In such systems, specialized components \(e\.g\., planners and response generators\) may independently invoke LLMs and perform their own reasoning processes, causing unnecessary reasoning at individual components to accumulate across the pipeline and significantly increase overall latency, token usage, and computational cost\.
Figure 1\.Overview of over\-reasoning and under\-reasoning in agentic AI\. The agent loop is annotated with four failure modes: redundant reasoning, weak reasoning, repeated tool usage, and no tool usage \(skipped tool calls\)\.As inference\-time computation becomes a important factor in the deployment of modern AI systems, understanding how to dynamically adapt reasoning effort to the complexity of a given task has emerged as an important research challenge\. Developing mechanisms that allocate reasoning resources more efficiently can reduce unnecessary computational costs while maintaining, or even improving, overall task performance\. This challenge is particularly important for agentic AI systems, where reasoning efficiency directly impacts scalability, responsiveness, and real\-world usability\. Figure[1](https://arxiv.org/html/2608.26442#S1.F1)illustrates the major challenges that arise from mis\-allocated reasoning that motivate this work\. The main contributions of our work are listed below\.
- •We investigate the impact of over\-reasoning and under\-reasoning in agentic AI, showing how reasoning effort that is either excessive or insufficient relative to task requirements is associated with higher inference cost or degraded task performance\.
- •We present a quantitative analysis of reasoning allocation in a LangGraph\-based agentic AI framework using representative reasoning models on MATH\-500 and GAIA\. Our results reveal that current reasoning models frequently exhibit over\-reasoning or under\-reasoning, resulting in inefficient reasoning allocation for agentic AI\.
- •Based on our findings, we identify key research challenges and outline candidate evaluation dimensions and future directions for adaptive reasoning mechanisms that dynamically determine when to reason, when to act, and when to stop\.
## 2\.Related Works
Recent studies have explored the growing role of reasoning in agentic AI systems\. Wu et al\.\([Wu et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib4)\)demonstrated that integrating search, coding, and memory agents can enhance complex reasoning capabilities \. As agentic reasoning becomes increasingly sophisticated, researchers have begun examining its efficiency implications\. Kim et al\.\([Kim et al\., 2026](https://arxiv.org/html/2608.26442#bib.bib5)\)showed that deeper reasoning and test\-time scaling introduce substantial computational and infrastructure costs\. Similarly, Tran et al\.\([Tran and Kiela, 2026](https://arxiv.org/html/2608.26442#bib.bib6)\)found that increasing reasoning and coordination does not always improve performance, with single\-agent systems often outperforming multi\-agent architectures under equal compute budgets\. Wang et al\.\([Wang et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib7)\)showed that increasing reasoning budgets, adding more planning steps, and employing complex memory mechanisms often result in only marginal performance improvements while significantly increasing computational cost, while Becker et al\.\([Becker et al\., 2026](https://arxiv.org/html/2608.26442#bib.bib8)\)revealed that prolonged agent interactions can cause discussions to drift away from task objectives, leading to performance degradation\. Collectively, these findings suggest that increasing reasoning effort, agent interactions, and test\-time computation does not necessarily translate into better agent performance and may instead introduce inefficiencies such as overthinking, planning drift, and coordination overhead\.
Despite this progress, many existing approaches still rely on fixed reasoning budgets or evaluate adaptive reasoning outside full agentic workflows\. These assumptions may not hold in agentic AI, where reasoning requirements evolve dynamically through interactions with tools, memory, and external environments\. As a result, agents must determine when to continue reasoning, invoke tools, or act, while additional deliberation may amplify noisy observations rather than improve decisions\. Moreover, prior work has shown that prolonged reasoning and replanning can lead to planning drift, where agents gradually deviate from the user’s objective, although planning drift is not directly measured in this study\. These observations raise a key question: when does additional reasoning improve agent performance, and when does it become counterproductive? Answering this question is essential for developing agentic AI systems that allocate reasoning efficiently while maintaining alignment with task objectives\.
## 3\.Preliminaries
### 3\.1\.Agentic AI Systems
Agentic AI represents a shift from traditional AI systems toward autonomous, goal\-oriented systems capable of operating in dynamic environments with minimal human intervention\([Acharya et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib10)\)\. Unlike conventional AI, which is typically designed for predefined tasks, agentic AI can adapt to changing conditions, make decisions based on contextual information, and pursue complex objectives over extended periods\([Hosseini and Seilani, 2025](https://arxiv.org/html/2608.26442#bib.bib9)\)\. Recent surveys further characterize agentic AI as an evolution beyond single\-agent architectures, emphasizing multi\-agent collaboration, dynamic task decomposition, persistent memory, and coordinated autonomy to accomplish complex goals across diverse application domains\([Sapkota et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib3)\)\. These capabilities enable agentic systems to move beyond simple automation toward autonomous problem solving, adaptive decision\-making, and collaborative task execution in real\-world environments\.
### 3\.2\.Under\-Reasoning, Adequate Reasoning, and Over\-Reasoning
Recent advances in reasoning models show that increasing reasoning effort does not always improve performance\. Models may allocate reasoning inefficiently, producing unnecessarily long reasoning traces for simple problems while failing to devote sufficient reasoning to more challenging ones, and answer correctness often exhibits a non\-linear relationship with reasoning length\([Su et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib12)\)\. In agentic settings, stronger reasoning improves planning\-oriented tasks but incurs substantially higher computational costs and reasoning overhead\([Zhou et al\., 2025](https://arxiv.org/html/2608.26442#bib.bib11)\)\. Moreover, excessive test\-time reasoning yields diminishing returns and may even cause models to abandon previously correct answers, highlighting the risks of overthinking during inference\([Zhou et al\., 2026](https://arxiv.org/html/2608.26442#bib.bib13)\)\. These findings suggest that agentic systems should adapt reasoning effort to task complexity rather than relying on uniformly long reasoning processes\.
Conceptually, we distinguish three reasoning regimes\.*Under\-reasoning*occurs when an agent allocates insufficient reasoning, evidence gathering, or verification for the task, such as omitting intermediate reasoning steps, failing to gather sufficient evidence, or terminating prematurely\.*Over\-reasoning*occurs when an agent continues reasoning beyond what is necessary, exhibiting redundant deliberation, repeated verification, or unnecessary reasoning that increases computational cost\. Between these extremes lies*adequate reasoning*, where reasoning effort is sufficient for the task without exhibiting either under\-reasoning or over\-reasoning\.
## 4\.Preliminary Study: Evidence of Misallocated Reasoning
### 4\.1\.Experimental Setup
Experiments were conducted on a server with two NVIDIA RTX A6000 GPUs \(48,GB VRAM each\)\. Our LangGraph\-based agentic AI framework was served through vLLM\-compatible APIs using Qwen3\.5\-4B as the router,111Hugging Face identifier:Qwen/Qwen3\.5\-4B\.while the final\-response models were Qwen3\.5\-4B, Llama\-3\.1\-8B\-Instruct,222Hugging Face identifier:meta\-llama/Llama\-3\.1\-8B\-Instruct\.and Phi\-4\-reasoning\.333Hugging Face identifier:microsoft/Phi\-4\-reasoning\.The Qwen3\.5\-4B configuration used the same model for both router and final response\. Each model was evaluated on all 500 MATH\-500 test problems\([Team, 2024](https://arxiv.org/html/2608.26442#bib.bib19)\)and 165 GAIA validation tasks\([Mialon et al\., 2024](https://arxiv.org/html/2608.26442#bib.bib18)\)using deterministic decoding \(temperature=0\.0=0\.0\) with a maximum generation length of 4,096 tokens\. We recorded tool usage, latency, token consumption, token\-limit hits, and complete interaction traces\. For reasoning models, reasoning tokens were computed from tokens enclosed by<think\>and</think\>; since Llama\-3\.1\-8B\-Instruct does not expose reasoning traces, this metric is reported asN/A\. Finally, GPT\-4\.1 independently classified each trajectory as*over\-reasoning*,*under\-reasoning*, or*adequate reasoning*, while final answers were labeled as*correct*,*incorrect*, or*incomplete*, with reasoning labels assigned independently of answer correctness\.
## 5\.Findings
Table 1\.Average runtime and reasoning statistics in agentic AI across MATH\-500 and GAIA\. Tool agent model: Qwen3\.5\-4B\.Table 2\.Reasoning efficiency and answer quality in agentic AI across MATH\-500 and GAIA\. Tool agent model: Qwen3\.5\-4B\. Judge model: GPT\-4\.1\. Hit Accuracy denotes accuracy on samples where the final model reached the maximum output token limit, while No\-Hit Accuracy denotes accuracy on samples that did not reach the maximum output token limit\.Analysis of Tables[1](https://arxiv.org/html/2608.26442#S5.T1)and[2](https://arxiv.org/html/2608.26442#S5.T2)suggests that both over\-reasoning and under\-reasoning emerge as recurring failure modes in the evaluated LangGraph\-based agent across reasoning\-intensive \(MATH\-500\) and real\-world multi\-step \(GAIA\) tasks\. Rather than consistently allocating reasoning effort according to task requirements, the evaluated agent frequently allocates either excessive or insufficient reasoning, resulting in increased computational cost or degraded task performance\.
The first major issue isover\-reasoning\. On MATH\-500, Phi\-4\-reasoning exhibits the highest over\-reasoning rate \(89\.40%\), followed by Qwen3\.5\-4B \(68\.00%\) and Llama\-3\.1\-8B\-Instruct \(19\.80%\)\. It also generates the most reasoning tokens \(2220\.12\), the longest outputs \(4046\.59 tokens\), and the highest final inference time \(180\.80 s\), compared with Qwen3\.5\-4B \(1732\.39 reasoning tokens, 2461\.67 output tokens, 70\.21 s\) and Llama\-3\.1\-8B\-Instruct \(904\.48 output tokens, 21\.42 s\)\. Although Phi\-4\-reasoning achieves the highest accuracy \(92\.40%\), it reaches the maximum token limit in 482 of 500 samples, compared with 190 and 71 for Qwen3\.5\-4B and Llama\-3\.1\-8B\-Instruct, respectively\. A similar trend is observed on GAIA, where Phi\-4\-reasoning again produces the longest reasoning traces \(2897\.95 reasoning tokens, 4091\.12 output tokens, 182\.94 s\)\. Since Llama\-3\.1\-8B\-Instruct does not expose explicit reasoning traces, its reasoning\-token count is reported asN/A\. Overall, increasing explicit reasoning substantially increases inference cost\.
The second major issue is thatover\-reasoning does not necessarily translate into proportional performance gains\. On MATH\-500, Phi\-4\-reasoning improves accuracy over Qwen3\.5\-4B \(92\.40% vs\. 87\.60%\) but nearly triples final inference time \(180\.80 s vs\. 70\.21 s\), increases output length \(4046\.59 vs\. 2461\.67 tokens\), and more than doubles token\-limit hits \(482 vs\. 190\)\. On GAIA, despite producing much longer reasoning traces and requiring almost three times longer inference than Qwen3\.5\-4B \(182\.94 s vs\. 67\.49 s\), Phi\-4\-reasoning achieves slightly lower accuracy \(11\.52% vs\. 12\.12%\)\. These observations indicate that substantially increasing reasoning effort does not necessarily yield proportional performance improvements\.
The third major issue isunder\-reasoning\. On MATH\-500, Llama\-3\.1\-8B\-Instruct exhibits the highest under\-reasoning rate \(22\.00%\), followed by Qwen3\.5\-4B \(8\.00%\) and Phi\-4\-reasoning \(4\.80%\), resulting in 64, 48, and 33 incomplete responses, respectively\. On GAIA, under\-reasoning increases to 71\.52% for Llama\-3\.1\-8B\-Instruct, 62\.42% for Phi\-4\-reasoning, and 36\.97% for Qwen3\.5\-4B, corresponding to 56, 130, and 66 incomplete responses\. Although reasoning categories are assigned independently of correctness, all under\-reasoning cases were associated with incorrect or incomplete answers, suggesting that reasoning often terminates before collecting sufficient evidence or adequately verifying conclusions\.
The fourth major issue istoken budget exhaustion\. On MATH\-500, Phi\-4\-reasoning reaches the maximum output token limit in 482 of 500 samples \(96\.40%\), substantially exceeding Qwen3\.5\-4B \(190; 38\.00%\) and Llama\-3\.1\-8B\-Instruct \(71; 14\.20%\)\. Despite this, its hit accuracy remains high \(92\.12%\), indicating that many responses are already correct before reaching the limit\. On GAIA, Phi\-4\-reasoning again records the most token\-limit hits \(164 of 165\), compared with 75 and 10 for Qwen3\.5\-4B and Llama\-3\.1\-8B\-Instruct, while hit accuracy remains low for both reasoning models \(11\.59% and 13\.33%\), suggesting that exhausting the token budget does not substantially improve performance on complex tasks\.
The fifth major issue istask\-dependent reasoning and tool\-use allocation\. On MATH\-500, the agent averages 0\.39 tool calls per sample, consuming approximately 583 tool\-input tokens and 1225 tool\-output tokens despite external information rarely being required\. In contrast, GAIA averages 0\.93 tool calls per sample because external information and multi\-step interactions are frequently necessary\. Nevertheless, despite greater tool use, the highest GAIA accuracy remains only 12\.12%, suggesting that increasing reasoning length and tool interactions alone is insufficient to substantially improve task performance\. Overall, the evaluated LangGraph\-based agent does not consistently allocate reasoning effort or tool use efficiently across different task types\.
## 6\.Discussion and Future Directions
Our findings show that reasoning efficiency remains a key challenge for both current LRMs and agentic AI systems\. On simpler reasoning tasks, reasoning models can improve accuracy but often incur substantially higher latency, token consumption, and token\-budget exhaustion\. On more complex agentic tasks, additional reasoning greatly increases computational cost without corresponding accuracy gains, while insufficient reasoning often results in incorrect or incomplete solutions\. These challenges become more pronounced in agentic AI, where reasoning is intertwined with planning, tool use, memory retrieval, and multi\-step decision making\. Together, these observations motivate four key research challenges:1Unknown Reasoning Sufficiency, where agents cannot determine when enough reasoning has been performed and should stop, leading to unnecessary computation;2Over\-Reasoning and Planning Drift, where excessive reasoning increases computational cost and may introduce redundant deliberation, planning drift, or incorrect intermediate reasoning without improving answer quality;3Under\-Reasoning and Premature Decisions, where agents fail to recognize when additional reasoning, evidence gathering, or verification is required before producing a final response; and4Dynamic Reasoning and Tool Allocation, where reasoning requirements evolve throughout execution as new observations are obtained from tools, memory, or the environment, requiring adaptive mechanisms that jointly allocate reasoning effort, tool usage, and token budgets according to task complexity while avoiding both over\- and under\-reasoning\.
Future research should focus on adaptive reasoning mechanisms that dynamically determine when to reason, act, and stop by balancing reasoning cost, uncertainty, task complexity, and the expected benefit of additional computation\.
#### A Candidate Adaptive\-Reasoning Controller\.
One promising direction is the development of an adaptive\-reasoning controller that dynamically allocates reasoning effort throughout an agent’s execution\. Rather than relying on fixed reasoning budgets, the controller would determine whether to continue reasoning, invoke external tools, or produce a final answer based on the current reasoning state, task requirements, and the expected benefit of additional computation\. Such a controller could balance reasoning quality against computational cost, enabling agents to allocate reasoning only when it is likely to improve task performance\.
#### A Measurable Evaluation Suite\.
More broadly, reasoning\-efficient agentic AI will require new benchmarks, evaluation metrics, and control mechanisms that explicitly measure and optimize reasoning allocation rather than simply increasing reasoning effort\. Progress toward adaptive reasoning therefore requires evaluation beyond task accuracy alone\. Future work could consider an evaluation suite that measures how effectively reasoning effort is allocated, including reasoning efficiency \(accuracy per reasoning token\), stopping behavior, unnecessary tool usage, planning drift, and computational cost\. Such metrics could enable systematic evaluation of reasoning allocation strategies and reveal trade\-offs that are not captured by answer accuracy alone\.
## 7\.Conclusion
In this paper, we investigated reasoning efficiency in agentic AI and identified over\-reasoning and under\-reasoning as recurring failure modes of reasoning allocation\. Our findings suggest that cases classified as over\-reasoning are associated with higher latency, greater token consumption, more frequent tool usage, and increased token\-limit exhaustion without proportional improvements in task performance, whereas cases classified as under\-reasoning are consistently associated with incorrect or incomplete solutions under our evaluation rubric\. Although MATH\-500 and GAIA exhibit different dominant failure modes, both benchmarks indicate that the evaluated agent configuration does not always allocate reasoning effort and tool usage according to task requirements\. These findings suggest that the goal of future agentic AI systems should not be to maximize reasoning effort, but to allocate reasoning adaptively according to evolving task demands\. We hope this work motivates future research on adaptive reasoning mechanisms that dynamically determine when to reason, when to act, and when to stop\.
## 8\.Limitations
This work presents a preliminary empirical study of reasoning allocation in a LangGraph\-based agentic AI framework using a fixed Qwen3\.5\-4B tool\-routing model and three final\-response models\. Consequently, our findings should not be generalized to all agentic architectures, routing strategies, or foundation models\. Although reasoning regimes are independently classified from answer correctness, our analysis does not explicitly distinguish tool\-routing failures, retrieval failures, reasoning failures, response synthesis errors, or formatting errors, all of which may contribute to incorrect predictions\. We evaluate inference cost using latency, token consumption, tool usage, and token\-limit hits, but do not measure monetary cost, GPU utilization, energy consumption, or throughput\. Furthermore, our experiments use a fixed maximum generation length of 4,096 tokens and do not include token\-budget ablations, no\-tool baselines, or standalone LLM baselines\. Finally, we report average statistics only; future work should incorporate confidence intervals, distributional analyses, qualitative trace studies, and broader evaluations across additional agentic frameworks, models, and tasks\.
## Ethics and Reproducibility Statement
This work investigates the reasoning challenges that emerge when LLMs are integrated into agentic AI systems\. Our analysis identifies over\-reasoning and under\-reasoning as recurring failure modes that can increase computational cost or degrade task performance, motivating future research on more adaptive reasoning mechanisms\. To support reproducibility, we will release the complete source code for our LangGraph\-based framework, experimental configurations, prompts \(including the GPT\-4\.1 judge prompt and reasoning\-classification rubric\), tool definitions, and per\-sample evaluation outputs\.
## Acknowledgement
This work is partly based upon the work supported by the National Center for Transportation Cybersecurity and Resiliency \(TraCR\) \(a U\.S\. Department of Transportation National University Transportation Center\) headquartered at Clemson University, Clemson, South Carolina, USA\. Any opinions, findings, conclusions, and recommendations expressed in this material are those of the author\(s\) and do not necessarily reflect the views of TraCR, and the U\.S\. Government assumes no liability for the contents or use thereof\.
This research is also supported by the National Artificial Intelligence Research Resource \(NAIRR\) Pilot and AWS through the CloudBank project, which is supported by National Science Foundation grant\#1925001\. Any opinions, findings, conclusions, and recommendations expressed in this material are those of the author\(s\) and do not necessarily reflect the views of NAIRR, and the U\.S\. Government assumes no liability for the contents or use thereof\.
## References
- M\. Abdin, S\. Agarwal, A\. Awadallah, V\. Balachandran, H\. Behl, L\. Chen, G\. de Rosa, S\. Gunasekar, M\. Javaheripi, N\. Joshi,et al\.Phi\-4\-reasoning technical report\.arXiv preprint arXiv:2504\.21318\.Cited by:[§1](https://arxiv.org/html/2608.26442#S1.p1.1)\.
- Acharyaet al\.\(2025\)D\. B\. Acharya, K\. Kuppan, and B\. DivyaAgentic ai: autonomous intelligence for complex goals—a comprehensive survey\.IEEe Access13,pp\. 18912–18936\.Cited by:[§3\.1](https://arxiv.org/html/2608.26442#S3.SS1.p1.1)\.
- Aggarwalet al\.\(2025\)P\. Aggarwal, S\. Kim, J\. Lanchantin, S\. Welleck, J\. Weston, I\. Kulikov, and S\. SahaOptimalthinkingbench: evaluating over and underthinking in llms\.arXiv preprint arXiv:2508\.13141\.Cited by:[§1](https://arxiv.org/html/2608.26442#S1.p2.1)\.
- Aminiet al\.\(2025\)H\. Amini, M\. J\. Mia, Y\. Saadati, A\. Imteaj, S\. Nabavirazavi, U\. Thakker, M\. Z\. Hossain, A\. A\. Fime, and S\. IyengarDistributed llms and multimodal large language models: a survey on advances, challenges, and future directions\.arXiv preprint arXiv:2503\.16585\.Cited by:[§1](https://arxiv.org/html/2608.26442#S1.p2.1)\.
- Beckeret al\.\(2026\)J\. Becker, L\. B\. Kaesberg, A\. Stephan, J\. P\. Wahle, T\. Ruas, and B\. GippStay focused: problem drift in multi\-agent debate\.InFindings of the Association for Computational Linguistics: EACL 2026,pp\. 5068–5102\.Cited by:[§2](https://arxiv.org/html/2608.26442#S2.p1.1)\.
- Hosseini and Seilani \(2025\)S\. Hosseini and H\. SeilaniThe role of agentic ai in shaping a smart future: a systematic review\.Array26,pp\. 100399\.Cited by:[§3\.1](https://arxiv.org/html/2608.26442#S3.SS1.p1.1)\.
- Kimet al\.\(2026\)J\. Kim, B\. Shin, J\. Chung, and M\. RhuThe cost of dynamic reasoning: demystifying ai agents and test\-time scaling from an ai infrastructure perspective\.In2026 IEEE International Symposium on High Performance Computer Architecture \(HPCA\),pp\. 1–16\.Cited by:[§2](https://arxiv.org/html/2608.26442#S2.p1.1)\.
- Mialonet al\.\(2024\)G\. Mialon, C\. Fourrier, T\. Wolf, Y\. LeCun, and T\. ScialomGaia: a benchmark for general ai assistants\.InInternational Conference on Learning Representations,Vol\.2024,pp\. 9025–9049\.Cited by:[§4\.1](https://arxiv.org/html/2608.26442#S4.SS1.p1.1)\.
- OpenAI \(2024\)OpenAILearning to reason with llms\.Technical reportOpenAI\.External Links:[Link](https://openai.com/index/learning-to-reason-with-llms/)Cited by:[§1](https://arxiv.org/html/2608.26442#S1.p1.1)\.
- Sapkotaet al\.\(2025\)R\. Sapkota, K\. I\. Roumeliotis, and M\. KarkeeAi agents vs\. agentic ai: a conceptual taxonomy, applications and challenges\.Information Fusion,pp\. 103599\.Cited by:[§1](https://arxiv.org/html/2608.26442#S1.p2.1),[§3\.1](https://arxiv.org/html/2608.26442#S3.SS1.p1.1)\.
- Suet al\.\(2025\)J\. Su, J\. Healey, P\. Nakov, and C\. CardieBetween underthinking and overthinking: an empirical study of reasoning length and correctness in llms\.arXiv preprint arXiv:2505\.00127\.Cited by:[§3\.2](https://arxiv.org/html/2608.26442#S3.SS2.p1.1)\.
- Suiet al\.\(2025\)Y\. Sui, Y\. Chuang, G\. Wang, J\. Zhang, T\. Zhang, J\. Yuan, H\. Liu, A\. Wen, S\. Zhong, N\. Zou,et al\.Stop overthinking: a survey on efficient reasoning for large language models\.arXiv preprint arXiv:2503\.16419\.Cited by:[§1](https://arxiv.org/html/2608.26442#S1.p1.1)\.
- Team \(2024\)H\. F\. H\. TeamMATH\-500\.Note:[https://huggingface\.co/datasets/HuggingFaceH4/MATH\-500](https://huggingface.co/datasets/HuggingFaceH4/MATH-500)500\-problem evaluation subset of the MATH benchmarkCited by:[§4\.1](https://arxiv.org/html/2608.26442#S4.SS1.p1.1)\.
- Tran and Kiela \(2026\)D\. Tran and D\. KielaSingle\-agent llms outperform multi\-agent systems on multi\-hop reasoning under equal thinking token budgets\.arXiv preprint arXiv:2604\.02460\.Cited by:[§2](https://arxiv.org/html/2608.26442#S2.p1.1)\.
- Wanget al\.\(2025\)N\. Wang, X\. Hu, P\. Liu, H\. Zhu, Y\. Hou, H\. Huang, S\. Zhang, J\. Yang, J\. Liu, G\. Zhang,et al\.Efficient agents: building effective agents while reducing cost\.arXiv preprint arXiv:2508\.02694\.Cited by:[§2](https://arxiv.org/html/2608.26442#S2.p1.1)\.
- Weiet al\.\(2022\)J\. Wei, X\. Wang, D\. Schuurmans, M\. Bosma, F\. Xia, E\. Chi, Q\. V\. Le, D\. Zhou,et al\.Chain\-of\-thought prompting elicits reasoning in large language models\.Advances in neural information processing systems35,pp\. 24824–24837\.Cited by:[§1](https://arxiv.org/html/2608.26442#S1.p1.1)\.
- Wuet al\.\(2025\)J\. Wu, J\. Zhu, Y\. Liu, M\. Xu, and Y\. JinAgentic reasoning: a streamlined framework for enhancing llm reasoning with agentic tools\.InProceedings of the 63rd Annual Meeting of the Association for Computational Linguistics \(Volume 1: Long Papers\),pp\. 28489–28503\.Cited by:[§2](https://arxiv.org/html/2608.26442#S2.p1.1)\.
- Yaoet al\.\(2022\)S\. Yao, J\. Zhao, D\. Yu, N\. Du, I\. Shafran, K\. Narasimhan, and Y\. CaoReact: synergizing reasoning and acting in language models\.arXiv preprint arXiv:2210\.03629\.Cited by:[§1](https://arxiv.org/html/2608.26442#S1.p1.1)\.
- Zhouet al\.\(2026\)S\. Zhou, R\. Ling, J\. Chen, X\. Wang, T\. Fan, and H\. WangWhen more thinking hurts: overthinking in llm test\-time compute scaling\.arXiv preprint arXiv:2604\.10739\.Cited by:[§3\.2](https://arxiv.org/html/2608.26442#S3.SS2.p1.1)\.
- Zhouet al\.\(2025\)X\. Zhou, G\. Tie, G\. Zhang, W\. Wang, Z\. Zuo, D\. Wu, D\. Chu, P\. Zhou, N\. Z\. Gong, and L\. SunExploring the necessity of reasoning in llm\-based agent scenarios\.arXiv preprint arXiv:2503\.11074\.Cited by:[§3\.2](https://arxiv.org/html/2608.26442#S3.SS2.p1.1)\.Similar Articles
Stop When Further Reasoning Won't Help: Attention-State Adaptive Generation in Reasoning Models
This paper proposes ASAG, a training-free method that adaptively stops reasoning in large reasoning models based on attention distributions, reducing token usage by ~40% while improving accuracy by 3.2% on benchmarks using DeepSeek-R1-Distill and Qwen3 models.
Recursive Agentic Reasoning
The paper recasts test-time reasoning methods as recursion operators—Grow, Prune, and Branch—and evaluates them, finding that Branch consistently improves accuracy by recovering from budget-exhausted outputs, while recommending paired scoring for comparative studies.
Adaptive Latent Agentic Reasoning
This paper introduces Adaptive Latent Agentic Reasoning (ALAR), a dual-mode framework for LLM agents that uses compact latent reasoning for routine turns and selectively escalates to explicit chain-of-thought for harder decisions, achieving up to 84.6% token reduction while maintaining task accuracy.
Tools as Continuous Flow for Evolving Agentic Reasoning
This paper introduces FlowAgent, a novel framework that reconceptualizes tool chaining as continuous trajectory generation using conditional flow matching to improve robustness in long-horizon agentic reasoning.
How should AI agents decide what kind of “thinking” a task actually needs?
A reflective discussion on designing AI agents that intelligently choose the type of thinking needed for a task, proposing a control layer for task classification, attention, and memory management, inspired by human cognition.