Saved in:
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.19970 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916759707058176 |
|---|---|
| author | Su, Jiayuan Lin, Fulin Feng, Zhaopeng Zheng, Han Wang, Teng Xiao, Zhenyu Zhao, Xinlong Liu, Zuozhu Cheng, Lu Wang, Hongwei |
| author_facet | Su, Jiayuan Lin, Fulin Feng, Zhaopeng Zheng, Han Wang, Teng Xiao, Zhenyu Zhao, Xinlong Liu, Zuozhu Cheng, Lu Wang, Hongwei |
| contents | Recent advances in Large Reasoning Models (LRMs) have significantly improved long-chain reasoning capabilities over Large Language Models (LLMs). However, LRMs often produce unnecessarily lengthy outputs even for simple queries, leading to inefficiencies or even accuracy degradation compared to LLMs. To overcome this, we propose CP-Router, a training-free and model-agnostic routing framework that dynamically selects between an LLM and an LRM, demonstrated with multiple-choice question answering (MCQA) prompts. The routing decision is guided by the prediction uncertainty estimates derived via Conformal Prediction (CP), which provides rigorous coverage guarantees. To further refine the uncertainty differentiation across inputs, we introduce Full and Binary Entropy (FBE), a novel entropy-based criterion that adaptively selects the appropriate CP threshold. Experiments across diverse MCQA benchmarks, including mathematics, logical reasoning, and Chinese chemistry, demonstrate that CP-Router efficiently reduces token usage while maintaining or even improving accuracy compared to using LRM alone. We also extend CP-Router to diverse model pairings and open-ended QA, where it continues to demonstrate strong performance, validating its generality and robustness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_19970 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | CP-Router: An Uncertainty-Aware Router Between LLM and LRM Su, Jiayuan Lin, Fulin Feng, Zhaopeng Zheng, Han Wang, Teng Xiao, Zhenyu Zhao, Xinlong Liu, Zuozhu Cheng, Lu Wang, Hongwei Computation and Language Recent advances in Large Reasoning Models (LRMs) have significantly improved long-chain reasoning capabilities over Large Language Models (LLMs). However, LRMs often produce unnecessarily lengthy outputs even for simple queries, leading to inefficiencies or even accuracy degradation compared to LLMs. To overcome this, we propose CP-Router, a training-free and model-agnostic routing framework that dynamically selects between an LLM and an LRM, demonstrated with multiple-choice question answering (MCQA) prompts. The routing decision is guided by the prediction uncertainty estimates derived via Conformal Prediction (CP), which provides rigorous coverage guarantees. To further refine the uncertainty differentiation across inputs, we introduce Full and Binary Entropy (FBE), a novel entropy-based criterion that adaptively selects the appropriate CP threshold. Experiments across diverse MCQA benchmarks, including mathematics, logical reasoning, and Chinese chemistry, demonstrate that CP-Router efficiently reduces token usage while maintaining or even improving accuracy compared to using LRM alone. We also extend CP-Router to diverse model pairings and open-ended QA, where it continues to demonstrate strong performance, validating its generality and robustness. |
| title | CP-Router: An Uncertainty-Aware Router Between LLM and LRM |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2505.19970 |