mlsanityData to 14 Oct 2026

TRIM: Hybrid Inference via Targeted Stepwise Routing in Multi-Step Reasoning Tasks

arXiv 2601.10245 ↗First posted 15 Jan 2026cs.AI cs.CL cs.LGcited by 8

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Multi-step reasoning tasks like mathematical problem solving are vulnerable to cascading failures, where a single incorrect step leads to complete solution breakdown. Current LLM routing methods assign entire queries to one model, treating all reasoning steps as equal. We propose TRIM (Targeted routing in multi-step reasoning tasks), which routes only critical stepsunicodex2013those likely to derail the solutionunicodex2013to larger models while letting smaller models handle routine continuations. Our key insight is that targeted step-level interventions can fundamentally transform inference efficiency by confining expensive calls to precisely those steps where stronger models prevent cascading errors. TRIM operates at the step-level: it uses process reward models to identify erroneous steps and makes routing decisions based on step-level uncertainty and budget constraints. We develop several routing strategies within TRIM, ranging from a simple threshold-based policy to more expressive policies that reason about long-horizon accuracy-cost trade-offs and uncertainty in step-level correctness estimates. On MATH-500, even the simplest thresholding strategy surpasses prior routing methods with 5x higher cost efficiency, while more advanced policies match the strong, expensive model's performance using 80% fewer expensive model tokens. On harder benchmarks such as AIME, TRIM achieves up to 6x higher cost efficiency. All methods generalize effectively across math reasoning tasks, demonstrating that step-level difficulty represents fundamental characteristics of reasoning.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 22 of its 32 references that are in the map. First posted on arXiv 15 Jan 2026.

Builds on

22 of 32 references.

Closest ancestors · 5

Same direction, newest first

  1. 2025GPO: Learning from Critical Steps to Improve LLM Reasoning19 Sep
  2. 2025SpecReason: Fast and Accurate Inference-Time Compute via Speculative Reasoning10 Apr
  3. 2025Reward-Guided Speculative Decoding for Efficient LLM Reasoning31 Jan
  4. 2024Critical Tokens Matter: Token-Level Contrastive Estimation Enhances LLM's Reasoning Capability29 Nov
  5. 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters6 Aug

Other references · 17

  1. 2025Qwen3 Technical Reportcited by 8,820
  2. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
  3. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  4. 2024OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problemscited by 1,136
  5. 2023Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotationscited by 928
  6. 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 843
  7. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 682
  8. 2025Kimi K2: Open Agentic Intelligencecited by 567
  9. 2025Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoningcited by 559
  10. 2024Improve Mathematical Reasoning in Language Models by Automated Process Supervisioncited by 441
  11. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 372
  12. 2024ProcessBench: Identifying Process Errors in Mathematical Reasoningcited by 292
5 more
  1. 2024Rewarding Progress: Scaling Automated Process Verifiers for LLM Reasoningcited by 279
  2. 2023Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Modelscited by 145
  3. 2023AutoMix: Automatically Mixing Language Modelscited by 125
  4. 2025Optimizing Test-Time Compute via Meta Reinforcement Fine-Tuningcited by 123
  5. 2025BEST-Route: Adaptive LLM Routing with Test-Time Optimal Computecited by 67

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 8.

8 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Policy-Guided Stepwise Model Routing for Cost-Effective Reasoning
  2. 2025Confidence-Guided Stepwise Model Routing for Cost-Efficient Reasoning
  3. 2026Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective
  4. 2025Optimizing Reasoning Efficiency through Prompt Difficulty Prediction
  5. 2023Let's reward step by step: Step-Level reward model as the Navigators for Reasoning
  6. 2025Stepwise Reasoning Checkpoint Analysis: A Test Time Scaling Method to Enhance LLMs' Reasoning
  7. 2025From Long to Short: LLMs Excel at Trimming Own Reasoning Chains
  8. 2026Stepwise Penalization for Length-Efficient Chain-of-Thought Reasoning