Select to Think: Unlocking SLM Potential with Local Sufficiency

arXiv cs.CL / 4/30/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • Small language models (SLMs) are efficient but typically lack the reasoning quality of larger LLMs, and common fixes that call an external LLM add major latency and cost.
  • The paper introduces “local sufficiency,” showing that at reasoning divergence points the LLM’s preferred token often remains within the SLM’s top-K next-token candidates even if it is not the SLM’s top-1 choice.
  • Based on this, the authors propose SELECT TO THINK (S2T), reframing the teacher LLM’s role from open-ended generation to selecting among the SLM’s candidate proposals, turning training into discrete candidate ranking.
  • They further present S2T-LOCAL, which distills this selection/reranking behavior into the SLM so it can rerank autonomously at inference time without any LLM calls.
  • Experiments show a 1.5B SLM with top-8 candidates recovers the 32B LLM’s choice with a 95% hit rate, and S2T-LOCAL improves greedy decoding by 24.1% on average—matching multi-path self-consistency performance with single-trajectory efficiency.

Abstract

Small language models (SLMs) offer computational efficiency for scalable deployment, yet they often fall short of the reasoning power exhibited by their larger counterparts (LLMs). To mitigate this gap, current approaches invoke an LLM to generate tokens at points of reasoning divergence, but these external calls introduce substantial latency and costs. Alternatively, standard distillation is often hindered by the capacity limitation, as SLMs struggle to accurately mimic the LLM's complex generative distribution. We address this dilemma by identifying local sufficiency: at divergence points, the LLM's preferred token consistently resides within the SLM's top-K next-token predictions, even when failing to emerge as the SLM top-1 choice. We therefore propose SELECT TO THINK (S2T), which reframes the LLM's role from open-ended generation to selection among the SLM's proposals, simplifying the supervision signal to discrete candidate rankings. Leveraging this, we introduce S2T-LOCAL, which distills the selection logic into the SLM, empowering it to perform autonomous re-ranking without inference-time LLM dependency. Empirically, we demonstrate that a 1.5B SLM's top-8 candidates capture the 32B LLM's choice with 95% hit rate. Translating this potential into performance, S2T-LOCAL improves greedy decoding by 24.1% on average across benchmarks, effectively matching the efficacy of 8-path self-consistency while operating with single-trajectory efficiency.