No Global Plan in Chain-of-Thought: Uncover the Latent Planning Horizon of LLMs

Liyan Xu, Mo Yu, Fandong Meng, Jie Zhou
2/2/2026
cs.LGcs.CL

Official code: lxucs/tele-lens (7 stars, Apache-2.0, last commit 2026-02-03).

Abstract

This work stems from prior complementary observations on the dynamics of Chain-of-Thought (CoT): Large Language Models (LLMs) is shown latent planning of subsequent reasoning prior to CoT emergence, thereby diminishing the significance of explicit CoT; whereas CoT remains critical for tasks requiring multi-step reasoning. To deepen the understanding between LLM's internal states and its verbalized reasoning trajectories, we investigate the latent planning strength of LLMs, through our probing method, Tele-Lens, applying to hidden states across diverse task domains. Our empirical results indicate that LLMs exhibit a myopic horizon, primarily conducting incremental transitions without precise global planning. Leveraging this characteristic, we propose a hypothesis on enhancing uncertainty estimation of CoT, which we validate that a small subset of CoT positions can effectively represent the uncertainty of the entire path. We further underscore the significance of exploiting CoT dynamics, and demonstrate that automatic recognition of CoT bypass can be achieved without performance degradation. Our code, data and models are released at https://github.com/lxucs/tele-lens.

View on arXivView PDF

Code Implementations(1)

lxucs/tele-lensOfficial100%
Apache-2.0

Code and data for the paper "No Global Plan in Chain-of-Thought: Uncover the Latent Planning Horizon of LLMs".

72PythonFeb 2, 20268 months agoApache-2.0
cotllmprobing

Similar Papers

Cite this paper

@article{xu2026global,
  title  = {No Global Plan in Chain-of-Thought: Uncover the Latent Planning Horizon of LLMs},
  author = {Liyan Xu and Mo Yu and Fandong Meng and Jie Zhou},
  year   = {2026},
  eprint = {2602.02103},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.02103v1}
}

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/2602.02103.svg)](https://codeofpaper.com/paper/2602.02103)

Discussion