This work formulate multi-turn reasoning as a hidden-state trajectory of the underlying LLM that is characterized via two complementary signals: temporal curvature that captures the directional consistency of turn-to-turn updates, and variance slope which measures the expansion or contraction of the exploration space.
Abstract
LLM agents need to sustain goal-consistent reasoning across long multi-turn interactions under strict resource constraints. However, as the multi-turn context accumulates, it can destabilize the underlying LLM's internal representation of task-relevant information from earlier turns, blurring the boundary between constructive reasoning and representation drift. We formulate multi-turn reasoning as a hidden-state trajectory of the underlying LLM that is characterized via two complementary signals: temporal curvature that captures the directional consistency of turn-to-turn updates, and variance slope which measures the expansion or contraction of the exploration space. Across four tasks and three underlying LLMs, we observed that these geometric signals distinguish between correct and incorrect episodes prior to completion. We further decompose each episode into three-action chains formed from four actions (Read, Write, Respond, Transfer) and show that separability is action-dependent, with different signals distinguishing various chain patterns. Our experiments demonstrate that trajectory geometry can identify critical turns in the reasoning process, increasing task success rates on $\tau$-Bench from 24.1% to 39.6% while reducing token cost by 11.2%.
This work instantiates AutoCRAT, a decoder-side controller for frozen backbones that operates over a discrete action space and updates control decisions only at semantic boundaries, improving stability while remaining responsive to the evolving reasoning process.
Han-Jun Luo, Qiu-Shi Liu, Jing-Yang Zhang et al.· 0 citations
This work introduces answer-distribution trajectories, a stochastic-dynamics-inspired representation that tracks the model's full predictive distribution over answers as reasoning unfolds, and suggests that answer-distribution trajectories provide a rich framework for analysing and evaluating the dynamics of LLM reason...
M. Catala, Haitz Sáez de Ocáriz Borde, D. Murari et al.· 1 citation
UQ methods developed for single generations should be revalidated at the trajectory level, with careful attention to the consistency measurement, aggregator choice, and computational budget.
It is suggested that reasoning validity is better read from state-conditioned motion than from either static states or decontextualized trajectories alone, andlations show that motion, region, and direction provide complementary signals.
Hamed Damirchi, I. M. De La Jara, D. Ranasinghe et al.· 0 citations
This work proposes ReDiR, a generation-time defense that conditions action generation on trajectory-level security evidence and reduces attack success rates to below 8%, transfers to unseen tool domains, and preserves benign fidelity with low computational overhead.
Yanbo Dai, Zhenlan Ji, Zong-Jie Li et al.· 0 citations
A Graph-based Faithful sTep-level credit-assignment framework (GRAFT) that grafts all rollout trajectories into a trajectory graph, recovering node state-values via Bellman iteration on the graph, and assigning credit to each edge by the node value difference is proposed.
Xin-Cheng Yao, Haobo Fu, Wei-Ming Liu et al.· 0 citations