Nov 2026· Proceedings of the 35th ACM International Conference on Information and Knowledge Management· 0 citations· 6 references
TL;DR
CriticRouter is a verifier-free step-wise routing framework that reduces redundancy based on structural criticality as a routing signal, and achieves comparable accuracy to standard LLM reasoning while significantly reducing latency, demonstrating a better utility-efficiency trade-off.
Abstract
Large reasoning models (LRMs) achieve strong performance on complex reasoning tasks, but their long chain-of-thought trajectories incur substantial inference latency and computational cost. Small-large model collaborative reasoning mitigates this issue by offloading part of the reasoning steps to a small language model (SLM) while preserving large language model (LLM) computation for more demanding steps. Existing draft-and-verify methods use an external verifier to reject low-scoring SLM steps and regenerate them with the LLM, introducing per-step verification overhead. Moreover, we observe that many LLM rewrites remain semantically close to the rejected SLM drafts, causing unnecessary decoding cost. Further analysis shows that these redundant rewrites often occur on local derivation steps, whose content is largely constrained by recent context. Motivated by these observations, we propose CriticRouter, a verifier-free step-wise routing framework that reduces redundancy based on structural criticality as a routing signal. Specifically, structural criticality measures how sensitive the SLM's next-step generation is to perturbations in earlier reasoning history, and low-criticality steps are viewed as locally stable and delegated to the SLM, whereas high-criticality steps are treated as history-sensitive and routed to the LLM. To reduce probing overhead, CriticRouter further adopts short concurrent probes and progressive mask advancement for better cache reuse. Experiments on multiple benchmarks show that CriticRouter achieves comparable accuracy to standard LLM reasoning while significantly reducing latency, demonstrating a better utility-efficiency trade-off.
Long-horizon reasoning improves complex question answering but often requires expensive chain-of-thought generation and may transfer shortcut-sensitive fragments during distillation. This paper addresses the focused problem of learning a compact student model that preserves decision-relevant logic while reducing shortc...
Jiang-Bo Feng, Jin-Chao Guo, Yu-Xiang He et al.· International journal of pat...· 0 citations
This work proposes When2Think, an RLVR-based post-training framework for instance-adaptive computation allocation that requires neither a learned reward model nor a learned critic, and offline reference caching avoids online reference-model queries during policy updates.
Jaejun Shim, Hyunjin Kim, Young Jin Kim et al.· 1 citation
While Chain-of-Thought (CoT) prompting improves the reasoning performance of large language models (LLMs), recent studies have shown that final answers do not always depend on the generated rationales. In particular, LLMs may rely on query-specific shortcuts rather than the information provided by their reasoning steps...
Large language models increasingly solve multi-step reasoning tasks, where a single sampled chain of reasoning is frequently unreliable. Reaching a correct answer therefore requires aggregating many sampled reasoning paths into one trustworthy decision. The dominant family, self-consistency and its sampling-and-voting...
Hao Chen, Xinke Jiang, Kai-Qi Huang et al.· Proceedings of the 35th ACM...· 0 citations
Small language models (SLMs) offer a promising foundation for on-device agents through low-latency, resource-efficient inference, yet limited reasoning and planning capabilities constrain their performance on long-horizon tasks requiring multi-step interaction with the environment. Step-level collaboration between SLMs...
Zhe-Wei Fang, Yu-Xin Zhang, Zhen-Wei Shao et al.· 2 citations
Large reasoning models achieve strong performance on challenging tasks, but their long chain-of-thought often incurs substantial inference costs by continuing to deliberate after sufficient information has been obtained. Existing reasoning compression methods primarily operate on reasoning trajectories, paying less att...
Mu-Yao Yuan, Li-Yan Xu, Wei-Zhan Zhang et al.· 0 citations