# Learning When to Think: Adaptive Reasoning for Test-Time Compute Allocation

Source: [arXiv](https://arxiv.org/abs/2608.20256v1)  
Feed7 permalink: https://feed7.dev/p/2608-20256v1-15u528w  
Published: 2026-08-20T16:54:08.000Z  
Trust: Needs Review (needs_review)

## Why Included

A model learned to choose its own reasoning budget, cutting average output tokens 41% with a small MATH500 accuracy drop. Agent builders could replace fixed effort settings with task-level routing.

## Source Summary

A **1.5B distilled model** learned to begin each response in NoThink, Short, or Long mode without a separate router. On MATH500, mean output fell from **4,796 to 2,811 tokens** while accuracy moved from 0.796 to 0.782.

## Practical Implication

Builders running coding agents should reconsider one fixed reasoning budget for every task. A learned or explicit difficulty gate could reserve longer runs for harder work and shorten routine calls, reducing latency and token use.

## Agent-Ready Context

A **1.5B distilled model** learned to begin each response in NoThink, Short, or Long mode without a separate router. On MATH500, mean output fell from **4,796 to 2,811 tokens** while accuracy moved from 0.796 to 0.782.

Builders running coding agents should reconsider one fixed reasoning budget for every task. A learned or explicit difficulty gate could reserve longer runs for harder work and shorten routine calls, reducing latency and token use.

The model was trained on MATH, not coding workloads, and the result averages only **three seeds**. Transfer was strongest on easier benchmarks, including a **76% token reduction on GSM8K**, so coding-agent gains still need direct evaluation.

## Connected Context

Feed7 judgment across 525 accumulated Signals:

This adds learned per-request compute selection to the prior menu of test-time reasoning techniques, challenging fixed reasoning budgets as the default. The modest MATH500 accuracy tradeoff and stronger savings on easier tasks suggest gating is most credible for routine work; it does not yet establish that coding-task difficulty can be predicted or that shorter coding runs preserve reliability.

- [GradCuit: Credit-Assigned Gradient Flow Enables Robust and Interpretable Test-Time Latent Reasoning](https://feed7.dev/p/2608-02585v1-1t870md) — GradCuit offers a heavier per-query reasoning mechanism, while adaptive mode selection could provide the prerequisite gate that decides which queries justify additional test-time optimization.
- [You Only Pass Once: Answering and Abstaining Together in a Single Forward Pass of a Frozen Language Model](https://feed7.dev/p/2608-14465v1-0tpy8xd) — Both seek inference efficiency through internal control rather than a separate router or extra pass, but YOPO targets abstention reliability while this work allocates reasoning length.
- [ReContext: Recursive Evidence Replay as LLM Harness for Long-Context Reasoning](https://feed7.dev/p/2607-02509v1-11vodps) — ReContext is a training-free way to spend extra computation on long-context evidence; adaptive reasoning suggests reserving such extended processing for requests judged difficult rather than applying it uniformly.

## Context Map

- Layer: model
- Domains: research
- Topics: reasoning

## Uncertainty

- The model was trained on MATH, not coding workloads, and the result averages only **three seeds**. Transfer was strongest on easier benchmarks, including a **76% token reduction on GSM8K**, so coding-agent gains still need direct evaluation.

## Agent Instruction

Use this item as source-backed context. Do not invent claims beyond the linked source. If this item conflicts with another source, call out the conflict.