On the Multi-Index, Multi-Rate, and Multi-Phase Dynamics of Decoder-Only Language Models: A Unified Hybrid Framework for Generative and Agentic Systems
Ali Pakniyat
Abstract
Large language models (LLMs) are increasingly deployed as computational engines in autonomous decision-making and planning loops, yet their systems and control treatment remains hindered by architectural simplifications, index conflations, and informal descriptions of tool interactions. This paper presents a control-theoretic formulation of decoder-only language models as multi-index, multi-rate systems, and sets the stage for a stochastic hybrid systems framework to govern the multi-phase dynamics of agentic tool interaction. We formalize the architecture across three hierarchically coupled evolution indices: (i) an ultrafast feedforward cascade of transformer blocks across layer depth, where layer normalization is cast as a spherical projection and key--value caching is proven to be an exact internal state realization via causal prefix invariance; (ii) an uncontrolled stochastic difference recursion over token generation steps, where finite context truncation induces a time-homogeneous Markov chain; and (iii) an autonomous mode-switching mechanism governing transitions between token generation and tool execution regimes, where tool invocations are triggered upon trajectory arrival at switching manifolds, followed by exogenous state jump maps that augment the context string with external observations. By defining a prompt-dependent evaluator over successive evaluable claims, we obtain a task-level error process whose fault-free histories and expected error growth admit bounds under conditional fault-hazard and error-drift assumptions.
Create a lesson
Related papers
Randomized Matvec Lower Bounds for Simplex-Based Matrix Games
Wendao Wu, Cong Fang
Optimal Stochastic Bilevel Optimization with First-Order Oracles
Linxuan Pan, Junchi Yang
Recognizing Signomial Convexity is Hard
Rui Zheng, Iosif Sakos, Antonios Varvitsiotis
Simplifying the computation of weak- second subderivatives of convex functionals via Γ-convergence
Gerd Wachsmuth
Routing in Line Networks with Handling Times
Gabriel Deza, Michal Tzur, Tal Raviv
Lower Bounds for Stochastic First-Order Algorithms with Variance Reduction in Nonconvex--Concave Minimax Optimization
Jiayi Song, Zi Xu