paper-with-me

홈 › Papers

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

2026-02-27 · Zihan Wang, Yijun Dong, Qi Lei arxiv

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.

📄 PDF Abstract BibTeX arXiv:2603.00306

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Contrastive Chain-of-Thought Prompting

2023-11-15 · Yew Ken Chia, Guizhen Chen, Luu Anh Tuan, Soujanya Poria 외

Despite the success of chain of thought in enhancing language model reasoning, the underlying process remains less well understood. Although logically sound reasoning appears inherently crucial for chain of thought, prio…

Language ModelingLanguage Modellingvalid

Knowing Before Saying: LLM Representations Encode Information About Chain-of-Thought Success Before Completion

2025-05-30 · Anum Afzal, Florian Matthes, Gal Chechik, Yftah Ziser

We investigate whether the success of a zero-shot Chain-of-Thought (CoT) process can be predicted before completion. We discover that a probing classifier, based on LLM representations, performs well \emph{even before a …

Adapting to Mixing Time in Stochastic Optimization with Markovian Data

2022-02-09 · Ron Dorfman, Kfir Y. Levy

We consider stochastic optimization problems where data is drawn from a Markov chain. Existing methods for this setting crucially rely on knowing the mixing time of the chain, which in real-world applications is usually …

Stochastic Optimization

Can Separators Improve Chain-of-Thought Prompting?

2024-02-16 · Yoonjeong Park, HyunJin Kim, Chanyeol Choi, JunSeong Kim 외

Chain-of-thought (CoT) prompting is a simple and effective method for improving the reasoning capabilities of Large Language Models (LLMs). The basic idea of CoT is to let LLMs break down their thought processes step-by-…

8kGSM8K

Adaptive KL-UCB based Bandit Algorithms for Markovian and i.i.d. Settings

2020-09-14 · Arghyadip Roy, Sanjay Shakkottai, R. Srikant

In the regret-based formulation of Multi-armed Bandit (MAB) problems, except in rare instances, much of the literature focuses on arms with i.i.d. rewards. In this paper, we consider the problem of obtaining regret guara…