Auto-regressive language models are incredibly powerful, yet a deep theoretical understanding of why the simple negative log-likelihood (NLL) objective works so well remains elusive. This work introduces a unifying framework using Markov Categories to deconstruct the generation process and the NLL objective.
We model the single-step generation map as a composition of Markov kernels, which lets us precisely analyze information flow and the geometry of the learned representation space. Our core finding is that NLL training is an implicit form of spectral contrastive learning: it forces the model's representation space to align with the eigenspectrum of a predictive similarity operator, learning a geometrically structured space without explicit contrastive pairs. This perspective reveals deep structural principles underlying the effectiveness of modern LMs.
