dorsal/arxiv
View SchemaORBIT: On-policy Exploration-Exploitation for Controllable Multi-Budget Reasoning
| Authors | Kun Liang, Clive Bai, Xin Xu, Chenming Tang, Sanwoo Lee, Weijie Liu, Saiyong Yang, Yunfang Wu |
|---|---|
| Categories | |
| ArXiv ID | 2601.08310vv1 |
| URL | https://arxiv.org/abs/2601.08310 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Recent Large Reasoning Models (LRMs) achieve strong performance by leveraging long-form Chain-of-Thought (CoT) reasoning, but uniformly applying overlong reasoning at inference time incurs substantial and often unnecessary computational cost. To address this, prior work explores various strategies to infer an appropriate reasoning budget from the input. However, such approaches are unreliable in the worst case, as estimating the minimal required reasoning effort is fundamentally difficult, and they implicitly fix the trade-off between reasoning cost and accuracy during training, limiting flexibility under varying deployment scenarios. Motivated by these limitations, we propose ORBIT, a controllable multi-budget reasoning framework with well-separated reasoning modes triggered by input. ORBIT employs multi-stage reinforcement learning to discover Pareto-optimal reasoning behaviors at each effort, followed by on-policy distillation to fuse these behaviors into a single unified model. Experiments show that ORBIT achieves (1) controllable reasoning behavior over multiple modes, (2) competitive reasoning density within each mode, and (3) integration of these frontier policies into a single unified student model while preserving clear mode separation and high per-mode performance.
{
"annotation_id": "198bbde9-fb73-4344-96a7-b89a63b16b5b",
"date_created": "2026-02-17T05:53:16.284000Z",
"date_modified": "2026-02-17T05:53:16.284000Z",
"file_hash": "3af7f1dc1d009386dbb1e5e37b8d3d998fb5cdb6757ce89fe9a059aca53ef266",
"private": false,
"record": {
"abstract": "Recent Large Reasoning Models (LRMs) achieve strong performance by leveraging long-form Chain-of-Thought (CoT) reasoning, but uniformly applying overlong reasoning at inference time incurs substantial and often unnecessary computational cost. To address this, prior work explores various strategies to infer an appropriate reasoning budget from the input. However, such approaches are unreliable in the worst case, as estimating the minimal required reasoning effort is fundamentally difficult, and they implicitly fix the trade-off between reasoning cost and accuracy during training, limiting flexibility under varying deployment scenarios. Motivated by these limitations, we propose ORBIT, a controllable multi-budget reasoning framework with well-separated reasoning modes triggered by input. ORBIT employs multi-stage reinforcement learning to discover Pareto-optimal reasoning behaviors at each effort, followed by on-policy distillation to fuse these behaviors into a single unified model. Experiments show that ORBIT achieves (1) controllable reasoning behavior over multiple modes, (2) competitive reasoning density within each mode, and (3) integration of these frontier policies into a single unified student model while preserving clear mode separation and high per-mode performance.",
"arxiv_id": "2601.08310",
"authors": [
"Kun Liang",
"Clive Bai",
"Xin Xu",
"Chenming Tang",
"Sanwoo Lee",
"Weijie Liu",
"Saiyong Yang",
"Yunfang Wu"
],
"categories": [
"cs.LG",
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "ORBIT: On-policy Exploration-Exploitation for Controllable Multi-Budget Reasoning",
"url": "https://arxiv.org/abs/2601.08310",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "fdda3ac2-5d9f-44a3-b296-1445406908bb",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}