Confidence-Guided Stepwise Model Routing for Cost-Efficient Reasoning
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Recent advances in Large Language Models (LLMs) - particularly model scaling and test-time techniques - have greatly enhanced the reasoning capabilities of language models at the expense of higher inference costs. To lower inference costs, prior works train router models or deferral mechanisms that allocate easy queries to a small, efficient model, while forwarding harder queries to larger, more expensive models. However, these trained router models often lack robustness under domain shifts and require expensive data synthesis techniques such as Monte Carlo rollouts to obtain sufficient ground-truth routing labels for training. In this work, we propose Confidence-Guided Stepwise Model Routing for Cost-Efficient Reasoning (STEER), a domain-agnostic framework that performs fine-grained, step-level routing between smaller and larger LLMs without utilizing external models. STEER leverages confidence scores from the smaller model's logits prior to generating a reasoning step, so that the large model is invoked only when necessary. Extensive evaluations using different LLMs on a diverse set of challenging benchmarks across multiple domains such as Mathematical Reasoning, Multi-Hop QA, and Planning tasks indicate that STEER achieves competitive or enhanced accuracy while reducing inference costs (up to +20% accuracy with 48% less FLOPs compared to solely using the larger model on AIME), outperforming baselines that rely on trained external modules. Our results establish model-internal confidence as a robust, domain-agnostic signal for model routing, offering a scalable pathway for efficient LLM deployment.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 33 of its 48 references that are in the map. First posted on arXiv 9 Nov 2025.
Builds on
33 of 48 references.
Closest ancestors · 7
Same direction, newest first
- 2025SpecReason: Fast and Accurate Inference-Time Compute via Speculative Reasoning10 Apr
- 2025Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models20 Mar
- 2025CoT-Valve: Length-Compressible Chain-of-Thought Tuning13 Feb
- 2025Reward-Guided Speculative Decoding for Efficient LLM Reasoning31 Jan
- 2024Critical Tokens Matter: Token-Level Contrastive Estimation Enhances LLM's Reasoning Capability29 Nov
- 2023Self-Evaluation Guided Beam Search for Reasoning1 May
- 2022Language Models (Mostly) Know What They Know11 Jul
Other references · 26
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2023Let's Verify Step by Stepcited by 3,598
- 2025Gemma 3 Technical Reportcited by 1,686
- 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
- 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,057
- 2021MuSiQue: Multihop Questions via Single-hop Question Compositioncited by 893
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 821
14 more
- 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 791
- 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 354
- 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Testcited by 318
- 2023Large Language Models as Commonsense Knowledge for Large-Scale Task Planningcited by 231
- 2024Chain-of-Thought Reasoning Without Promptingcited by 208
- 2023Beyond Chinchilla-Optimal: Accounting for Inference in Language Model Scaling Lawscited by 155
- 2024Language Model Cascades: Token-level uncertainty and beyondcited by 115
- 2022Language Model Cascadescited by 104
- 2021Types of Out-of-Distribution Texts and How to Detect Themcited by 80
- 2024KOR-Bench: Benchmarking Language Models on Knowledge-Orthogonal Reasoning Taskscited by 67
- 2024Learning to Route LLMs with Confidence Tokenscited by 66
- 2025VersaPRM: Multi-Domain Process Reward Model via Synthetic Reasoning Datacited by 39
- 2024ACPBench: Reasoning about Action, Change, and Planningcited by 37
- 2024Persona is a Double-edged Sword: Mitigating the Negative Impact of Role-playing Prompts in Zero-shot Reasoning Taskscited by 28
Built on by
Citing papers per year: 2026: 9.
9 papers.
- 2026TRiMS: Real-Time Tracking of Minimal Sufficient Length for Efficient Reasoning via RLcited by 2
- 2026Rubric-Guided Process Reward for Stepwise Model Routingcited by 2
- 2026ST-EVO: Towards Generative Spatio-Temporal Evolution of Multi-Agent Communication Topologiescited by 1
- 2026Policy-Guided Stepwise Model Routing for Cost-Effective Reasoningcited by 0
- 2026Differentiable Mixture-of-Agents Incentivizes Swarm Intelligence of Large Language Modelscited by 0
- 2026Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspectivecited by 0
- 2026FutureBridge: Token Selection Beyond Local Preference in Collaborative Decodingcited by 0
- 2026From Positionwise Confidence to Prefix Scheduling: Verifier Skipping in Speculative Decodingcited by 0
- 2026CERA-MoA: Co-Evolving Routing Mechanisms with Continually Learning LLM Agentscited by 0
- 2026CERA-MoA: Co-Evolving Routing Mechanisms with Continually Learning LLM Agents16 Sep 2026
- 2026From Positionwise Confidence to Prefix Scheduling: Verifier Skipping in Speculative Decoding14 Aug 2026
- 2026FutureBridge: Token Selection Beyond Local Preference in Collaborative Decoding7 Aug 2026
- 2026Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective28 May 2026
- 2026Rubric-Guided Process Reward for Stepwise Model Routing28 May 2026
- 2026Differentiable Mixture-of-Agents Incentivizes Swarm Intelligence of Large Language Models15 May 2026
- 2026Policy-Guided Stepwise Model Routing for Cost-Effective Reasoning7 May 2026
- 2026TRiMS: Real-Time Tracking of Minimal Sufficient Length for Efficient Reasoning via RL18 Mar 2026
- 2026ST-EVO: Towards Generative Spatio-Temporal Evolution of Multi-Agent Communication Topologies16 Feb 2026
Similar, not cited
Close in wording, no citation either way
- 2025Route to Reason: Adaptive Routing for LLM and Reasoning Strategy Selection
- 2026Reasoning Is Not Free: Robust Adaptive Cost-Efficient Routing for LLM-as-a-Judge
- 2026Dynamic Model Routing and Cascading for Efficient LLM Inference: A Survey
- 2025Lookahead Routing for Large Language Models
- 2026ODAR: Principled Adaptive Routing for LLM Reasoning via Active Inference
- 2025Route-and-Reason: Scaling Large Language Model Reasoning with Reinforced Model Router
- 2025Universal Model Routing for Efficient LLM Inference
- 2026Dynamic Mixed-Precision Routing for Efficient Multi-step LLM Interaction