CORTEXA
← Browse
arxivcs.LGcs.AI2026-07-20

An Analysis of Residual-Stream Geometry Across Transformer Depth

Sunit Bhattacharya, Ravi Shankar Kolli

We propose a transition-centred geometric analysis of transformer residual streams. Relative displacement measures how \emph{far} representations move between consecutive layers, and orthogonal Procrustes analysis separates each transition into a rigid rotation and a non-rigid residual. Across six instruction-tuned models, on code generation and cross-lingual translation, these measurements reveal reproducible depth regularities. Relative displacement is strongly layer-dependent; typically larger early and late, with a quieter middle third; and nearly invariant across conditions within each model. Rotation magnitude is nearly constant across depth, while Procrustes residual and angle concentration remain depth-modulated, with residual peaking at the final transition. During generation, non-English targets show larger final-layer displacement and residual than English targets. We present these as descriptive geometric regularities, not as measures of computational effort or causal explanations. The contribution is a measurement framework for residual-stream transitions and evidence that, in the settings studied here, depth curves are model-dependent and largely condition-stable.

View free PDFSource page

Related papers

arxivcs.CLcs.AIcs.LG2026-06-26

VASAE: Naming SAE Dictionary Directions with Vocabulary-Aligned Anchoring

Kairui Zhang, Ziwen Yu, Zahraa S. Abdallah, Martha Lewis

Sparse autoencoders (SAEs) provide useful decompositions of Transformer residual streams, but their learned features are usually named post hoc rather than directly connected to the Transformer's token vocabulary. We introduce Vocabulary-Aligned Sparse Autoencoder (VASAE), a meth…

View free PDFSource page
arxivcs.LGcs.AI2026-07-03

LACE-SVD: Loss-Aware SVD with Cumulative Error Correction for LLM Compression

Zhuowen Liu, Longkun Hao, Shiyu Feng, Xiaowen Chang, Ruiqun Li, Changqun Li

The rapid growth in the parameter scale of large language models (LLMs) has created a strong demand for efficient compression techniques. As a hardware-agnostic and highly compatible approach, low-rank compression has been widely adopted to reduce both memory footprint and comput…

View free PDFSource page