SuperIntelligence - Robotics - Safety & Alignment· 2025
The Illusion of Thinking
- 150citations
- 2025year
Short summary
Frontier Large Reasoning Models (LRMs) exhibit a complete accuracy collapse and counterintuitive scaling limits on complex puzzles, failing to use explicit algorithms and reasoning inconsistently.
AI-generated from the title and abstract; the full text is not read.
Key points
- LRMs experience a complete accuracy collapse on puzzles beyond a certain complexity.
- LRM reasoning effort increases with complexity up to a point, then declines despite sufficient token budget.
- Standard LLMs outperform LRMs on low-complexity tasks, while LRMs show advantage on medium-complexity tasks.
- LRMs fail to use explicit algorithms and demonstrate inconsistent reasoning across puzzles.
AI-generated from the title and abstract; the full text is not read.
Abstract
Recent generations of frontier language models have introduced Large Reasoning Models (LRMs) that generate detailed thinking processes before providing answers. While these models demonstrate improved performance on reasoning benchmarks, their fundamental capabilities, scaling properties, and limitations remain insufficiently understood. Current evaluations primarily focus on established mathematical and coding benchmarks, emphasizing final answer accuracy. However, this evaluation paradigm often suffers from data contamination and does not provide insights into the reasoning traces’ structure and quality. In this work, we systematically investigate these gaps with the help of controllable puzzle environments that allow precise manipulation of compositional complexity while maintaining consistent logical structures. This setup enables the analysis of not only final answers but also the internal reasoning traces, offering insights into how LRMs “think”. Through extensive experimentation across diverse puzzles, we show that frontier LRMs face a complete accuracy collapse beyond certain complexities. Moreover, they exhibit a counterintuitive scaling limit: their reasoning effort increases with problem complexity up to a point, then declines despite having an adequate token budget. By comparing LRMs with their standard LLM counterparts under equivalent inference compute, we identify three performance regimes: (1) lowcomplexity tasks where standard models surprisingly outperform LRMs, (2) medium-complexity tasks where additional thinking in LRMs demonstrates advantage, and (3) high-complexity tasks where both models experience complete collapse. We found that LRMs have limitations in exact computation: they fail to use explicit algorithms and reason inconsistently across puzzles. We also investigate the reasoning traces in more depth, studying the patterns of explored solutions and analyzing the models’ computational behavior, shedding light on their strengths, limitations, and ultimately raising crucial questions about their true reasoning capabilities.
The authors' abstract, as published at the source. SuperIntelligence - Robotics - Safety & Alignment, 2025 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Artificial Intelligence
Artificial IntelligenceComputer Science