SYNTHESIS NOTE
TopicsTest Time Computethis note

Can non-reasoning models catch up with more compute?

Explores whether inference-time compute budget can close the performance gap between standard models and those trained for reasoning, and what training mechanisms might enable this.

Synthesis note · 2026-02-20 · sourced from Test Time Compute
How should we spend compute at inference time?

In verifier-free inference-time compute experiments (Think Deep, Think Fast), non-reasoning models fall substantially behind reasoning models even when given an extremely high inference budget. The gap doesn't close with more compute — it just stays there.

This sets a hard limit on Can inference compute replace scaling up model size?. The substitution works within a training regime, but not across training regimes. A standard instruction-tuned model with more inference compute cannot replicate what a model trained specifically for extended reasoning can do, even given equivalent token budgets.

Why? Reasoning models have internalized the reasoning process through training — they know how to use additional tokens productively. Non-reasoning models don't have this structure, so additional tokens degrade into noise or verbosity rather than improved reasoning. The training regime instills the reasoning protocol that makes inference compute usable.

Qualification from targeted activation (Base Models paper): The gap is substantially closeable through targeted steering of base model activations without weight updates. A hybrid model using base model weights + thinking model deployment decisions recovers 91% of the performance gap while steering only 12% of tokens. This doesn't invalidate the finding — non-reasoning models without steering still fall behind — but it significantly changes what "non-reasoning model" means in practice. If capability already exists latently and steering can surface it, the gap is about deployment mechanisms, not raw capability. See Does RL teach reasoning or just when to use it?.

The imitation learning ceiling (Tutorial on LLM Reasoning): SFT/imitation learning creates an intelligence upper bound: the model is bounded by the quality of demonstrations it learns from, unable to surpass the skill level present in training data. RL + world models is the path beyond this ceiling, because RL allows discovery of strategies that exceed any individual demonstration. This provides the mechanism for why reasoning-specific training matters: it is not merely "more training" but training that enables exceeding the imitation ceiling.

This is a strong argument for the necessity of reasoning-specific post-training, not just inference-time tricks. Compute can amplify capability but cannot manufacture it. The dependency on training regime appears to be capability-specific: Can language models learn grammar from child-scale data? — syntactic competence scales down readily, achievable with human-scale data and the right composition. Reasoning capability requires the opposite: specialized training that instills the reasoning protocol itself. The lesson is not "you need a bigger model" but "you need the right training for the capability you want."

Inquiring lines that read this note 182

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.

Why do reasoning models fail at systematic problem-solving and search? Can self-supervised signals enable process supervision without human annotation? When does architectural design matter more than raw model capacity? What structural factors drive popularity bias in recommendation systems? Do base models contain latent reasoning that training can unlock? How does latent reasoning compare to verbalized chain-of-thought? How should inference compute be adaptively allocated based on prompt difficulty? How do knowledge graphs enable efficient multi-hop reasoning over alternatives? Can model routing outperform monolithic scaling as an efficiency strategy? How does example difficulty affect learning efficiency in language models? Can inference-time compute substitute for scaling up model parameters? Does parallel reasoning outperform sequential thinking under fixed compute budgets? What structural advantages do diffusion language models offer over autoregressive methods? How do knowledge injection methods compare across cost and effectiveness? Why do self-improving systems struggle without clear external performance metrics? How should models express uncertainty rather than forced confident answers? Does reinforcement learning teach reasoning or just when to reason? How do training data properties shape reasoning capability development? What capability tradeoffs emerge when scaling model reasoning abilities? How does test-time aggregation affect reasoning correctness and reliability? Does decoupling planning from execution improve multi-step reasoning accuracy? Do autonomous architecture discoveries follow predictable scaling laws? How do adversarial and manipulative prompts attack reasoning models? Which computational strategies best support reasoning in language models? Does recurrence enable reasoning capabilities that fixed-depth transformers cannot achieve? Can next-token prediction alone produce genuine language understanding? How does policy entropy collapse constrain reasoning-focused reinforcement learning? How should retrieval systems optimize for multi-step reasoning during inference? How faithfully do LLMs reflect their actual reasoning in outputs and explanations? Do language models perform faithful symbolic reasoning independent of semantic grounding? Do corrupted reasoning traces serve as effective supervision signals? Can alternative training methods improve on supervised fine-tuning for language models? How should iterative research systems allocate reasoning per search step? Why does finetuning cause catastrophic forgetting of model capabilities? Why do benchmark improvements fail to reflect actual reasoning quality? When do additional thinking tokens stop improving reasoning performance? How can AI systems learn from failures without cascading errors? How do training priors constrain what context information can override? Why does verification consistently lag behind AI generation? How does sequence length affect sparsity tolerance in models? What pretraining choices and baseline capability constrain reinforcement learning gains? Why does reinforcement learning suppress output diversity compared to supervised fine-tuning? How do we evaluate AI systems when user perception misleads actual performance? Does fine-tuning modify underlying model capabilities or only behavioral outputs?

Related concepts in this collection 7

This note in its neighbourhood — explore the map, then jump to a related concept in the list below.

Concept map
22 direct connections · 229 in 2-hop network ·dense cluster Open in graph ↗

Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph

your link semantically near linked from elsewhere

Related papers in this collection 8

Papers most semantically related to this note, ranked by cosine similarity in the embedding space.

Original note title

non-reasoning models cannot match reasoning models even with unlimited inference budget