Skip to content

Context Staircase: Signature-Aligned Dynamics of Token Embeddings under Small Initialization

Aug 2026 · 0 citations
Computer Science

TL;DR

A dynamic explanation of how data statistics and architecture jointly shape token embeddings in language models is provided, and an implicit bias in the space of data statistics is revealed: training proceeds from simpler, low-order statistical relations toward increasingly complex, context-dependent ones.

Abstract

Token embeddings are the basic representational units that connect discrete tokens with continuous computation in language models. Although modern language models learn embeddings from random initialization through gradient-based training, the dynamical mechanism by which meaningful embedding structures emerge remains unclear. In this work, we identify that the evolving embedding structures are closely related to token-conditioned label and contextual distributions, which we formalize as probability signatures. We observe a progressive learning process, which we term Context Staircase: embeddings learn the low-order statistic signatures of the data before the high-order ones. More specifically, we observe that early in training they align with the simplest, context-free signature linking a token to its label, and as training proceeds, they progressively reflect signatures involving more and more context tokens. We then analyze the gradient flow of embeddings under small initialization to explain this phenomenon, deriving embedding evolution equations for feed-forward and self-attention architectures. We further extend these observations to real language-model training. Finally, we show that these embedding structures play an important role in both task learning and the incorporation of semantic structure into the embedding space. Overall, our results provide a dynamic explanation of how data statistics and architecture jointly shape token embeddings in language models, and reveal an implicit bias in the space of data statistics: training proceeds from simpler, low-order statistical relations toward increasingly complex, context-dependent ones.

View source

Similar papers

#machine learning Preprint Aug 2026

Learning Representations through Token Prediction: Geometry, Approximation, and Downstream Guarantees

A statistical framework connecting token prediction with representation geometry, encoder approximation, and downstream performance is developed, introducing a self-consistency principle showing that repeated applications of a shared representation block can progressively refine the contextual representation without in...

Shu-Lei Wang · 0 citations
Preprint Aug 2026

ConvergeFlow: Language Flow with Provable Convergence to Token Embeddings

An embedding-space flow-based LM, which constrains the data predictor to the convex hull of token embeddings and trains it solely with the mean squared error objective induced by flow matching, enabling direct token prediction without a CE-supervised decoder.

Na Li, Yuchen Jiao, Chang-Xiao Cai et al. · 2 citations
#machine learning Preprint Sep 2026

Rethinking Soft Tokens for Parallel Decoding in Diffusion Language Models

Diffusion language models (DLMs) enable parallel generation by predicting and committing multiple tokens at each denoising step, yet they can generate individually plausible but mutually inconsistent tokens. Recent work shows that \emph{soft tokens} can mitigate this issue by representing uncertain positions with conti...

Kodai Kawamura, Kenji Kawaguchi, Anji Liu · 0 citations
#artificial intelligence Preprint Sep 2026

Contextual trajectory and incremental contextual displacement: Towards using LLMs to understand dynamic, utterance-specific meaning construction

Transformer-based large language models (LLMs) such as RoBERTa represent text using contextual word embeddings (CWEs), which alter the embeddings associated with each token based on surrounding context. We construct token-wise incremental trajectories by repeatedly recomputing a token's CWE as successive words are adde...

Grayson Wycliffe Storer, J. Zimmerman · 0 citations
#artificial intelligence Preprint Sep 2026

Rules Amortize, Pairings Don't: Linguistic Structure Determines What Latent Task Representations Can Replace In-Context Learning

In-context learning (ICL) can be amortized into latent objects (task vectors, function vectors, context vectors) that recover few-shot behavior at zero-shot inference cost, but recent theory shows a static vector acts as a single synthetic demonstration and must fail on high-rank mappings such as word-level bijections....

Gunmay Jhingran · 0 citations
#natural language process... Preprint Sep 2026

Selecting What Matters: Semantic Compression-Guided Selective Pooling for Long-Context Embeddings

SCSP is a training-free framework that leverages semantic compression for informative token selection in long-context embedding and can be integrated into both zero-shot and fine-tuned models in a plug-and-play manner, consistently improving their performance.

Zi-Feng Cheng, Jie Zheng, Zhiwei Jiang et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.