When does Chain-of-Thought Help: A Markovian Perspective

Zihan Wang, Yijun Dong, Qi Lei
2/27/2026
cs.LG

No confident code implementation found for this paper.

Abstract

Chain-of-Thought (CoT) prompting is a widely used inference-time technique for improving reasoning, yet its gains are uneven across tasks. We analyze when and why CoT helps by modeling the step-wise reasoning trajectory as a Markov chain. Each intermediate step is a state and the dependence between steps is captured by a transition kernel. Our theory identifies transition alignment, whether instances share a common step-wise transition kernel, as the key determinant of CoT's effectiveness. When transitions are identical across steps, CoT reduces inference-time sample complexity: fewer context sample trajectories suffice to recover the final decision. In contrast, when transitions differ across steps, these gains can vanish. We further quantify how noise in intermediate steps modulates CoT's benefit. Beyond theory, we design synthetic benchmarks that isolate these factors to complement prior results on real-world tasks and to empirically validate our predictions.

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{wang2026when,
  title  = {When does Chain-of-Thought Help: A Markovian Perspective},
  author = {Zihan Wang and Yijun Dong and Qi Lei},
  year   = {2026},
  eprint = {2603.00306},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.00306v1}
}

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

Discussion