SearcharxivSearch

arXiv subjects

Kayla Lee

Publications and source records attributed to Kayla Lee.

2 recordsLinked to original sources

Extracting Search Trees from LLM Reasoning Traces Reveals Myopic Planning

Large language models (LLMs), especially reasoning models, generate extended chain-of-thought (CoT) reasoning that often contains explicit deliberation over future outcomes. Yet whether this deliberation constitutes genuine planning, how it is structured, and what aspects of it drive performance remain poorly understood. In this work, we introduce a new method to characterize LLM planning by extracting and quantifying search trees from reasoning traces in the four-in-a-row board game. By fitting computational models on the extracted search trees, we characterize how plans are structured and how they influence move decisions. We find that LLMs' search is shallower than humans', and that performance is predicted by search breadth rather than depth. Most strikingly, although LLMs expand deep nodes in their traces, their move choices are best explained by a myopic model that ignores those nodes entirely. A causal intervention study where we selectively prune CoT paragraphs further suggests that move selection is driven predominantly by shallow rather than deep nodes. These patterns contrast with human planning, where performance is driven primarily by deep search. Together, our findings reveal a key difference between LLM and human planning: while human expertise is driven by deeper search, LLMs do not act on deep lookahead. This dissociation offers targeted guidance for aligning LLM and human planning. More broadly, our framework provides a generalizable approach for interpreting the structure of LLM planning across strategic domains.

cs.AI

Sparse analytic systems

Erd\H{o}s \cite{MR168482} proved that the Continuum Hypothesis (CH) is equivalent to the existence of an uncountable family $\mathcal{F}$ of (real or complex) analytic functions, such that $\big\{ f(x) \ : \ f \in \mathcal{F} \big\}$ is countable for every $x$. We strengthen Erd\H{o}s' result by proving that CH is equivalent to the existence of what we call \emph{sparse analytic systems} of functions. We use such systems to construct, assuming CH, an equivalence relation $\sim$ on $\mathbb{R}$ such that any "analytic-anonymous" attempt to predict the map $x \mapsto [x]_\sim$ must fail almost everywhere. This provides a consistently negative answer to a question of Bajpai-Velleman \cite{MR3552748}.

math.LO