Probing Geometry of Next Token Prediction Using Cumulant Expansion of the Softmax Entropy
Karthik Viswanathan, Sang Eon Park
TL;DR
The paper tackles how large language models internalize higher-order statistics in next-token prediction by introducing a cumulant-expansion framework for the softmax entropy. It defines a center distribution $p(\boldsymbol{\mu})$ and derives cumulants $\kappa_n^{p_β(\mathbf{X})}$ to quantify higher-order correlations in logit space, then validates the approach with experiments on GPT-2 and Pythia using Pile-10K prompts. Key findings show that structured prompts induce depth-dependent rise and plateau in higher-order cumulants, shuffled prompts remain flat, cumulants grow monotonically during training, and math prompts exhibit distinct cumulant signatures from general text. Overall, cumulants offer a mathematically grounded, lightweight probe of feature-learning dynamics in high-dimensional neural networks, with potential implications for prompt design and diagnostic tooling. $\langle S(\mathbf{X})\rangle = S(\boldsymbol{\mu}) - \frac{1}{N} \sum_{n=2}^{\infty} \frac{\beta^n}{n!} \kappa^{p_β(\mathbf{X})}_n(-\sum_i\delta X_i)$ provides the central link between observable entropy and higher-order structure.
Abstract
We introduce a cumulant-expansion framework for quantifying how large language models (LLMs) internalize higher-order statistical structure during next-token prediction. By treating the softmax entropy of each layer's logit distribution as a perturbation around its "center" distribution, we derive closed-form cumulant observables that isolate successively higher-order correlations. Empirically, we track these cumulants in GPT-2 and Pythia models on Pile-10K prompts. (i) Structured prompts exhibit a characteristic rise-and-plateau profile across layers, whereas token-shuffled prompts remain flat, revealing the dependence of the cumulant profile on meaningful context. (ii) During training, all cumulants increase monotonically before saturating, directly visualizing the model's progression from capturing variance to learning skew, kurtosis, and higher-order statistical structures. (iii) Mathematical prompts show distinct cumulant signatures compared to general text, quantifying how models employ fundamentally different processing mechanisms for mathematical versus linguistic content. Together, these results establish cumulant analysis as a lightweight, mathematically grounded probe of feature-learning dynamics in high-dimensional neural networks.
