Saved in:
Bibliographic Details
Main Authors: Wang, Zihan, Dong, Yijun, Lei, Qi
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.00306
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911474507579392
author Wang, Zihan
Dong, Yijun
Lei, Qi
author_facet Wang, Zihan
Dong, Yijun
Lei, Qi
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2603_00306
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle When does Chain-of-Thought Help: A Markovian Perspective
Wang, Zihan
Dong, Yijun
Lei, Qi
Machine Learning
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.
title When does Chain-of-Thought Help: A Markovian Perspective
topic Machine Learning
url https://arxiv.org/abs/2603.00306