paper-with-me

홈 › Papers

From Proof to Program: Characterizing Tool-Induced Reasoning Hallucinations in Large Language Models

2025-11-14 · Farima Fatahi Bayat, Pouya Pezeshkpour, Estevam Hruschka arxiv

Tool-augmented Language Models (TaLMs) can invoke external tools to solve problems beyond their parametric capacity. However, it remains unclear whether these tool-enabled gains reflect trustworthy reasoning. Focusing on the Code Interpreter tool, we show that even when tools are selected and executed correctly, TaLMs treat tool outputs as substitutes for reasoning, producing solutions that appear correct but lack coherent justification. We term this failure mode Tool-Induced Myopia (TIM), and study it using PYMATH, a benchmark of 1,679 competition-level mathematical problems for which Python code is helpful but not sufficient. We further develop a multi-dimensional evaluation suite to quantify reasoning degradation in TaLMs relative to their non-tool counterparts. Our findings reveal that while TaLMs achieve up to a 19.3 percentage point gain in final-answer accuracy, their reasoning behavior consistently deteriorates (e.g., non-tool LLMs win up to 41.5% more often in pairwise comparisons of the reasoning process). This degradation intensifies with tool use; the more frequently a model invokes tools, the less coherent its reasoning becomes. Moreover, tool use shifts errors from arithmetic mistakes toward global reasoning failures (logic, assumption, creativity); with TIM present in ~55% of high-risk cases. Finally, we propose a preference-optimization-based framework that realigns TaLMs to use tools as assistive evidence, improving both final-answer accuracy and reasoning depth under tool use. Codes and data are available at: https://github.com/megagonlabs/TIM.

📄 PDF Abstract BibTeX arXiv:2511.10899

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

LLMs versus the Halting Problem: Characterizing Program Termination Reasoning

2026-01-26 · Oren Sultan, Jordi Armengol-Estape, Pascal Kesseli, Julien Vanegue 외 arxiv

Determining whether a program terminates is a central problem in computer science. Turing's Halting Problem established termination as undecidable, showing that no algorithm can universally determine termination for all …

Execution Time Program Verification With Tight Bounds

2022-10-20 · Ana Carolina Silva, Manuel Barbosa, Mario Florido

This paper presents a proof system for reasoning about execution time bounds for a core imperative programming language. Proof systems are defined for three different scenarios: approximations of the worst-case execution…

Proofs of life: molecular-biology reasoning simulates cell behaviors from first principles

2018-10-30 · René Vestergaard, Emmanuel Pietriga

We axiomatize the molecular-biology reasoning style, show compliance of the standard reference: Ptashne, A Genetic Switch, and present proof-theory-induced technologies to help infer phenotypes and to predict life cycles…

Transductive Visual Programming: Evolving Tool Libraries from Experience for Spatial Reasoning

2025-12-24 · Shengguang Wu, Xiaohan Wang, Yuhui Zhang, Hao Zhu 외 arxiv

Spatial reasoning in 3D scenes requires precise geometric calculations that challenge vision-language models. Visual programming addresses this by decomposing problems into steps calling specialized tools, yet existing m…

Spatial Reasoning

Proof-of-Perception: Certified Tool-Using Multimodal Reasoning with Compositional Conformal Guarantees

2026-02-27 · Arya Fayyazi, Haleh Akrami arxiv

We present Proof-of-Perception (PoP), a tool-using framework that casts multimodal reasoning as an executable graph with explicit reliability guarantees. Each perception or logic node outputs a conformal set, yielding ca…

Multimodal Reasoning