paper-with-me

Papers

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

2026-01-15 · Vansh Kapoor, Aman Gupta, Hao Chen, Anurag Beniwal, Jing Huang, Aviral Kumar 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 steps$\unicode{x2013}$those likely to derail the solution$\unicode{x2013}$to 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.

📄 PDF Abstract BibTeX arXiv:2601.10245

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Rethinking Stepwise Model Routing: A Cost-Efficient Table Reasoning Perspective

2026-05-28 · Shenghao Ye, Yuxiang Wang, Yu Guo, Dong Jin 외 arxiv

Large Reasoning Models (LRMs) achieve strong performance on table reasoning tasks but incur substantial inference cost due to long reasoning traces. Stepwise model routing mitigates this issue by dynamically assigning re…

Policy-Guided Stepwise Model Routing for Cost-Effective Reasoning

2026-05-07 · Wenwen Si, Insup Lee, Osbert Bastani arxiv

Inference-time computation has greatly enhanced the performance of large language models (LLMs) on challenging reasoning tasks, but this strategy can incur high inference costs. One solution is to route intermediate chai…

Reinforcement Learning

Confidence-Guided Stepwise Model Routing for Cost-Efficient Reasoning

2025-11-09 · Sangmook Lee, Dohyung Kim, Hyukhun Koh, Nakyeong Yang 외 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 low…

Mathematical Reasoning

Rubric-Guided Process Reward for Stepwise Model Routing

2026-05-28 · Shenghao Ye, Yu Guo, Zhengheng Li, Shuangwu Chen 외 arxiv

Stepwise model routing improves the efficiency of Large Reasoning Models (LRMs) by assigning each reasoning step to a suitable model. Recent methods formulate routing as a sequential decision process and train the router…

Reinforcement Learning

EnergyNet: Energy-Efficient Dynamic Inference

2018-10-20 · NIPS Workshop CDNNRIA 2018 · Yue Wang, Tan Nguyen, Yang Zhao, Zhangyang Wang 외

The prohibitive energy cost of running high-performance Convolutional Neural Networks (CNNs) has been limiting their deployment on resource-constrained platforms including mobile and wearable devices. We propose a CNN fo…