Are reasoning model collapses really failures of reasoning?
Explores whether language models hit a fundamental reasoning ceiling or whether text-only evaluation masks execution limitations. Examines how tool access might reveal hidden reasoning capabilities.
The "reasoning cliff" — where LRM performance collapses beyond certain complexity thresholds — is reframed as an execution failure, not a reasoning failure. When models are confined to text-only generation, they are forced into the role of "human simulator" (transcribing thousands of discrete steps) rather than "problem solver" (offloading procedural execution to appropriate tools).
The evidence: providing models with explicit algorithms for Tower of Hanoi does not prevent collapse. The model knows the algorithm but cannot execute it autoregressively at scale. This is a tool-use problem, not a reasoning problem. When given code execution access, models solve problems far beyond the supposed cliff.
Tool-enabled evaluation reveals an agentic hierarchy:
First-Order Agency — GPT-4o uses tools for straightforward procedural execution. It implements a strategy and runs it. When the strategy fails, it doesn't recover.
Second-Order Agency — o4-mini uses tools for verification and metacognitive self-correction. It begins with a flawed hypothesis, detects the failure through self-generated simulation, discards the failed strategy, and selects an entirely new correct approach. This plan-test-fail-revise loop mirrors deliberate practice.
The most revealing failure mode: when confined to text-only, models that cannot maintain state and exhaust search spaces declare solvable problems "logically impossible." They mistake their own execution limitations for fundamental impossibilities — a phenomenon analogous to learned helplessness.
The reframe has practical implications. The question shifts from "Can models reason?" to "What kind of reasoners are they, and under what conditions can they ascend the agentic hierarchy?" Evaluations that prohibit tool use are measuring execution bandwidth, not reasoning capability.
Inquiring lines that read this note 198
This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.
How can LLM recommenders match or exceed collaborative filtering performance? Why do benchmark improvements fail to reflect actual reasoning quality?- How can minimal pairs expose reasoning failures that single-instance accuracy metrics miss?
- Can reasoning benchmarks separate logic from believability?
- Why does homework adherence remain low despite advances in language model capability?
- Can benchmark performance distinguish surface from structural linguistic knowledge?
- What explains the gap between perplexity performance and actual reasoning capability?
- Why do current speech benchmarks fail to measure reasoning over audio?
- Why do readability and style metrics plateau while reasoning improves with scale?
- Why do text-only benchmarks underestimate deployed model capability?
- How does tool access change what we measure in reasoning tests?
- Can benchmark improvements hide degradation of deliberative reasoning?
- What evaluation methods actually measure reasoning versus execution capability?
- What does pass@k reveal about base model reasoning capacity?
- How can benchmark accuracy scores mask the absence of interpretable reasoning structure?
- Why does document perplexity stay low while question-answering accuracy drops?
- How does evaluation setting affect measured reasoning capabilities in language models?
- What structural constraints matter more than model depth for CF?
- Why do harder puzzles cause all models to collapse despite larger token budgets?
- Can surface heuristics override implicit constraints in domain-specific reasoning?
- How does the frame problem differ between symbolic and statistical reasoning systems?
- Do tool-enabled reasoning models close the gap on constraint satisfaction?
- Can symbolic solvers rescue language models from logical reasoning failures?
- Which constraint types do reasoning models handle best?
- How do deterministic symbolic solvers improve the reliability of language model reasoning?
- How does program-aided reasoning externalize intermediate computation into executable form?
- Which code verification tasks still require execution instead of reasoning?
- Why do semi-formal templates improve verification accuracy over unstructured reasoning?
- Can completeness scaffolding substitute for actual code execution in reasoning?
- What makes natural language reasoning more practical than formal languages for multi-framework codebases?
- How does tool-based reasoning expand what language models can do?
- Can tools unlock reasoning strategies that require abstract insight beyond computation?
- How does program-aided reasoning externalize computation into executable form?
- What separates verifiable reasoning from open-ended judgment in scaling requirements?
- When does knowledge activation fail across different model architectures?
- How does computational split-brain syndrome differ from ordinary knowledge gaps?
- Do reasoning systems reuse cognitive structures across unrelated topics?
- What design changes could make constraint inference more reliable without explicit cuing?
- Why does step-by-step reasoning fail when tool outputs get very large?
- Does sentence-level granularity capture enough structure for complex reasoning tasks?
- Why do reasoning models fail on structurally unfamiliar instances?
- Does text-only evaluation hide reasoning collapse that tool use could repair?
- Can we distinguish between semantic and symbolic reasoning in language models?
- Where do humans and language models actually diverge in reasoning ability?
- What makes Compound-QA expose weaknesses in monologue reasoning?
- What causes snowball errors to accumulate across reasoning steps in language models?
- Can small models solve complex tasks using externalized reasoning graphs?
- Why does extended reasoning fail for search and knowledge retrieval tasks?
- Can long-context models handle compositional reasoning requiring structured logic?
- Why do language models struggle with formal logical reasoning and joins?
- Why do reasoning chains degenerate into undirected exploration at scale?
- Can explicit optimal algorithms prevent reasoning model collapse at high complexity?
- Can scaffolding frameworks isolate inductive reasoning from deductive confounds?
- Why do reasoning models wander instead of searching systematically?
- Can recursive sub-calls decompose reasoning across multiple context chunks?
- Can external classifiers reliably decide when a model should reason?
- How do recursive language models rethink where to store reasoning?
- Why do reasoning-optimized models still fall for logical fallacies in conversation?
- Why do reasoning models fail at learning hidden rules from sparse exceptions?
- What mechanisms cause reasoning models to wander rather than focus?
- Why do language models struggle with backward reasoning compared to forward?
- Can cognitive scaffolding replace tool-based reasoning augmentation in language models?
- Why do smaller models lose reasoning faithfulness more than larger models?
- Why do long-context language models struggle with compositional reasoning tasks?
- When is numeric computation the real bottleneck versus reasoning depth?
- What makes deterministic recursive reasoning models underperform on multi-solution tasks?
- Is reasoning failure caused by task complexity or training distribution gaps?
- Does reasoning efficiency transfer to tasks without ground truth dependency graphs?
- How does instance novelty rather than chain length explain reasoning failure?
- What distinguishes the convergence patterns between reasoning and lexical variation tasks?
- Why does scaling reasoning tokens fail to improve unfamiliar tasks?
- What happens to model reasoning accuracy as thinking token requirements exceed critical thresholds?
- What is the relationship between reasoning depth and verbalization requirements?
- Can step-level deliberation flags guide other reasoning systems?
- When does explicit reasoning actually degrade performance on a task?
- Does performative reasoning mask underlying uncertainty even on easy problems?
- Why do language models produce plausible outputs over accurate failure reports?
- Can language models accurately evaluate the quality of their own reasoning?
- Why do language models struggle with evaluative tasks like weighing competing viewpoints?
- Can manipulative prompts reduce reasoning model accuracy without fine-tuning?
- Can reasoning models distinguish between new evidence and manipulative reframing?
- Are reasoning models more vulnerable to adversarial manipulation than standard models?
- How much do mechanistic interpretability findings reflect true reasoning architecture?
- Can mechanistic interpretability explain explanation-execution disconnection?
- Why do language models imitate reasoning form without abstract inference capability?
- Why does semantic decoupling specifically break LLM reasoning abilities?
- How does semantic reasoning differ from symbolic reasoning in language models?
- What makes deductive reasoning so brittle in language models overall?
- Can language models perform purely symbolic reasoning when semantics are removed?
- Why does augmenting symbolic reasoning outperform replacing it entirely?
- Can language models perform genuine symbolic reasoning without semantic grounding?
- What makes language an effective parameterization for procedural knowledge?
- How do semantic and symbolic reasoning capabilities differ in language models?
- Can diverse critiques on a single problem unlock reasoning without diverse problem sets?
- Can verifier-guided search catch factual errors that reasoning training cannot?
- Why do open-source models trained on proprietary outputs still fail at reasoning?
- Does model scaling improve knowledge storage faster than reasoning ability?
- Do reasoning models perform genuine logical evaluation or pattern matching?
- Why might rationales that predict common text patterns fail on hard novel reasoning?
- Can reasoning learned from language modeling actually transfer to knowledge-intensive domains?
- What kinds of reasoning tasks reveal the ceiling of text-only training?
- Why does single-shot learning fail in REVTHINK's multi-source reasoning tasks?
- Can outcome-focused objectives explain failures in reasoning evaluation?
- Why do reasoning models perform poorly at theory of mind tasks?
- Why do reasoning models perform worse on theory of mind tasks?
- Why do models show performative reasoning on easy tasks but genuine reasoning on hard ones?
- How do explicit reasoning traces help models construct valid syntactic trees?
- Can models maintain auditable reasoning while achieving high accuracy?
- How does making implicit reasoning requirements explicit change model performance?
- How can reasoning quality be verified before integrating new information into a reasoning graph?
- What reasoning tasks are actually checkable through process verification?
- How do semantic failure modes map to attentional and intentional layers?
- How does error avalanching differ from entropy collapse as a failure mode?
- Do reasoning failures stem from strategy or from calculation breakdown?
- Why do reasoning model failures stem from execution rather than reasoning?
- Can verification loops and decomposition fix judgment failures?
- How can we turn reasoning model failures into useful training signals?
- What makes financial reasoning particularly vulnerable to general PRM failures?
- Why do epistemic failure modes cluster around world model limitations?
- Why do large language models fail at temporal reasoning in complex legal cases?
- What reveals the epistemic limits of language models?
- How does tool integration leverage comprehension without demanding perfect generation?
- What distinguishes domain-specific failure modes from general model limitations?
- Can capability boundary collapse be addressed by operating at representational rather than token level?
- Can explicit stack mechanisms extend what formal languages transformers can learn?
- Can transformers reason beyond fixed architectural depth limits?
- Can looping enable reasoning capabilities that fixed-depth transformers fundamentally cannot achieve?
- How do search tasks differ from derivation tasks in reasoning efficiency?
- How should iterative research tasks limit context per reasoning turn?
- Why do non-reasoning models work better under extreme decomposition than reasoning models?
- Does fine-tuning models for specific tasks destroy their ability to reason?
- Is the reasoning cliff actually a tool-use problem?
- Do higher asymptote recipes unlock genuinely novel reasoning strategies?
- What changes when reasoning models adopt trajectory-response output formats?
- How much reasoning depth do we actually need for most real-world tasks?
- Can reasoning models succeed at logic but fail at execution?
- Why do reasoning models fail to improve constrained optimization performance?
- What limits external scaling when a model lacks reasoning foundation?
- How do reasoning-related features behave when trained on near-impossible problems?
- Does adding reasoning to models degrade other capabilities like rule inference?
- Why do models fail on logically equivalent tasks with different data distributions?
- Why do non-experts default to familiar chart types despite domain complexity?
- Does more inference compute help reasoning models match specialized domain performance?
- Can reasoning models outperform non-reasoning models with more inference compute?
- Does architectural design matter more than model scale for reasoning tasks?
- Does architectural separation of induction from deduction improve exception detection?
- Does algorithmic decomposition prevent planning-execution interference in reasoning?
- Does decoupling reasoning from tool use actually improve accuracy?
- When does backward decomposition fail on open-ended or unstructured tasks?
- How does evaluation format change what we measure about model reasoning?
- How can interactive evaluation avoid replicating fragmentation problems from response-centered benchmark culture?
- Can models distinguish between activated knowledge and genuine reasoning?
- Why do reasoning models confidently generate wrong answers instead of abstaining?
- Why do reasoning models fail when input length increases even below context limits?
- Can minimal reasoning steps match verbose reasoning accuracy?
- How do game-based benchmarks reveal reasoning fragmentation across domains?
- Can argumentation structure improve reasoning through decomposition alone?
- Can models internally identify which tokens matter most for reasoning?
- Can irrelevant information reliably expose the limits of LLM reasoning?
- Why does cross-text analogical reasoning fail when semantics decouple from symbols?
- Why does removing semantic content collapse reasoning in language models?
- Why do a-priori procedural specifications fail as environments change and interfaces evolve?
- Can end-to-end models maintain debuggability without modular components?
- Can multi-agent debate prevent reasoning models from amplifying errors?
- What role should reasoning agents play in validating multi-LLM ensemble outputs?
- Can machine learning encode pragmatic reasoning about when rules should bend?
- Can models distinguish between logical impossibility and their own execution limits?
Related concepts in this collection 3
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
Why do reasoning LLMs fail at deeper problem solving?
Explores whether current reasoning models systematically search solution spaces or merely wander through them, and how this affects their ability to solve increasingly complex problems.
text-only evaluation captures the wandering; agentic evaluation may resolve it
-
Can modular cognitive tools unlock reasoning without training?
Can reasoning capabilities be elicited by structuring LLM calls as isolated cognitive operations—understanding, recalling, examining, and backtracking—rather than through reinforcement learning?
cognitive tools address the tool-use dimension; agentic hierarchy suggests which tools matter when
-
Why can't advanced AI models take initiative in conversation?
Despite extraordinary capability in answering and reasoning, LLMs fundamentally cannot initiate, redirect, or guide exchanges. Understanding this gap—and whether it's fixable—matters for building AI that truly collaborates rather than merely responds.
passivity is a First-Order Agency ceiling; Second-Order Agency requires the initiative that current models lack
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- Comment on The Illusion of Thinking: Understanding the Strengths and Limitations of Reasoning Models via the Lens of Problem Complexity
- A Comment On "The Illusion of Thinking": Reframing the Reasoning Cliff as an Agentic Gap
- The Illusion of Thinking: Understanding the Strengths and Limitations of Reasoning Models via the Lens of Problem Complexity
- Large Language Model Reasoning Failures
- Beyond Accuracy: Evaluating the Reasoning Behavior of Large Language Models -- A Survey
- ZebraLogic: On the Scaling Limits of LLMs for Logical Reasoning
- Do Theory of Mind Benchmarks Need Explicit Human-like Reasoning in Language Models?
- Efficient Tool Use with Chain-of-Abstraction Reasoning
Original note title
reasoning model performance collapses are execution failures not reasoning failures — tool use reveals an agentic hierarchy