Sign inGet started
Paper · arXiv

Efficiently Learning To Reason or Not to Reason: Root-token Policy Optimization for Adaptive Thinking

Large reasoning models (LRMs) achieve strong performance by externalizing explicit reasoning traces before producing the answer, yet suffer from overthinking challenge that allocates uniformly heavy computation to queries of varying difficulty. While proprietary models mitigate this via opaque routing, open-source LRMs still lack an efficient mechanism to internalize adaptive reasoning due to both expensive training cost and limited disclosure of training recipes. In response, we introduce RPO (Root-token Policy Optimization), a framework that enables LRMs to self-determine when to reason by training only the initial root token (e.g., whether to invoke the <think> tag) via group relative ...

AuthorsTaehyeon Kim, Hyunsoo Lee, Youngsoo Jang et al.
Primary categorycs.CL
Published13 October 2026
Last updated at source13 October 2026
cs.CLcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/99ef15e1-4e32-4a8e-9a34-fce47cd3367a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 15 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.