Cited by 2Natural Language Processing TechniquesAI-based Problem Solving and PlanningTopic Modeling

The Reasoning Trap: How Enhancing LLM Reasoning Amplifies Tool Hallucination

Open access
Yin, Chenlong, Sha, Zeyang, Cui, Shiwen, Meng, Changhua, Li, Zechao·2026·Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)

Abstract

Enhancing the reasoning capabilities of Large Language Models (LLMs) is a key strategy for building Agents that "think then act."However, recent observations, like OpenAI's o3, suggest a paradox: stronger reasoning often coincides with increased hallucination, yet no prior work has systematically examined whether reasoning enhancement itself causes tool hallucination.To address this gap, we pose the central question: Does strengthening reasoning increase tool hallucination of LLM Agents?We address this gap by introducing SIMPLETOOL-HALLUBENCH, a diagnostic benchmark measuring tool hallucination.Through controlled experiments, we show that across RL, distillation, and toggleable reasoning modes, gains in task performance are consistently accompanied by higher tool hallucination rates.This effect is training method-agnostic and transcends simple overfitting, as training even on non-tool-related tasks (e.g., mathematics) still amplifies tool hallucination.Controlled ablations further reveal that the reasoning itself, rather than RL training in general, is most closely associated with the hallucination increase.We evaluate mitigation strategies including Prompt Engineering and Direct Preference Optimization (DPO), revealing a fundamental reliability-capability trade-off: reducing hallucination unavoidably degrades utility.Our findings demonstrate that under current reasoning enhancement methods, improved reasoning is systematically associated with increased tool hallucination, highlighting the need for training objectives that jointly optimize capability and reliability.Our

Integrity signals

Registry

Crossref · 10.18653/v1/2026.acl-long.376

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • In multi-turn settings with incomplete or incrementally provided information, ReAct-style explicit reasoning can amplify earlier misconceptions, potentially leading to self-reinforcing hallucinations that can form loops.

    “However, in multi-turn settings with incomplete or incrementally provided information, ReAct-style explicit reasoning can amplify earlier misconceptions [12,13]. This may lead to self-reinforcing hallucinations that can form loops [14]”
  • When required fields are only partially filled, this often results in repetitive tool calls or speculative reasoning, which can lead to tool hallucinations and repeated correction attempts rather than converging to a correct state.

    “When the required fields are only partially filled, this often results in repetitive tool calls or speculative reasoning, which can lead to tool hallucinations and repeated correction attempts rather than converging to a correct state [14].”

Cites

Still being checked.

Cited by

Sorted by citations

Authors
Yin, C., Sha, Z., Cui, S., Meng, C., & Li, Z.
Affiliations
  • Pennsylvania State University (US)
  • Nanjing University of Science and Technology (CN)
Venue
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Published
2026
Pages
8310-8328
ISSN
0736-587X (ISSN-L)
OpenAlex
W7166868746
Cited by
0
References
0
FWCI
0.00
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
Proceedings of the conference - Association for Computational Linguistics. Meeting (publishedVersion, cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
Keywords
LLM agents, reinforcement learning, knowledge distillation, prompt engineering, direct preference optimization, overfitting

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review