Back to Rankings

Concise-9B: Removing the Slack from a Reasoning Model's Thinking

Alexander Boesgaard Lorup

Nov 1, 2026arXiv:2611.02278v1
cs.LGcs.CL
Share
Scorecard· 16/16
5.5/10 impact

Carefully measured, honest empirical report with a useful slack decomposition, but the method is explicitly not new and the gains are model-dependent.

Abstract

Reasoning models answer better when they think longer, but a thinking trace keeps going well after its answer has formed. We measure this slack in Qwen3.5-9B and remove most of it with concise self-training: two rounds of on-policy rejection-sampling fine-tuning that keep the shortest correct samples, plus a small share of answer-synthesis targets, giving Concise-9B. On 8,983 held-out problems (competition and hard mathematics, SuperGPQA, a five-area confirmation set and MMLU-Pro), Concise-9B generates 0.66x the tokens of Qwen3.5-9B at a 32K thinking budget, with accuracy equivalent within +/-1 point (-0.20 [-0.77, +0.36] points). Forcing each trace on the hard and confirmation sets to answer every 2,048 thinking tokens, we find that 54-64% of Qwen3.5-9B's thinking tokens come after the point from which every forced answer equals the final one (41-48% for Concise-9B). Stopping there would keep every answer at 0.35-0.44x the base model's tokens, but finding that point takes hindsight: stopping when three consecutive forced answers agree costs the base model 2.4-9.2 points. Concise self-training removes slack without that cost: 86% [83, 90] of the thinking tokens it saves come after the answer has formed. It has a limit: with traces continued to 80K tokens, Concise-9B solves 25 fewer of 1,276 hard problems (-25 [-49, -1]), mostly in competition mathematics. The measurement also yields a cheap commit signal for adaptive sampling that matched two-sample escalation within +/-1 point at 0.67x its tokens in a pre-registered test. Results on Qwen3.5-4B, on which the recipe was developed, and a replication on Olmo-3-7B-Think suggest that the saving depends on how verbose the base model is.

AI Impact Assessments

(1 model)

Core Contribution

The paper is a technical report that does two things for Qwen3.5-9B. (1) It builds Concise-9B with two rounds of on-policy rejection-sampling fine-tuning. Each round keeps the two shortest correct samples per problem and adds about 9% answer-synthesis targets. (2) It measures "slack": it forces an answer every 2,048 thinking tokens and finds the point after which every forced answer equals the final one. The authors say plainly that neither the training recipe nor the stopping rule is new. They credit Munkhbat et al., Yang et al., Kimi k1.5 and Liu & Wang. The contribution is the measurement and the large-scale, tightly bounded comparison, which gives four findings:

  • 54–64% of base-model thinking tokens come after the answer is fixed.
  • 86% of the tokens saved by training come from that slack.
  • Hindsight-free stopping rules (three agreeing readouts) cost 2.4–9.2 points, whereas training removes slack at no accuracy cost on average.
  • A cheap "self-agreement" commit signal for adaptive sampling.
  • Methodological Rigor

    Several design choices are strong:

  • Paired bootstrap intervals over 8,983 held-out problems.
  • TOST equivalence testing with explicit margins.
  • Decontamination via n-gram overlap, with the overlapping problems excluded.
  • A frozen recipe developed on the 4B model and applied unchanged to the 9B model.
  • Pre-registered tests for adaptive sampling.
  • An 80K-token continuation analysis that exposes a cost a 32K-only comparison would hide.
  • A calibration analysis showing Concise-9B is not simply truncating reasoning earlier, with base-model resamples as controls.
  • Candid reporting of failures, such as the SuperGPQA pre-registered test missing its equivalence and token-ratio criteria.
  • There are also gaps:

  • There is a single training run per round and no training seeds.
  • The synthesis targets are not ablated.
  • The slack measure depends on a coarse grid and on greedy forced readouts. Forced readouts may behave differently from natural reasoning, and traces shorter than 3,072 tokens are counted as having no slack.
  • The "86% of savings is slack" figure is sensitive to the grid, as the authors acknowledge, since Concise-9B has more traces without readouts.
  • The "slack" definition is relative to the trace's own final answer, so for wrong answers it measures non-productive checking.
  • The pre-registered self-agreement tests passed only within wide margins (±1–2 points, with intervals close to the edge). The secondary test reused the problems on which m was tuned.
  • Equivalence at ±1 point on 8,983 problems is dominated by saturated sets such as MMLU-Pro and executable code.
  • Potential Impact

    The practical result is a roughly one-third token reduction at equivalent accuracy on a popular open model. That is useful but not novel as a technique. The more durable value is the framing of slack and the hindsight-versus-online gap. It shows that answer-convergence early stopping, which several recent papers promote, loses substantial accuracy on hard problems on a native thinking model. It also shows that training implicitly "knows" which tokens are slack. The self-agreement commit signal is a small, reusable idea for adaptive-sampling pipelines. The Olmo replication, with only a 1–4% token reduction, shows the benefit depends on base-model verbosity. That limits generality but is an honest and informative finding.

    Timeliness & Relevance

    Efficient reasoning and overthinking are very active topics, and inference cost for thinking models is a real bottleneck. Qwen3.5 is a current open model family. However, the field is crowded with RL-based length-control methods, early-exit methods and shortest-correct SFT. A paper that explicitly claims no new algorithm will be cited mostly as a measurement reference, not as a method.

    Strengths

  • Unusually careful statistics and a large evaluation.
  • Honest limitations: the 80K ceiling loss, the failed SuperGPQA pre-registration, and the Olmo null on token savings.
  • A clear decomposition of where the savings come from.
  • A cautionary result against naive early-stopping rules.
  • Methods and appendices that are detailed enough to reproduce, including the training hyperparameters.
  • Limitations

  • Mostly one base model; the only other-family check (Olmo) showed essentially no savings.
  • No comparison to RL-based or other length-reduction baselines such as ThinkPrune or L1, or to other early-exit methods run on the same model. The head-to-head is only against the base model.
  • The released-model status is unclear (no code or weights link is mentioned).
  • Tokens are reported instead of wall-clock time.
  • The paper is a single-author technical report with a dense, number-heavy presentation.
  • The slack definition is somewhat tautological: the answer is "fixed" only in hindsight.
  • Training and evaluation overlap in distribution on MATH and MMLU.
  • Overall this is a solid, careful empirical report with modest novelty and moderate impact. It is useful for practitioners and for efficient-reasoning researchers who want a measurement baseline, but it is unlikely to become a foundational reference.

    Rating:5.5/ 10
    Significance 5Rigor 7.5Novelty 3.5Clarity 6

    Generated Nov 3, 2026

    Comparison History (0)

    No comparisons yet.