Dynamic Thinking-Token Selection for Efficient Reasoning in Large Reasoning Models

Zhenyuan Guo, Tong Chen, Wenlong Meng, Chen Gong, Xin Yu +2 more
1/26/2026
cs.AIcs.CLcs.LG

No confident code implementation found for this paper.

Abstract

Large Reasoning Models (LRMs) excel at solving complex problems by explicitly generating a reasoning trace before deriving the final answer. However, these extended generations incur substantial memory footprint and computational overhead, bottlenecking LRMs' efficiency. This work uses attention maps to analyze the influence of reasoning traces and uncover an interesting phenomenon: only some decision-critical tokens in a reasoning trace steer the model toward the final answer, while the remaining tokens contribute negligibly. Building on this observation, we propose Dynamic Thinking-Token Selection (DynTS). This method identifies decision-critical tokens and retains only their associated Key-Value (KV) cache states during inference, evicting the remaining redundant entries to optimize efficiency.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{guo2026dynamic,
  title  = {Dynamic Thinking-Token Selection for Efficient Reasoning in Large Reasoning Models},
  author = {Zhenyuan Guo and Tong Chen and Wenlong Meng and Chen Gong and Xin Yu and Chengkun Wei and Wenzhi Chen},
  year   = {2026},
  eprint = {2601.18383},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.18383v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.18383.svg)](https://codeofpaper.com/paper/2601.18383)

Discussion