Definition
Given a set of embedding vectors with covariance , decompose . Dimensional collapse is the empirical finding that a substantial number of the sorted singular values decay toward (numerical) zero — the embedding population occupies an effective linear subspace of dimension , not merely a directionally-skewed cloud that still uses every dimension.
Relative to anisotropy
Anisotropy and dimensional collapse are both distribution-property
statistics of the same activation cloud, but they measure different
things: anisotropy is about directional concentration (do vectors point
similarly, measured via mean pairwise cosine or the mean-direction norm)
and survives even at full rank (a full-rank cloud can still be
directionally skewed); dimensional collapse is about rank (how many
singular values of the covariance are non-negligible) and can occur even
in a directionally-isotropic cloud restricted to a genuine subspace.
Anisotropy is dominated by outlier directions; dimensional collapse is
dominated by outlier (near-zero) singular values — a cone vs. a flat
disk, in the ambient space.
Key evidence
Jing, Vincent, LeCun & Tian (2022) find dimensional collapse in
contrastive self-supervised learning (SimCLR, ResNet-50, ImageNet):
sorting singular values of the embedding covariance and plotting against rank index shows a number of singular values
collapsing to numerical zero, both in the 128-dim contrastive embedding
head and in the 2048-dim backbone representation itself when the
projector head is removed. They prove two independent causes for a linear
model trained with InfoNCE under gradient flow: (1) strong
augmentation — when augmentation variance along a direction exceeds the
data’s own variance along it, gradient flow drives ‘s weight toward
zero along that direction (Lemma 1); (2) implicit regularization — for
an over-parameterized multi-layer linear network (), SGD
dynamics push the product’s singular values toward low rank even under
weak augmentation, an effect specific to networks with more than one layer
(Corollary 2), verified in a toy 16x16 linear MLP. See
contrastive-ssl-embeddings-undergo-provable-rank-collapse-of-the-covariance-spectrum-under-strong-augmentation-and-multilayer-implicit-regularization.
Wang, Ge, Shu, He & Qiu (2025) find dimensional collapse within a single
transformer, comparing activation types rather than training regimes:
computing SVD-based intrinsic dimension (smallest number of directions
needed for 99% of variance) for attention-block outputs, MLP outputs, and
residual-stream activations, attention outputs consistently occupy only
about 60% of the ambient dimension across layers, model families and
datasets, while MLP outputs and the residual stream remain near full rank
at about 90% — a gap traced to the attention output projection matrix
compressing the concatenated per-head outputs. Evaluating the
open-source LlamaScope SAE suite on Llama-3.1-8B shows the number of dead
SAE features tracks this per-layer intrinsic dimension: lower-intrinsic-
dimension (more collapsed) activations have systematically more dead
features, and constraining SAE feature initialization to the activations’
own active subspace (rather than random init) cuts dead features from 87%
to below 1% in a 1M-feature attention-output SAE. See
attention-outputs-occupy-a-60-percent-intrinsic-dimension-subspace-versus-90-percent-for-mlp-and-residual-stream-and-subspace-constrained-sae-initialization-cuts-dead-features-from-87-percent-to-below-1-percent.
Li, Agrawal, Ghosh, Teru, Santoro, Lajoie & Richards (2025) track dimensional
collapse along a third axis — training time itself, across pretraining
checkpoints of OLMo (1B/7B, OLMo-2 1B/7B) and Pythia (160M-12B) — using
RankMe (Von Neumann entropy of the covariance eigenvalue distribution) and
alpha-ReQ (the eigenspectrum’s power-law decay exponent). Both statistics
trace the same non-monotonic three-phase trajectory in every model and
every layer tested: a “warmup” collapse, an “entropy-seeking” expansion
that tracks rising n-gram memorization, and a “compression-seeking” phase
of anisotropic consolidation (variance preserved along dominant
eigendirections, contracted — not zeroed — along others) that tracks a
sharp downstream-accuracy improvement (SciQ correlations up to r=0.89 with
RankMe, p<3e-4, across model scales). A formal linear-encoder derivation
(proven theorems, not just curve-fitting) shows this three-phase shape
requires both a skewed token-frequency distribution and a representational
bottleneck ; removing either condition eliminates compression-
seeking. Post-training pushes the same spectral statistics in opposite
directions: SFT/DPO drive further entropy-seeking (better in-distribution,
worse out-of-distribution performance) while RLVR drives compression-
seeking (better reward-aligned accuracy, less generation diversity). See
pretraining-passes-through-three-effective-rank-phases-tracking-n-gram-memorization-and-downstream-performance-explained-by-cross-entropy-plus-bottleneck-theory.
Queipo-de-Llano, Arroyo, Barbero, Dong, Bronstein, LeCun & Shwartz-Ziv
(2025) prove that massive residual-stream activations necessarily
induce representational compression (tight entropy-reduction and
spectral-dominance bounds), and track normalized representation
entropy, sink rate, and BOS-token norm across Pythia 410M/6.9B training
checkpoints (steps 1k-143k): compression valleys, attention sinks, and
massive activations emerge synchronized around step 1k and persist,
with the layer index of emergence fixed per model. Staged causal
ablation of the massive-activation mechanism progressively — and, when
fully ablated, completely — eliminates the compression valley,
confirming the theoretical link; broader validation extends to
GPT-OSS-20B and Gemma-7B. See
massive-residual-stream-activations-provably-cause-representational-compression-valleys-that-emerge-synchronized-with-attention-sinks-and-are-eliminated-by-staged-causal-ablation.
Vemula (2026) tests whether massive activations can be architecturally
designed away: training real decoder-only transformers from scratch on
FineWeb-Edu (160M/290M parameters) under four matched configurations
— vanilla, QK-normalized “suppress”, a novel Ledger-Residuals
architecture that splits the residual stream into a mutable
Deliberation stream and a protected, decode-only Commitment stream,
and a Commitment variant with a 6x stronger commit-sparsity penalty.
QK-normalization essentially removes the effect (fixed-dimension ratio
28.3 -> 6.8, start-token concentration 1.01 -> 0.13 at 290M), but the
architecturally-isolated Commitment stream rebuilds its own massive
activation at a different dimension (persistence 0.58, ratio 7.0,
concentration 3.36), and a stronger sparsity penalty makes the
re-emerged activation worse, not better (persistence rising to 0.96).
The same qualitative re-emergence replicates at 160M parameters. This
is evidence that massive activations are not merely an artifact of one
particular residual-stream design choice removable by architectural
isolation alone, complementing Sun et al.’s mechanistic account below
of why they form in standard architectures. See
vemula-2026-massive-activations-re-emerge-in-real-from-scratch-trained-transformers-under-a-protected-commitment-residual-stream-and-are-only-removed-by-qk-normalization.
Sun, Canziani, LeCun & Zhu (2026) trace the mechanism one level deeper:
SwiGLU feed-forward blocks act as directional quadratic amplifiers
producing massive activations along a shared “spike direction,” and
pre-norm RMSNorm’s bounded-range property collapses these tokens’
normalized key vectors into a low-dimensional, near-constant subspace
that “sink heads’” query subspaces geometrically align with — a
mechanistic account of attention-sink formation as geometric alignment
to a collapsed key subspace, rather than semantic relevance. Systematic
causal ablations on a controlled 7B model trained from scratch
(SwiGLU->GeLU/linear, Sandwich Norm/QKNorm/DynamicTanh, explicit
gating, training-context-length manipulation) show spikes and sinks can
be independently suppressed — e.g. DynamicTanh eliminates spikes
without hurting sinks or perplexity, while long-context-only training
sharply reduces sink ratio. See
swiglu-driven-massive-activations-collapse-into-a-low-dimensional-spike-key-subspace-that-geometrically-explains-attention-sink-formation-and-is-independently-suppressible-via-normalization-swaps.
A latent-reasoning-model study applies a four-metric shape suite
(Latent-trajectory shape metrics (entropy, effective rank, anisotropy, intrinsic dimension): entropy, effective rank,
anisotropy, intrinsic dimension) to Huginn-3.5B’s iterated latent-thought
states, finding incorrect reasoning trajectories collapse into flatter,
lower-entropy, lower-anisotropy regions of latent space relative to
correct trajectories, which instead trace a richer, higher-dimensional
path. The discovered correctness-predictive geometry is then used as a
training-time reward signal (Latent Thinking Optimization), rather than
via a direct steering/ablation intervention, so the finding rests on
criterion (a) alone. See
huginn-3-5bs-correct-latent-thought-trajectories-are-geometrically-distinguishable-from-incorrect-ones-via-entropy-effective-rank-anisotropy-and-intrinsic-dimension.
Li, Jia, Zhang, Li, Shi, Zhou, Zhu, Shen & Qu (2026) apply self-supervised
evaluation principles to diffusion models, decomposing internal features at
each noise level into an invariant component and a residual component and
computing the Invariant Contamination Ratio (a Fisher-based measure of
how much residual variation contaminates the invariant signal). In a real
pretrained diffusion model (Stable Diffusion), invariance peaks at
intermediate noise levels — the same levels that yield the best downstream
classification performance — and ICR tracks generative quality without
sampling and anticipates memorization onset during training. See
invariant-contamination-ratio-in-diffusion-model-features-identifies-optimal-noise-level-generative-quality-and-memorization-onset.
Grzywaczewski, Płudowski & Biecek (2026) precisely quantify the collapsed
(“noise”) subspace dimensionality in six real pretrained CLIP/SigLIP
vision-language models via a sharp covariance-eigenspectrum decay elbow —
ranging from 3% of ambient dimensions (CLIP ViT-B/32) up to 40% (SigLIP2
ViT-L/16) — and show this noise subspace is shared across unrelated
ImageNet classes (over 90% cross-class overlap in the two largest models).
Causally projecting the identified noise subspace away leaves zero-shot
accuracy essentially unchanged (e.g. CLIP ViT-L/14: 91.2%→91.1%), while
removing an equal number of random directions measurably degrades it — a
clean geometry-tied ablation distinguishing the collapsed subspace from an
arbitrary same-sized one. See
clip-siglip-embedding-covariance-eigenspectrum-splits-into-a-signal-subspace-and-a-shared-noise-subspace-that-safely-ablates-away.
Anderson (2026) tracks PCA effective dimension () along chain-of-
thought reasoning trajectories in real Llama-3-8B-Instruct and
Llama-3.1-70B-Instruct, finding domain-specific collapse: legal-reasoning
trajectories’ falls 501->274 (45%) from the 8B to the 70B model,
a pattern the paper calls “Crystallization,” distinct from code
reasoning’s discrete-cluster-formation pattern at the same two scales
(see Concept Cluster Heterogeneity). Single-author preprint;
observational only. See
anderson-2026-legal-reasoning-trajectories-in-real-llama-3-8b-instruct-and-llama-3-1-70b-instruct-undergo-a-45-percent-collapse-in-effective-dimensionality-with-scale.
Jiang, Nguyen, Aeron & Ishwar (2024) show Dimensional Collapse and Neural
Collapse (see Polytope (Simplex)) are two distinct, empirically
distinguishable failure/success modes of the same contrastive-learning
training setup: a real ResNet-50 trained via Adam on real CIFAR-100
reaches the Neural-Collapse Simplex-ETF geometry only when hard-negative
sampling and unit-ball/unit-sphere feature normalization are both present;
omitting either instead produces Dimensional Collapse, measured via the
same representation’s covariance spectrum failing to reach full effective
rank. See
jiang-etal-2023-a-real-resnet-50-trained-with-hard-negative-contrastive-losses-and-unit-ball-normalization-converges-to-neural-collapse-etf-geometry-on-cifar100-while-omitting-either-yields-dimensional-collapse-instead.
Sadok & Alameda-Pineda (2026, InsideSSL) track von Neumann entropy of the
per-layer Gram matrix — a compression/collapse-adjacent statistic distinct
from the covariance-rank measurements elsewhere in this node — across real
Wav2Vec2, WavLM, HuBERT, and Data2Vec-audio speech-SSL models: most models
sustain high entropy throughout the network, but Wav2Vec2-base alone
undergoes a sharp entropy collapse toward near-baseline levels at layer
11, coinciding with a spike in an InfoNCE-based invariance-loss measure —
a training-objective-specific collapse event distinguishing one
architecture’s optimization regime from the others tested. See
sadok-alameda-pineda-2026-real-speech-ssl-models-wav2vec2-wavlm-hubert-and-data2vec-show-distinct-layerwise-entropy-and-trajectory-curvature-regimes-with-wav2vec2-undergoing-a-late-layer-entropy-collapse.
Zolfaghari (2026) probes five real LoRA-fine-tuned honest/deceptive model
pairs (Pythia-1.4B, Gemma-2-2B/9B, Qwen2.5-7B, Llama-3.1-8B) with a
mechanistic geometry suite (effective rank, participation ratio, Fisher
Discriminant Ratio, centroid distance, adjacent-layer direction cosine)
applied to the linearly-decodable honest-vs-deceptive activation cloud,
finding an architecture-dependent bifurcation: Pythia, Llama, and Qwen
collapse the deception-direction cloud to near-rank-1 effective rank
(1.06-1.07), while Gemma-2 retains a much higher effective rank
(60-234) for the same labeled contrast — the same collapse-vs-distributed
split documented elsewhere on this node for other labeled concepts, here
shown to hold even though linear-probe decodability itself is uniformly
near-ceiling (AUC>=0.99) across all five architectures. See
zolfaghari-2026-a-real-multi-architecture-study-finds-the-honest-vs-deceptive-activation-cloud-collapses-to-near-rank-1-effective-rank-in-pythia-llama-and-qwen-but-stays-high-rank-in-gemma-2-despite-uniformly-near-ceiling-linear-probe-decodability.
How to detect it
Compute the covariance matrix of a batch of embeddings, take its SVD, and plot sorted log-singular-values against rank index; a sharp knee/plateau well before the ambient dimension indicates dimensional collapse. Compare against a randomly-initialized network’s spectrum as a control.
Key papers
- Jing, Vincent, LeCun & Tian (2022). Understanding Dimensional Collapse in Contrastive Self-supervised Learning. ICLR 2022, arXiv:2110.09348 — origin of the term and its dual (augmentation / implicit-regularization) theoretical account for contrastive SSL.
- Wang, Ge, Shu, He & Qiu (2025). Attention Layers Add Into Low- Dimensional Residual Subspaces. arXiv:2508.16929 — attention outputs collapse to ~60% intrinsic dimension vs. ~90% for MLP/residual, traced to , with a practical SAE-initialization fix for the resulting dead-feature problem.
- Li, Agrawal, Ghosh, Teru, Santoro, Lajoie & Richards (2025). Tracing the Representation Geometry of Language Models from Pretraining to Post-training. arXiv:2509.23024 — RankMe/alpha-ReQ trace a proven, three-phase collapse/expansion/anisotropic-compression trajectory across pretraining and post-training.
- Vemula, M. (2026). Massive Activations Are Architecturally Robust: A Controlled Scratch/Commitment Residual Stream Test. arXiv:2606.20743 — massive activations re-emerge under an architecturally-isolated Commitment residual stream in real from-scratch-trained transformers.