Definition
A linear subspace of dimension :
with orthonormal basis . The orthogonal projection of onto :
The residual is the component of orthogonal to .
Intuition
A single binary feature needs only one direction to encode “how much.” A feature with several mutually exclusive categories (noun/verb/adjective/adverb) cannot be squeezed onto a single line without collapsing distinct categories onto the same point — it needs a whole -dimensional subspace, one extra dimension per additional independent category.
Properties
-
is idempotent and self-adjoint. (projecting twice changes nothing further) and (as a real symmetric matrix ) — the two properties that characterize an orthogonal projection.
-
Orthogonal decomposition. Every splits uniquely as , with , , and . Consequently (Pythagorean identity).
-
Rank equals dimension. has rank exactly ; its eigenvalues are (multiplicity , eigenspace ) and (multiplicity , eigenspace ).
-
Erasure removes exactly the information in , nothing more, nothing less — if is exactly right. retains all information orthogonal to unchanged; if the concept genuinely and only occupies , this projection is a clean, lossless-elsewhere erasure. If the true concept subspace is only approximately (e.g. is mis-estimated or too low-rank), erasure will be incomplete or will remove unrelated information.
-
Nesting. If , then — projecting onto a larger subspace first and then a smaller one contained in it is the same as projecting onto the smaller one directly (idempotence extended across nested subspaces). Confirmed empirically, not just as a linear-algebra identity: Hernandez & Andreas (2021) find that fine-grained morphosyntactic sub-categories (e.g. noun-vs-noun distinctions) occupy a subspace nested inside their coarser parent category’s subspace (e.g. part-of-speech), at roughly half the rank — see the
pos-subspace-nestingObservation. Contrast Polytope (Simplex)‘s “Composable with hierarchy via direct sums” property and hierarchical-orthogonality, where a different domain’s hierarchy levels are instead orthogonal complements of each other, not nested subspaces — the two are distinct empirically-observed relationships between hierarchy levels, not the same claim in different words. -
Foundational demonstration: a protected-attribute subspace spans dozens to hundreds of directions, not one. Ravfogel, Elazar, Gonen, Twiton & Goldberg (2020), introducing INLP, show a gender-bias subspace in GloVe embeddings needs 35 iteratively-found orthogonal directions to be removed as effectively as it is (residual classification accuracy 54.4%, vs. 80.7% when only 10 hand-picked single-concept directions are removed) — direct evidence against treating such attributes as single-direction phenomena, and the origin of the multi-direction subspace-removal technique this map’s other INLP-based papers build on. See
gender-subspace-spans-dozens-of-directions. -
The minimal-distortion eraser is oblique, not orthogonal — a constraint prior work assumed without proving necessary. Belrose, Schneider-Joseph, Ravfogel, Cotterell, Raff & Biderman (2023, LEACE) prove the guardedness constraint that defines “erase this concept” only fixes a projection’s nullspace, leaving its range free — so restricting the search to orthogonal projections, as both INLP and RLACE implicitly do, is itself suboptimal for minimizing embedding distortion. Their closed-form (non-iterative) oblique projection provably guards against every linear classifier at once, removes exactly dimensions (rank 1 for a binary concept), and achieves the smallest measured embedding change of any method compared, in ~100x less compute than RLACE’s gradient-based search. See
oblique-projection-erases-concept-with-minimal-distortion. -
How many dimensions a removal-optimal subspace needs depends on the objective, provably. Ravfogel, Twiton, Goldberg & Cotterell (2022) formalize concept erasure as a minimax game (R-LACE) and prove — not merely observe — that INLP‘s iterative approach finds a provably suboptimal (unnecessarily large) subspace for linear-regression objectives, a provably optimal/identical subspace for Rayleigh-quotient objectives, and an empirically much larger subspace for classification objectives (INLP needs dozens-to-~100 dimensions where a single adversarially-optimized direction suffices). This refines “dozens to hundreds of directions” (the INLP finding above) into “however many the specific removal objective actually requires” — not a fixed property of the concept alone. See
rank-one-subspace-suffices-for-gender-erasure. -
Causally validated via subspace erasure plus a placebo control. Lasri, Pimentel, Lenci, Poibeau & Cotterell (2022) use INLP’s null-space projection (no counterfactual push) to remove BERT’s grammatical-number subspace at noun vs. verb positions separately, showing behavioral subject-verb-agreement accuracy drops only when the matching position’s subspace is removed (not when a random-direction placebo of equal size is removed, and not when the other position’s subspace is cross-applied) — evidence the subspace is causally used, is multi-dimensional (dozens of directions per layer), and is functionally distinct between nouns and verbs. See
grammatical-number-usage-verified-causally. -
A subspace can implement a functionally distinct role from a co-located direction/manifold, orthogonal to it, rather than encoding a separate concept. Maheswaranathan & Sussillo (2020), a direct follow-up to the same Line Attractor sentiment-RNN result, find that negation/intensification words (“not bad,” “extremely awesome”) deflect the hidden state into a 2-dimensional subspace (two components explaining 96.2% of variance) orthogonal to the line attractor itself, rather than moving further along it as ordinary valence words do — with two internal timescales (mean and tokens) and negators/intensifiers occupying distinguishable regions of the same subspace. Causally validated by ablation: projecting the initial hidden state out of this 2D subspace drops test accuracy by 0.17% (68 misclassified reviews) while projecting out a random 2D subspace of the same dimension has no effect. See
modifier-subspace-orthogonal-to-line-attractor-implements-negation-and-intensification. -
Causally validated via subspace-targeted counterfactual push, not just erasure. Katinskaia & Yangarber (2024) use INLP to locate the multi-directional subspace encoding “boundedness” in Russian BERT/RoBERTa, then push real hidden vectors toward or away from it mid-forward-pass (AlterRep) — a genuine causal test of a subspace (not a single direction), showing opposite-signed, grammar-consistent shifts in perfective vs. imperfective aspect predictions, verified against a random-subspace placebo control. See
boundedness-subspace-causally-shifts-aspect-predictions. -
A trained cross-modal steering subspace collapses to rank 1, not “dozens to hundreds.” Bi, Wang, Chen, Xiao, Hecker, Tresp & Ma (2024/2025, MoReS) train a per-layer linear map confined to a -dimensional subspace of a multimodal LLM’s visual-token representations, to correct a measured text-over-vision attention imbalance during visual instruction tuning; ablating the subspace rank shows already matches or exceeds every larger rank on four visual QA benchmarks while needing the fewest trainable parameters (0.164M, up to 1,150x fewer than LoRA) — a rare case where the causally sufficient subspace for a whole modality-rebalancing intervention is a single line, contrasting with the “dozens of directions” scale seen for concept-erasure subspaces like gender bias above. See
bi-etal-2024-llava-steering-a-rank-1-linear-subspace-steering-module-per-layer-suffices-to-rebalance-visual-versus-textual-modality-attention-and-recovers-comparable-mllm-performance-with-500x-fewer-trainable-parameters. -
Generalizes Linear Direction at . A single direction is the special case , ; recovers the earlier projection formula.
-
The removal method itself can invalidate a causal-subspace claim — not just add noise, but reverse the conclusion. Dobrzeniecka, Fokkens & Sommerauer (2025) re-run Elazar et al. (2021)‘s amnesic-probing pipeline and find INLP fails its own information-control check for 2 of 3 properties: a same-size random-direction projection damages BERT’s next-word prediction more than INLP’s targeted removal, so the apparent behavioral effect cannot be attributed to the specific subspace removed. Substituting Mean Projection (a single class-mean-difference projection, no iteration) or LEACE for INLP passes this control in every case, at far lower embedding distortion (cosine similarity to the original space: 0.80-0.95 for MP/LEACE vs. as low as 0.31-0.37 for INLP) — evidence that “how many dimensions removal needs” and “how much collateral distortion removal causes” are entangled, and an iterative orthogonal method’s own side effects can masquerade as the causal signal being tested for. See
mean-projection-and-leace-outperform-inlp-in-amnesic-probing. -
Guardedness against one adversary does not imply guardedness against another — proven, not just observed. Ravfogel, Goldberg & Cotterell (2023) formalize “guardedness” (the property INLP, RLACE and LEACE all aim to guarantee) and prove that while binary log-linear guardedness genuinely propagates to any downstream binary log-linear classifier, it demonstrably does NOT propagate to multiclass classifiers: a representation can be perfectly guarded against every single guarding hyperplane while a -way softmax combining those hyperplanes’ sign patterns recovers the erased concept almost completely (proven via an explicit “K-Voronoi” worst-case construction, and demonstrated empirically — a 4-to-8-way profession classifier on RLACE-erased, gender-guarded BERT representations recovers nearly all the “erased” gender information). This is a different, more fundamental limitation than “how many dimensions” or “how much information is captured”: it shows the very notion of “erased” is adversary-relative, not an intrinsic property of the representation. See
multiclass-softmax-recovers-erased-concept-despite-guardedness. -
An intrinsic, classifier-free information-theoretic standard for “the ideal concept subspace,” and it’s stricter than LEACE’s own guarantee. Guerner, Svete, Liu, Warstadt & Cotterell (2023) define a concept subspace’s quality using only the language model’s own distribution — via a counterfactual-unigram construction that provably handles Kumar et al. (2022)‘s spurious-correlation critique of naive mutual-information erasure tests — and formalize four properties (erasure, encapsulation, containment, stability) that a truly causal subspace would satisfy exactly. Applying this standard to LEACE‘s own output (state-of-the-art by its own erasure guarantee) reveals its one-dimensional subspace captures only ~50% of total concept information for English verbal number and considerably less for French grammatical gender — and a genuine
do-intervention on the subspace succeeds ~90% of the time for number but fails for gender, exactly tracking this incompleteness. This is a different, stricter failure mode than “how many dimensions are needed” (the running INLP→RLACE→LEACE narrative above): even a provably-complete linear eraser can still fail to encapsulate all of a concept’s information within the subspace it finds. Seeleace-subspace-captures-only-half-of-verbal-number-informationandcausal-intervention-succeeds-for-number-fails-for-gender. -
USES this structure as an alignment-testing tool, rather than discovering a new fact about it. Geiger, Wu, Potts, Icard & Goodman (2023/2024, DAS) learn an orthogonal rotation of a representation via gradient descent so that one rotated-basis subspace aligns with a hypothesized high-level causal variable, testing the alignment via interchange interventions — reaching near-perfect fit (IIA up to 1.00) where brute-force neuron-subset search reaches only 0.60-0.73. Unlike every other entry on this page, DAS is not a claim that some specific concept (gender, aspect, RC-boundary, etc.) lives in a particular subspace — the paper’s own appendix states the orthogonal-rotation choice merely assumes linear structure as a tractable methodological device for causal-abstraction testing, explicitly flagging non-linear alternatives as unexplored future work. See
das-orthogonal-rotation-recovers-causal-alignment. Wu, Geiger, Icard, Potts & Goodman (2023, “Boundless DAS”) scale this to a full rotation of a 7B-parameter instruction-tuned LLM (Alpaca), discovering a 2-boolean-variable causal model whose alignment is robust to unseen input brackets, unseen instruction phrasing, and irrelevant added context — though this follow-up does not restate the original paper’s own linearity-is-an-assumption caveat. Seeboundless-das-scales-to-7b-with-robust-generalization. -
A representation-space intervention can be inverted back into real text, making its effect interpretable rather than only measurable. Avitan, Cotterell, Goldberg & Ravfogel (2024) apply a vec2text-based inversion procedure to representations that have been passed through LEACE erasure or MiMiC/MiMiC+ steering, recovering fluent, gender-flipped text that human annotators reliably identify as intended (Fleiss’ κ=0.60) — and revealing, via word-association analysis, that these interventions shift subtler class-correlated vocabulary beyond pronouns (e.g. “developer” vs. “domestic,” “maternal”). This is orthogonal to the “how much collateral distortion” question tracked elsewhere on this page: it doesn’t measure distortion, it makes the intervention’s content directly inspectable. See
representation-interventions-invert-to-interpretable-text. -
Amnesic probing’s single random-direction control can itself be the unreliable part, not just the removal method. Rozanova, Valentino, Cordeiro & Freitas (2023) apply amnesic probing to a controlled NLI setting where the entailment label is provably determined by two known features, and find essentially no downstream effect from removing either feature — or even the gold label itself — via INLP. The cause is a low-class-count confound: with only 2-3 classes, INLP removes very few directions, and a single random-direction control baseline (as used in the original amnesic-probing protocol) is shown to be highly unstable at this scale, sometimes matching or beating the targeted removal purely by chance. Projecting onto the complement of the same INLP-trained subspace instead of removing it (“mnestic probing”) recovers a clear, informative signal in the same setting. See
amnesic-probing-misleading-in-low-class-count-high-dimension-settingsandmnestic-probing-recovers-informative-signal. -
Restricting causal validation to a linear subspace has a measurable reliability cost. Canby, Davies, Rastogi & Hockenmaier (2025) formalize completeness (how thoroughly a target property changed) and selectivity (how little else changed) as numbers in , define reliability as their harmonic mean, and compare INLP/RLACE/AlterRep against nonlinear gradient-based interventions (FGSM/PGD/AutoAttack) across six models. Every method trades completeness for selectivity as its hyperparameter varies, but the linear methods this map’s
causal-validationcluster is built around are, in five of six models tested, less reliable than an unconstrained nonlinear perturbation — evidence that the interpretability of “the concept lives in this subspace” is not free: it costs measurable reliability relative to methods with no such structural constraint. Seenonlinear-interventions-more-reliable-than-linear. -
Cross-lingual subspace overlap, verified causally. Chang, Tu & Bergen (2022) fit a per-language affine subspace to XLM-R representations across 88 languages and find, via a Riemannian covariance-distance metric, that different languages’ subspaces coincide almost exactly after mean-centering (layers 6-11 distances equivalent to <5° rotation or <1.6x scaling) — and confirm this is not merely descriptive by showing that projecting a representation onto its own vs. a different language’s subspace has correspondingly small vs. large causal effects on language-modeling perplexity. See
cross-lingual-subspace-overlap. -
Two independently-varying attributes of the same signal partition into (near-)orthogonal subspaces of a single self-supervised model’s representation space, and collapsing one improves rather than merely preserves the other. Liu, Tang & Goldwater (2023) find, in two predictive-coding speech models (CPC, APC), that a speaker-identity subspace (top PCA directions of per-speaker mean representations) and a phonetic-content subspace (same, per-phone) are nearly orthogonal (average cosine similarity ~0.13 among top directions) — and causally validate this via Orthogonal subspace collapse (aggregated-PCA): projecting out the speaker subspace drives speaker-probe accuracy to near chance while improving phone discrimination (ABX error), including for speakers never seen during subspace estimation. See
predictive-coding-speech-models-encode-speaker-and-phonetic-information-in-orthogonal-subspaces-collapsible-without-hurting-phone-discrimination. -
A subspace-composability claim proven as a theorem, not just measured, with an explicit falsifiable precondition and a demonstrated failure case. Wang, Gui, Negrea & Veitch (2023) treat a diffusion model’s score function itself as the representation and prove that if the generation is “causally separable” with respect to two concepts (a specific, checkable independence condition), the centered score representation is “arithmetically composable” — each concept provably occupies its own additive subspace. They estimate each subspace from contrastive prompt-pair score differences and causally edit Stable Diffusion generations by projecting and swapping subspace components, validated by a 10-rater human study (concept algebra preferred 47.6% of the time vs. 16.2-16.4% for baselines) — and explicitly demonstrate a failure case (a “nurse” gender-transfer prompt) arising exactly when the separability precondition doesn’t hold, directly tying the theorem’s hypothesis to an observed limitation rather than presenting unconditional success. See
concept-algebra-causally-edits-diffusion-generations-via-score-subspace-projection. -
Recovered purely from text, with no visual grounding at all, and verified two independent ways. Abdou, Kulmizev, Hershcovich, Frank, Pavlick & Søgaard (2021) show static color-term embeddings from BERT, RoBERTa and ELECTRA linearly recover the 3D CIELAB perceptual color space — confirmed both via RSA (Kendall up to 0.24, significant against a random-shuffle null) and via a control-task-corrected linear mapping directly onto CIELAB coordinates (selectivity 0.76-0.78 across model families) — with alignment scaling with model capacity (BERT-mini to BERT-base ) even holding architecture fixed. No causal intervention is involved; the finding rests on the geometric-shape criterion alone. See
lms-color-term-embeddings-linearly-map-onto-cielab-perceptual-color-space-with-significant-rsa-and-control-task-corrected-selectivity. -
55 independently-trained, semantically distinct concept probes span a subspace whose effective rank collapses to 1, not 55, and the single surviving direction alone carries most of the causally-exploitable behavioral effect. Shah, Angeline, Kumar, Chheda, Zhu, Sharma, O’Brien & Cai (2025) fit one logistic-regression probe per harmfulness subconcept (racial hate, weapons, employment scams, etc. — 55 in total from CategoricalHarmfulQA) in Llama-3.1-8B-Instruct and Qwen2-7B-Instruct, and compute an SVD-based effective rank of the stacked 55 weight vectors: at a 0.95 variance threshold, nearly every layer reaches effective rank — the 55 nominally distinct subconcepts occupy, almost exactly, a single shared line, not an independent direction each (a K-means clustering of the 55 vectors barely recovers the dataset’s own category groupings, Adjusted Rand Index ~3e-4 on average, ruling out “the shared direction is just re-deriving the taxonomy”). Causally, ablating only this one dominant direction matches or exceeds ablating the full 55-dimensional subspace on JailbreakBench safety (0.91 either way) while costing noticeably less utility (MMLU 0.60 vs. 0.51), and additively steering along it alone cuts AutoDAN attack success from 0.94 to 0.50. See
55-harmfulness-subconcept-probe-directions-collapse-to-effective-rank-one-and-ablating-or-steering-the-dominant-direction-suppresses-jailbreaks. -
32 hand-constructed semantic-contrast directions are far from orthogonal, their non-orthogonality reproduces an independent human survey’s own correlational structure, and PCA finds most of their joint variance concentrated in a 3-dimensional subspace matching a classical psychological finding. Kozlowski & Boutyline (2026) build 32 “semantic axis” directions (beautiful-ugly, soft-hard, etc.) from Llama-3 and Qwen3 residual-stream contrastive-pair differences, and find their pairwise cosine similarities closely reproduce the pairwise correlations between the same 32 scales in a 1,750-respondent human semantic-differential survey — direct evidence the axes are “meaningfully non-orthogonal,” per Concept Crystals (Parallelogram/Trapezoid Structure)‘s broader theme that related concept directions needn’t be independent. PCA on the 32 raw axis vectors finds the top three components jointly explain over 45% (small model) / 33% (large model) of variance, versus 3.1% expected under orthogonality — replicating the classical semantic-differential finding that human ratings reduce to 3 components (Evaluation, Potency, Activity) — and canonical correlation analysis confirms this LLM-derived subspace aligns closely with the equivalent human-survey subspace. Causally, Activation Steering (Addition) a word along one axis produces “spillover” onto other axes proportional to their cosine similarity, directly tying the measured non-orthogonal geometry to a measured behavioral effect. See
32-llm-semantic-feature-directions-form-a-low-dimensional-non-orthogonal-subspace-matching-human-semantic-differential-structure-and-predicting-steering-spillover. -
Four explicitly-trained-orthogonal subspaces, with the orthogonality itself measured and causally load-bearing via a direct swap intervention, not just erasure. Cheng, Jin & Zhang (2026) train a sign-language-recognition model (PhonSSM) with a Phonological Decomposition Module that projects representations into four separate 32-dim subspaces (handshape, location, movement, orientation) under an explicit orthogonality loss, measuring the resulting separation directly (mean pairwise cosine similarity 0.12 with the loss vs. 0.67 without it) rather than merely asserting factorization. Causal validation goes beyond correlational probing: for minimal pairs of signs differing in exactly one phonological component, swapping only the differing component’s embedding between the pair (an interchange/Activation patching-style intervention) flips the model’s prediction to the pair partner 73.2% of the time, versus 12.4% for matched control swaps (p<0.001). See
phonssm-factorizes-sign-representations-into-four-orthogonal-phonological-component-subspaces-and-swapping-one-causally-flips-predictions-73-percent-of-the-time. -
Two nominally-similar unit sets (both format-invariant, both significantly non-random) dissociate causally — one matters for behavior, the other doesn’t. Martorell (2025) finds LLaMA-3.1-8B units whose activations significantly correlate (Bonferroni p<0.05) with either grid agent-position or action-correctness, consistently across 6 different text-based spatial encodings (448/258/373/286 units respectively, each far exceeding shuffled-index controls). Ablating the 286 action-correctness units drops grid-navigation success from 59% to 55%, while ablating the analogous position-correlated units leaves success unchanged at 62% — direct evidence that format-invariant correlational unit sets are not automatically causally equivalent to each other, even when both clear the same statistical bar for “robustly present regardless of representation.” See
llama-3.1-8b-linearly-encodes-grid-position-format-invariantly-and-ablating-its-action-correctness-units-selectively-degrades-navigation. -
The founding challenge to the linear subspace hypothesis: removing the single linear gender direction does not remove the bias, only its visibility along that one axis. Gonen & Goldberg (2019) apply Bolukbasi et al. (2016)‘s hard-debiasing projection to real word2vec-GoogleNews and GloVe-Wikipedia embeddings and show the “debiased” residual geometry is still recoverably gendered by instruments that don’t rely on the removed direction: k-means clustering of gender-biased words on the debiased vectors still recovers the original male/female clustering at 92-98.4% accuracy, an RBF-kernel SVM trained on the original biased vectors transfers to the debiased vectors at comparable accuracy, and profession-word nearest-neighbor lists remain measurably gender-skewed. This is the paper Vargas & Cotterell (2020, below) and Kresin, Dieffi & Caspi (2026, below) explicitly build on and answer: if bias is genuinely confined to one linear direction, hard-debiasing should have removed it entirely; that it doesn’t is direct motivation for testing whether the true bias-carrying structure is linear at all (Vargas & Cotterell’s kernel-PCA test) or spans more of the PCA spectrum than a single component (Kresin et al.’s multi-component ablation). See
gonen-goldberg-2019-hard-debiasing-removes-the-linear-gender-direction-from-real-word2vec-and-glove-embeddings-but-k-means-clustering-and-an-rbf-svm-still-recover-gender-association-from-the-residual-geometry. -
The linear subspace hypothesis, directly tested against a strictly more expressive nonlinear alternative built from the same construction, and confirmed. Vargas & Cotterell (2020) prove Bolukbasi et al. (2016)‘s gender-bias subspace construction is exactly PCA on a mean-centered design matrix, then kernelize it into a nonlinear (kernel-PCA) technique via Kernel-PCA linearity test and compare linear vs. five kernels across WEAT effect sizes, profession-stereotype correlation, indirect-bias SVM classification, and SimLex-999 preservation on word2vec and GloVe — finding no consistent benefit from nonlinearity on any benchmark, direct empirical support for the previously-untested assumption that gender bias occupies a genuinely linear (not merely linearly-approximable) subspace. See
vargas-cotterell-2020-kernel-pca-tests-linear-subspace-hypothesis-for-gender-bias. -
Direct bias is genuinely rank-1, but a differently-measured “associative” bias is not — the same subspace concept splits into a low-rank and a distributed part depending on what’s being measured. Kresin, Dieffi & Caspi (2026) analyze the explained-variance spectrum of Bolukbasi et al. (2016)‘s gender difference-vector PCA subspace across GloVe, word2vec and FastText, finding the first principal component alone captures ~48% of variance (80% by component 5, 93% by component 10) — and, via both cumulative multi-PC removal and single-PC ablation, that projection-based direct bias collapses to near-zero after removing only PC1 and stays flat thereafter, while WEAT-measured associative bias shows slow, non-monotonic behavior under the same removals, i.e. is not captured by the dominant direction(s) at all. This dissociation nuances rather than contradicts the “dozens of directions” INLP finding above: that finding concerns a discriminatively-trained classifier-adversarial subspace, whereas here the PCA/variance-based subspace is genuinely rank-1 for the projection-based direct-bias measure specifically, with WEAT-style associative bias instead behaving like the distributed, many-direction case. Removing more components also monotonically increases mean vector displacement and degrades neighbor stability, quantifying a direct bias-vs-semantic-preservation trade-off with no universal optimal cutoff. See
kresin-etal-2026-direct-gender-bias-is-rank-one-but-associative-weat-bias-is-distributed-across-the-pca-spectrum. -
A subspace built from persona-conditioned activations, not raw dataset activations, is what carries the transferable behavioral signal — isolated via random-subspace and generic-PCA controls of matched rank. Mahadik & Skapars (2026) build one activation vector per deceptive/honest and sycophantic/non-sycophantic persona (following the Assistant Axis elicitation method), and run PCA on these persona vectors rather than on raw dataset activations. The resulting PC1 cleanly separates harmful from harmless personas and, together with a diff-in-means contrastive direction, transfers zero-shot to 5 unseen deception and 5 unseen sycophancy datasets; projecting dataset activations onto the top-3 persona PCs and training a probe on those 3 features improves cross-dataset transfer over probes on raw activations for most pairs — and specifically outperforms both a random one-dimensional subspace and a same-rank dataset-specific PCA subspace, isolating that persona-conditioning (not just any low-rank projection) is what carries the transferable signal. No causal intervention is performed; the claim rests on the quantified geometric-shape and controlled-comparison criteria alone. See
mahadik-skapars-2026-persona-conditioned-pca-subspace-separates-deception-and-sycophancy-and-outperforms-random-and-dataset-pca-subspaces-for-cross-dataset-probe-transfer. -
A low-rank subspace edited out of the weights once, offline, rather than out of activations at every forward pass — and provably robust to a corruption that breaks the gradient-based alternative. Uppaal, Dey, He, Zhong & Hu (2024/2025, ProFS) extract a rank-2-to-10 toxic subspace via SVD of centered contrastive-pair embedding differences (rank chosen automatically via ScreeNot) and project it out of MLP value-matrices permanently, reducing GPT-2/Mistral/OPT/GPT-J toxicity below DPO’s result while using 4x less preference data and matching perplexity/downstream accuracy. Under increasing label noise, DPO’s toxicity-reduction degrades monotonically while ProFS stays essentially flat — a direct, provable consequence of SVD being invariant to any single contrastive pair’s sign flip, unlike DPO’s gradient-based loss. The paper connects this weight-space projection to activation-space gradient descent: a single DPO gradient step’s own variance is increasingly explained by projecting onto the same subspace as sample size and layer depth grow, framing ProFS as a denoised version of one DPO step rather than a fully independent phenomenon. See
profs-toxic-subspace-projection-reduces-toxicity-more-sample-efficiently-and-more-noise-robustly-than-gradient-based-dpo. -
A third, independent geometric-shape claim in the emotion-geometry cluster, at a much higher dimensionality than either of the other two. Reichman, Avsian & Heck (2025) extract a 40-dimensional centered-SVD subspace from pooled Llama-3.1-8B/OLMo-2/Ministral-8B sentence activations, with four leading principal components interpreted as valence, dominance, approach-avoidance and arousal — stable across layers (Spearman rank correlation up to 0.87-0.92 for emotion ordering) and generalizing across 8 emotion datasets in 6 languages via linear cross-domain alignment (cosine similarity 0.83-0.94 between per-dataset subspace fits). A trained nonlinear (MLP) steering module built on top of this subspace raises target-emotion accuracy from 9% to 83% overall. This sits alongside, rather than replacing, two lower-dimensional competing claims about closely related affective constructs: Sun et al. (2026)‘s 2D circular circumplex (
valence-arousal-circumplex-subspace) and Choi & Weber (2026)‘s 1D parabolic curve (affective-parabolic-manifold), both in different models and via different extraction methods. Seereichman-etal-2025-a-40-dimensional-svd-emotional-subspace-with-four-interpretable-pc-axes-generalizes-across-6-languages-and-is-causally-steerable-via-a-trained-mlp. -
A proven dimensionality bound for superposition-based relational recall, not merely an empirical scaling observation. Ravfogel, Yehudai, Bruna & Bietti (2026) model subject embeddings as a linear superposition of per-relation attribute vectors, read out by a relation-conditioned ReLU-gated MLP selector, and prove (Theorem 4.1) that a 1-layer transformer with this selector solves single-hop recall for entities and relations whenever — synthetic experiments (N=4096, R up to 16, d from 32 to 768) confirm trainable embeddings reach perfect memorization once while frozen/random embeddings need for the same . On five real pretrained LMs (Qwen2.5-0.5B, Qwen3-14B, Llama-3.1-8B, Llama-3.2-1B, Phi-4), a rank-512 affine probe finds the LM-head output-embedding row is linearly decodable (best-layer MRR 0.44-0.69 across six entity categories) — extending Hernandez et al. (2023)‘s LRE finding into a proven dimensionality regime, and partially reversing that paper’s reported non-linearity specifically for output-side object embeddings. Causally, minimum-norm subject-embedding perturbations swap the queried attribute with high selectivity, and a frozen relation-selector MLP transfers zero-shot to unseen relation bijections. See
ravfogel-etal-2026-subject-embeddings-linearly-superpose-attribute-vectors-with-a-proven-d-theta-r-log-n-dimensionality-bound-for-relational-recall. -
A category-dependent dissociation between true (through-origin) linear structure and affine structure, isolated by decomposing an existing affine map into its multiplicative and additive parts. Xia & Kalita (2025) split Hernandez et al.’s affine LRE () into a bias-free “linear LRE” () and a Jacobian-free “Bias” approximator (), testing both across 40 BATS-derived relation categories on GPT-J-6B and Llama-2-7B. Morphological relations reach 90% top-1 faithfulness under the bias-free linear map alone (vs. 95% for the full affine LRE), while semantic/encyclopedic relations drop to 40% linear vs. 61% affine — and the additive-only Bias approximator fails on morphology in both cases, showing the Jacobian term is necessary specifically there. This sharpens “relational decoding is affine” into a relation-type-specific claim: morphology occupies a genuine through-origin linear subspace map, while other relation types require the affine offset — replicated across GPT-J’s parallel and Llama-2’s sequential attention/MLP architectures and across 8 typologically diverse languages (Czech, French, German, Hungarian, Portuguese, Serbian, Swedish, Turkish). See
xia-kalita-2025-morphological-relations-are-truly-linear-90-percent-faithful-with-no-bias-term-while-semantic-and-encyclopedic-relations-require-the-affine-bias-term. -
A contrastive-SVD subspace, extracted per (layer, timestep) rather than once globally, whose local dynamics are validated as approximately linear before being used for closed-loop causal control. Hong, Chan, Dai, Skifstad & Chou (2026) extract a -dimensional subspace from SVD of contrastive prompt-pair activation differences in video diffusion transformers (Wan2.1-T2V-14B, HunyuanVideo-1.5), finding this small subspace already captures most of a target concept’s contrastive-difference energy, and separately validate that local Jacobian dynamics estimated within it generalize across prompts (smaller Frobenius-norm distance between same-layer Jacobians from 20 different prompts than to random matrices). Unlike Wang et al.’s image-diffusion concept algebra (a one-shot subspace projection/swap), the causal intervention here is a closed-loop optimal-control law (LQR) that tracks the projected contrastive coordinate toward a target setpoint at every generation timestep, reducing unsafe video generations while limiting the oversteering that coarser, non-anticipative edits cause. See
hong-etal-2026-la-lqr-a-svd-derived-contrastive-subspace-with-validated-local-linear-dynamics-enables-closed-loop-optimal-control-steering-of-video-diffusion-transformers. -
A z-scored RSA variant shows intermediate-layer geometry is specifically organized around a model’s own future readout subspace, and this organization is masked at late layers in small models — dissociated from loss — but not large ones. Xu (2026) compares a layer’s full-space distance structure, projected onto the unembedding matrix’s own top-k readout subspace, against 100 random subspaces of equal rank, finding “peak z-scores reach 9-24 at mid layers” across seven Pythia models (70M-6.9B) and three cross-family models (OLMo-1B, Phi-1.5, Gemma-2-2B) — genuine, statistically significant subspace-specific organization, not incidental low-rank structure. Tracked across training, Pythia-410M’s late-layer z-score falls to -32 “even as loss continues to drop,” with the masking emerging progressively over training checkpoints, while Pythia-1B (d=2048) never masks and the transition threshold sits at approximately hidden dimension 2048 across the full model set. A partial follow-up intervention (removing the top few principal components) “restores positive z at every layer of every model with d>=768,” though the paper is explicit that its central claim is correlational, not a demonstrated causal mechanism. See
xu-2026-scale-determines-whether-late-layer-representation-geometry-stays-organized-around-the-unembedding-readout-subspace-during-training. -
A continuous (not discrete-class) conditioning variable can also be ablated by closed-form affine regression and subtraction, an alternative to LEACE/mean-projection’s discrete-class subspace removal. Ruggiero, Testa, Van de Walle & Di Caro (2025, Eta-WavLM) fit a closed-form affine regression from a frozen, pretrained ECAPA-TDNN speaker embedding (PCA-reduced to 128 dims) to layer-15 frame representations of the official pretrained WavLM-Large, then subtract the predicted component at inference. Speaker-classification accuracy on the resulting representation collapses from 82.30% to 55.73% (paired t-test T=18.41, p=5.12e-5), while voice-conversion quality improves over multiple baselines (e.g. WER 3.81 vs. 4.56, T-SSIM 92.46 vs. 89.52, MOS 4.00 vs. 3.84). See
ruggiero-etal-2025-a-closed-form-affine-regression-ablation-of-a-continuous-speaker-embedding-collapses-speaker-classification-accuracy-on-wavlm-large-layer-15-frames-while-improving-voice-conversion-quality. -
Individual attention heads specialize in writing additively into a low-rank residual-stream subspace per factual attribute, quantified by a per-head Attribute Ratio, and these per-head direction contributions constructively sum to produce the correct factual completion. Chughtai, Cooney & Nanda (2024) use Direct Logit Attribution on Pythia-2.8B and GPT2-XL, finding individual heads specialize per attribute (e.g. L17H17 IN_COUNTRY Attribute Ratio=107.23) and that summing multiple such heads’ contributions constructively produces the model’s correct factual completion — an “additive motif” for factual recall. See
chughtai-cooney-nanda-2024-individual-attention-heads-write-additively-into-a-low-rank-residual-stream-subspace-per-attribute-and-their-direct-logit-attribution-ratios-constructively-sum-to-produce-correct-factual-completions. -
An OLS-fit linear/affine map between two independently-trained vision models’ full activation spaces explains over 60% of variance, and the two spaces’ top principal components correspond approximately one-to-one. Moayeri, Rezaei, Sanjabi & Feizi (2023) align a wide range of real pretrained vision encoders (supervised and self-supervised ResNets/ViTs, CLIP) into a shared concept space this way, with no causal intervention performed — a passive cross-model geometric-correspondence measurement enabling zero-shot concept-bottleneck classification up to 93.8% accuracy. See
moayeri-etal-2023-a-linear-affine-map-fit-between-two-vision-models-activation-spaces-achieves-r2-above-0-6-and-their-top-pca-components-correspond-approximately-one-to-one. -
Forget and retain subspaces built via per-layer SVD directly on a real diffusion model’s cross-attention activations (rather than a text-embedding proxy) are separated roughly 5x better by a probe than the text-embedding baseline, and projecting the forget subspace out of the cross-attention weights via a single closed-form linear projector gives the best target/retention/attack trade-off on a holistic unlearning benchmark. Moon, Jun, Lee & Kim (2026) apply this to Stable Diffusion v1.5 across 10 concepts (Style/IP/Celebrity/NSFW), extending the same weight-space-projection logic as ProFS (originally for LLM MLP weights) to diffusion U-Net cross-attention K/V weights. See
moon-etal-2026-forget-and-retain-subspaces-built-via-per-layer-svd-on-real-cross-attention-activations-in-stable-diffusion-v1-5-projected-out-via-a-single-linear-projector-outperform-a-text-embedding-only-baseline. -
A linear map fit between a real network’s own representation space before and after continual-learning steps, rather than between two different models, predicts representational forgetting. Kim, Kim & Sohn (2025) define a representation discrepancy as the minimum, worst-case misalignment between a layer’s real representation space at two points in continual training, minimized over a purely linear map with no bias term, and fit this on real fixed-dimension ResNets, a fully-connected ReLU network, and a ViT trained sequentially on Split-CIFAR100 and ImageNet32. The resulting discrepancy correlates strongly with measured forgetting from frozen-feature linear probing (R-squared 0.88 on Split-CIFAR100, 0.74 on ImageNet32), and forgetting saturates at a 10-task horizon on both datasets, with saturation coming sooner in deeper layers and later in wider networks — the same “fit a linear/affine map between two representation spaces” construction used elsewhere on this page for cross-model alignment, applied instead to a single network’s own representation drift over training time. See
kim-etal-2025-a-fitted-linear-map-between-real-resnet-representation-spaces-before-and-after-continual-learning-correlates-with-measured-forgetting-at-r2-0-74-to-0-88. -
A fitted linear translation map distinguishes concepts that are genuinely lost from concepts that are merely hidden behind a recoverable reparameterization of the same continually-trained network’s representation space. Filus, Faber, Corizzo & Kanan (2026) train a BatchTopK sparse autoencoder per task on frozen real ResNet-18 activations (via the Mammoth continual-learning framework) on 2seq-CIFAR10, 2seq-tiny-ImageNet, and 10seq-tiny-ImageNet, then fit a least-squares linear map (with bias) translating post-continual-learning features back toward an earlier task’s representation space — re-running the frozen earlier-task SAE on translated features recovers many latents that appeared to have “died,” while a nonlinear MLP translator gives only marginal additional recovery, evidence that most of the apparent forgetting is a linear reparameterization rather than genuine representational destruction. Deletion ratios are highest under naive SGD/EWC and lowest under DER++/LwF. See
filus-etal-2026-a-fitted-linear-translation-map-recovers-apparently-deleted-sae-concept-latents-across-real-resnet18-continual-learning-checkpoints-distinguishing-lost-from-merely-hidden-concepts. -
Linear CKA similarity across independently-trained embedding models (proprietary and open) quantifies when models are linearly alignable at all, and learned affine maps between real generative LMs preserve downstream classification accuracy while enabling zero-shot cross-model text generation whose quality correlates with tokenizer/vocabulary overlap. Gorbett & Jana (2026) measure CKA similarity of 0.595-0.881 across five embedding models and validate affine-map transfer across Llama-3-8B, Qwen2.5-7B/14B, Llama-3.2-1B and others, isolating tokenizer overlap (r=0.898) as a confound distinct from representational alignment itself. See
gorbett-jana-2026-linear-cka-similarity-across-five-independently-trained-embedding-models-ranges-0-595-0-881-and-learned-affine-maps-preserve-classification-accuracy-and-enable-zero-shot-cross-model-generation. -
A multi-dimensional concept’s genuine intrinsic subspace dimension, measured independently of any sparse autoencoder, is provably fragmented into many more near-collinear single-direction atoms than that dimension requires — and a decoder architecture aware of grouped subspaces recovers it whole. Dalili & Mahdavi (2026) prove standard single-direction SAEs are geometrically and dynamically forced to split multi-dimensional features into exponentially many atoms (a k-sparse covering-number argument plus a basis-instability result), then confirm empirically that GPT-2-Small’s residual stream contains a temporal-concept subspace of measured intrinsic dimension ~14 (of 768 ambient dimensions, via PCA, with no SAE involved) which a standard SAE fragments into 35 separate atoms, while their Subspace-Aware SAE (block/group decoders plus nuclear-norm rank regularization) captures the whole concept in one rank-6 group and reduces feature absorption from 37.2% to 6.6% (GPT-2-Small) and 24.0% to 18.3% (Mistral-7B-v0.1). See
gpt2-residual-stream-contains-a-genuine-14-dimensional-temporal-concept-subspace-that-standard-saes-fragment-into-35-atoms. -
Frozen-feature linear probes reveal a sharp split between which self-supervised vision models encode genuine 3D surface geometry versus only coarse scene-layout priors, with single-view and multiview 3D awareness dissociating even in the best models. El Banani, Raj, Maninis, Kar, Li, Rubinstein, Sun, Guibas, Johnson & Jampani (2024) probe DINOv2, CLIP, MAE, iBOT, Stable Diffusion, MiDaS, DeiT and SAM for depth/surface-normal decodability, finding DINOv2 and Stable Diffusion features support markedly more accurate single-view 3D decoding than CLIP or MAE (which capture only rough layout priors), while every model tested shows weak multiview-consistent 3D structure regardless of single-view decodability. See
dinov2-and-stable-diffusion-linearly-encode-depth-and-surface-normals-while-clip-and-mae-do-not. -
SVD-extracted low-rank subspaces of converged linear-probe weights are causally necessary and sufficient for a self-supervised vision transformer’s geometric-task performance, with the intrinsic subspace dimension itself differing sharply between training objectives. Zhou, Zou, Gu, Dong, Xie & Zhang (2026) causally project DINOv2, MAE, and iBOT features onto extracted top-k task subspaces versus random or orthogonal-residual subspaces of equal rank, finding random/residual subspaces collapse to noise while the extracted subspace nearly recovers full-feature performance — DINOv2 needing rank >=64 to saturate its linear potential versus MAE saturating by rank 32, a quantified difference in intrinsic task-subspace dimensionality between the two self-supervised objectives. See
svd-extracted-task-subspaces-in-dinov2-and-mae-are-causally-necessary-and-sufficient-for-linear-probe-performance. -
A cross-scene-averaged identity/position decomposition, extracted via SVD from two real VLMs, converges to Laplacian-eigenmap scene geometry and is causally steerable. Wang & Gao (2026) posit an additive decomposition per object-token in Qwen2.5-VL-7B-Instruct and InternVL3-8B, and average an object’s activations across many randomly-positioned synthetic 3D scenes to cancel the position term, isolating an identity basis via SVD whose orthogonal complement recovers a spatial subspace; PCA of the spatial-extracted residual then recovers a 3D geometry matching true scene layout, formally converging to Laplacian eigenmaps of the scene graph. Causally, injecting a probe-derived direction into layer-12 residuals of Qwen2.5-VL-7B shifts the x-coordinate probe readout monotonically with injection strength (: vs. control ), while a null-direction control shows no effect. See
wang-gao-2026-svd-based-cross-scene-averaging-isolates-a-linear-3d-position-subspace-in-real-vlms-and-steering-it-causally-shifts-spatial-judgments. -
Linear decodability of mid-level geometric/grouping structure across a large sweep of self-supervised vision models correlates only weakly with the same models’ high-level recognition accuracy. Chen, Marks & Cheng (2024) probe eight mid-level vision tasks across 22 SSL models spanning contrastive, clustering, pretext-task, and masked/self-distillation paradigms, finding several models strongly imbalanced across the two capability classes — evidence that linear decodability of geometric mid-level structure is not simply a byproduct of overall representation quality as measured by recognition benchmarks. See
mid-level-geometric-task-decodability-is-weakly-correlated-with-high-level-recognition-performance-across-22-ssl-models. -
Sycophantic and factually-correct agreement occupy geometrically distinct activation subspaces, yet a single linear steering direction cannot exploit that distinction — explaining why sycophancy-reduction steering non-specifically suppresses correct agreement too. Buchan (2026) shows a centroid-difference sycophancy-steering vector in Llama-3-8B-Instruct also suppresses agreement with correct facts (a 20% drop on “the Earth is round”), and a Grassmann-similarity/principal-angle analysis finds sycophantic-agreement and factual-agreement activations occupy measurably distinct subspaces (similarity 0.15-0.20 vs. 0.317 for random splits, principal angles mostly 65-89 degrees) while the steering direction’s projection onto both subspaces is nearly equal (ratio 0.90-0.97) — the model geometrically distinguishes the two, but the linear intervention cannot. See
sycophantic-and-factual-agreement-occupy-geometrically-distinct-subspaces-yet-a-single-steering-direction-cannot-separate-them. -
Self-supervised speech models linearly recover universal, cross-speaker, cross-language articulatory kinematics from a single linear subspace. Cho et al. (2023) show that HuBERT, wav2vec 2.0, XLS-R, and MMS representations linearly encode articulatory kinematics (tongue/lip movement trajectories) via simple linear regression, and that this subspace transfers across speakers and across languages the models were never trained on, pointing to a universal articulatory-kinematic subspace shared across self-supervised speech models. See
speech-ssl-models-linearly-recover-universal-cross-speaker-cross-language-articulatory-kinematics. -
An encoding probe (predicting activations from candidate features, rather than the reverse) decomposes how much representational variance distinct linguistic/acoustic feature groups explain in wav2vec2 and BERT, revealing structured linear subspaces per feature group beyond what decoding probes can show. Shen et al. (2026) argue decoding probes only show recoverability, not how representational variance is actually organized, and instead fit encoding probes per feature group, quantifying the linear subspace each group (e.g. phonetic, syntactic) occupies within wav2vec2-base and BERT-base representations. See
encoding-probes-decompose-how-much-representation-variance-distinct-feature-groups-explain-in-wav2vec2-and-bert. -
A provably-correct linear projection (PISCO) disentangles style and content factors that are linearly entangled in pretrained ResNet-18 and SimCLR features, and causally discarding the isolated style subspace improves out-of-distribution accuracy. Ngweta et al. (2023) prove (via two theorems) a post-hoc linear projection separating style and content subspaces with no retraining, substantially raising style-correlation recovery (e.g. rotation: SimCLR 0.368 to 0.945) and improving OOD accuracy under spurious style shift when the style subspace is discarded. See
a-provably-correct-linear-projection-disentangles-style-from-content-in-resnet-and-simclr-features-and-improves-ood-accuracy. -
Safety-relevant fine-tuning gradients occupy a compact, low-rank subspace nearly orthogonal to utility-task gradients, and causally projecting utility gradients onto that subspace’s orthogonal complement during training cuts jailbreak attack success rate from over 95% to under 25%. Zhang et al. (2026) use per-layer SVD of safety- vs. utility-task gradients to identify this subspace (cosine similarity between safety/utility directions oscillates around zero, often negative) and their Safety-Preserving Fine-tuning method, an orthogonal-projection intervention, drops Harm-dataset attack success from 0.955 to 0.019 (Llama-3.1-8B-Instruct) while preserving MMLU accuracy. See
safety-gradients-occupy-a-compact-low-rank-subspace-distinct-from-utility-gradients-and-projecting-fine-tuning-updates-onto-its-orthogonal-complement-cuts-attack-success-rate-from-over-95-percent-to-under-25-percent. -
Structural probes recover distinct, low-dimensional linear subspaces for phonemic, lexical-semantic, and syntactic structure that emerge in that order across pretraining in both speech SSL models and text LLMs. Orhan et al. (2026) find phonemic structure emerges first, then lexical, then syntactic geometry in wav2vec2 (tiny/base/large) and in Llama-2-13B/Pythia checkpoints tracked across training, mirroring child-language-acquisition order (though requiring 2-4 orders of magnitude more data); a control alignment score confirms near-orthogonality (0.038-0.042) between the syntactic and semantic subspaces in Llama-2-13B. See
structural-probes-reveal-staged-emergence-of-phonemic-then-lexical-then-syntactic-linear-subspaces-in-both-speech-ssl-models-and-text-llms-mirroring-child-language-acquisition-order. -
A single mean-difference direction per tool-pair spans a compact PCA subspace: ~10 principal components capture ~91% of variance across 15 tools, far below a random-Gaussian control. Wu et al. (2026) find this compact tool-selection subspace across Gemma 3, Qwen 3, and Llama 3.1, tied to the same causal tool-switching direction described under
linear-direction. Seea-single-mean-difference-direction-per-tool-pair-linearly-reads-and-causally-switches-tool-selection-across-gemma-3-qwen-3-and-llama-3-1-with-a-three-stage-circuit-traced-via-saes-and-transcoders. -
Correct future chess moves are linearly decodable in Leela Chess Zero’s intermediate layers, and steering against a late-layer learned prior recovers 61.7% of “forgotten puzzles.” Sandmann, Lapuschkin & Samek (2025) extend the logit lens to find correct solutions present in intermediate layers get overridden by a late-layer safety/aggression preference, and a causal steering intervention against that preference recovers most of these cases. See
future-chess-moves-are-linearly-decodable-in-leela-chess-zeros-intermediate-layers-and-steering-against-its-late-layer-safety-preference-recovers-61-7-percent-of-forgotten-puzzles. -
Multi-feature SAE steering vectors causally force instruction-following, with last-layer placement proving critical. He et al. (2025) build steering vectors from k=15 SAE decoder directions, achieving loose accuracy up to 0.7, while last-layer (vs. earlier-layer) placement is essential (loose accuracy collapses from 0.64 to 0.33 one layer earlier). See
multi-feature-sae-steering-vectors-causally-force-instruction-following-across-gemma-2-and-llama-3-1-with-loose-accuracy-up-to-0-7-and-last-layer-placement-proving-critical. -
A cross-model “Assistant Axis” is the leading principal component of a 275-persona activation space, and causally capping its projection reduces jailbreak success by ~60% with no measurable capability loss. Lu et al. (2026) find PC1 of the persona space correlates >0.92 pairwise across three models and persists in base (non-instruction-tuned) checkpoints, evidencing a pretraining origin. See
a-cross-model-assistant-axis-aligning-with-pc1-of-a-275-persona-activation-space-causally-reduces-jailbreak-success-by-about-60-percent-with-no-measurable-capability-loss. -
A micro-to-macro “Granularity Axis” for social roles aligns with PC1 of the role-representation space at cosine >0.95 and causally steers judge-rated output granularity. Qin et al. (2026) find the axis explains over 40% of variance in both Qwen3-8B and Llama-3.1-8B-Instruct, with monotonic level-ordered projections (Spearman/Pearson >0.93). See
a-granularity-contrast-axis-aligns-with-pc1-of-a-role-representation-space-at-cosine-0-97-and-causally-steers-judge-rated-output-granularity-in-the-predicted-direction. -
A low-dimensional “cell-based” subspace organized along entity-index and relation-index axes supports relational binding, and steering within it reliably flips bound-attribute predictions. Dai, Heinzerling & Inui (2026) extract this subspace via PLS regression probing from Llama3-8B-Instruct and Qwen3-8B (strongest at layers 10-20), reaching index-prediction R^2 of ~0.95 and attribute-prediction accuracy 0.94-0.95, beating a Hessian-based propositional-probe baseline. See
a-low-dimensional-cell-based-subspace-organized-along-entity-index-and-relation-index-axes-supports-relational-binding-in-llms-and-steering-within-it-reliably-flips-bound-attribute-predictions. -
LLMs consolidate entity-state tracking into a local binary subspace far more decodable than a global multi-way state subspace, and null-space projection of the state-tag direction causally changes completions. Tang et al. (2026) find local binary probes reach ~0.9 accuracy versus ~0.3 for global 8-way state probes, and a learned sparse mask over the residual stream’s PCA basis reveals a shared positional-information subspace across circuits at layers 15-25 in CodeLlama-13B. See
llms-consolidate-entity-state-tracking-into-a-local-binary-subspace-far-more-decodably-than-a-global-multi-way-state-subspace-and-null-space-projection-of-the-tag-direction-changes-completions. -
A PCA-derived “Ordering ID” principal component localizes the previously-abstract Binding-ID mechanism, and steering along it in fixed unit-steps monotonically shifts the predicted bound attribute. Dai, Heinzerling & Inui (2024) confirm this OI-PC direction via Logit Difference/Logit Flip metrics that increase monotonically with steering steps, replicating across Llama2-7B, Llama3-8B, Qwen1.5-7B, and Pythia-6.9B. See
a-pca-derived-ordering-id-principal-component-localizes-the-binding-id-mechanism-and-steering-along-it-in-fixed-unit-steps-monotonically-shifts-the-predicted-bound-attribute. -
A 2D signed cultural-value axis shows “latent entanglement”: steering geometry along one dimension is not independent of the other. Dang, Kieu & Masud (2026) quantify this cross-axis entanglement (ratio 0.72-0.81 naive, dropping to 0.53 under hybrid steering) as a joint-subspace property of the Inglehart-Welzel cultural map extracted from Llama-3.2-3B, Qwen3-4B, and Gemma-3-4B. See
cultural-value-steering-axes-in-llms-show-latent-entanglement-steering-one-axis-induces-correlated-shifts-on-a-second-axis-mirroring-the-real-world-correlation-between-those-values. -
Number-task subspaces (comparison, parity, primality, successor/predecessor) are measurably distinct yet linearly inter-transformable, with near-orthogonal low-level feature axes. Hu, Niu & Varma (2026) find Procrustes disparity ~0.010 (vs. a 0.077-0.273 permutation baseline) alongside SVCCA canonical correlations of 0.80-0.90 across task pairs in BERT, GPT-2, Qwen2.5-7B, and Qwen2.5-Math-7B, with a parity axis nearly orthogonal to magnitude (88.8 degrees) and a partially-coupled primality axis (68.8 degrees). See
number-task-representations-form-distinct-yet-linearly-inter-transformable-subspaces-with-near-orthogonal-parity-and-magnitude-axes. -
Distributed Alignment Search locates linear subspaces for number-specific and unit-specific quantity-comparison heuristics, and interchange interventions on them exceed 0.9 accuracy in middle layers. Sasaki et al. (2026) causally validate NumLogDiff and UnitLogDiff subspaces this way, with a linear surrogate built from these variables predicting Qwen3-4B-Base’s comparison preference at R^2~0.817. See
distributed-alignment-search-finds-linear-subspaces-for-number-and-unit-specific-heuristics-that-causally-predict-and-control-llm-quantity-comparison-decisions. -
Independently trained multimodal contrastive models’ embedding spaces are related, up to mean shift, by a single shared orthogonal map applied identically to both modalities. Gupta, Kansal, Jegelka, Isola & Garg (2026) prove this theoretically (kernel agreement on a small cross-modal anchor set forces the single-Q relationship) and verify it empirically across CLIP, SigLIP, and FLAVA-family models with different architectures and training data. See
independently-trained-multimodal-contrastive-models-share-embedding-spaces-related-by-a-single-orthogonal-map-applied-to-both-modalities. -
LLMs fine-tuned to evade activation monitors for benign concepts, when conditioned on a trigger, generalize zero-shot to evading unseen safety monitors, via a targeted relocation of activations into a low-dimensional subspace. McGuinness, Serrano, Bailey & Emmons (2025) validate this across Llama, Gemma, and Qwen model families, showing the evasion succeeds even against monitors trained post hoc on the model’s frozen weights, with the underlying mechanism traced (in Gemma-2-9b-it) to a subspace relocation rather than a diffuse activation change. See
neural-chameleons-fine-tuned-to-evade-benign-activation-monitors-generalize-zero-shot-to-evading-unseen-safety-monitors-via-a-low-dimensional-subspace-relocation. -
A real pretrained weather foundation model’s latent bottleneck is PCA-organized by a stable seasonal-cycle axis, while extreme storm events fail to form a linearly separable cluster along any other component, and the causal relevance of specific latent regions is independently confirmed via LRP-guided perturbation. Kasteleyn & Lucic (2026) find Aurora’s PC1 captures 24.1% of variance with 0.998 bootstrap cosine-similarity stability, while storm events cluster only weakly and unstably on PC3 (mean cosine similarity 0.650±0.269); masking the top-1% Layer-wise-Relevance-Propagation-flagged pixels degrades forecasts 3.31x more than random masking. See
auroras-latent-bottleneck-is-pca-organized-by-seasonal-cycle-not-extreme-storms-and-lrp-relevant-pixels-are-causally-necessary-for-forecast-accuracy. -
After linearly projecting out compositional (atom-count) signal, the remaining geometric information’s accessibility to a linear probe varies 6.6x across ten real pretrained atomistic foundation models depending mainly on task alignment, and inside one architecture that information routes through separate linear subspaces by symmetry type. Steier (2026) introduces Compositional Probe Decomposition (CPD): PaiNN’s residual R^2 for HOMO-LUMO gap drops from 0.53 to 0.31 when retrained on energy instead; inside MACE, L=1 (vector) channels favor dipole moment (R^2 0.59 vs. 0.38) while L=0 (scalar) channels favor HOMO-LUMO gap (R^2 0.76 vs. 0.34), a symmetry-typed subspace split absent in ViSNet. New method
compositional-probe-decomposition. Seeinformation-routing-in-atomistic-foundation-models-shows-task-alignment-and-symmetry-typed-channels-govern-linear-disentanglement-of-composition-from-geometry. -
PCA and linear probing recover a near-orthogonal Cartesian x/y coordinate subspace inside a toy transformer trained from scratch on spatial navigation, and causal ablation shows the internal map becomes self-sufficient at a sharp depth transition. Baumgartner, Burgess, Spens & Manescu (2025) find GPT-2 small trained on grid-navigation shows top-2 principal components aligning with grid axes at Layer 7, a linear probe recovering (x,y) with R^2=0.93 at Layer 8 whose basis vectors are nearly orthogonal (cos θ≈−0.0415), and an ablation-revealed phase transition where loop-completion accuracy jumps from near-zero to 100% at Layer 8+ — a task-dependent finding, since goal-directed shortest-path variants show neither the orthogonal structure nor the transition. See
pca-and-linear-probing-recover-an-orthogonal-xy-coordinate-cognitive-map-in-a-gpt-2-trained-on-grid-navigation-that-becomes-causally-self-sufficient-at-a-sharp-layer-8-phase-transition. -
A TTS model’s language-model module has a low-dimensional, speaker-invariant, additively-composable emotion subspace, while its flow-matching module entangles speaker and emotion on a shared manifold — a within-model architectural dissociation in emotion geometry. Wang, Bailey & Dang (2026) find CosyVoice2’s SLM module shows a ~28D speaker-invariant emotion subspace (positive delta local-intrinsic-dimensionality, +0.84) while its CFM module entangles speaker/emotion on a shared ~13D manifold (delta-LID −1.48), with CAA-style steering confirming SLM’s cleaner geometry yields better proportional mixed-emotion control. See
cosyvoice2s-language-model-module-has-a-low-dimensional-speaker-invariant-composable-emotion-subspace-while-its-flow-matching-module-entangles-speaker-and-emotion-on-a-shared-manifold. -
TopK SAE codes trained on four real pretrained audio foundation models raise DCI completeness for acoustic factors while preserving downstream classification informativeness, localizing specific factors to specific layers. Mariotte, Lebourdais, Almudévar, Tahon, Ortega & Dugué (2025) show this on AST, HuBERT-base, WavLM-base-plus, and MERT-v1-95M: pitch localizes to early layers for HuBERT/WavLM, formants to final layers. New method
dci-disentanglement. Seesparse-autoencoder-codes-on-four-audio-foundation-models-raise-dci-completeness-for-acoustic-factors-while-preserving-classification-informativeness. -
A k-NN-based cross-language overlap statistic reveals multilingual LLMs form a partially-shared interlingual subspace surrounded by fragmented, language-specific components, and the alignment is causally preserved or disrupted by which layers are frozen during fine-tuning. Wilie, Cahyawijaya, He & Fung (2025) introduce Interlingual Local Overlap (ILO), a k-NN neighborhood-overlap statistic computed across languages rather than across layers, applied to Aya Expanse 8B, Llama-3.1-8B, and Gemma-2-9B, finding overlap varies systematically by resource-level and linguistic family. New method
interlingual-local-overlap. Seehigh-dimensional-interlingual-representations-reveal-a-partially-shared-core-subspace-and-language-specific-fragments-across-multilingual-llms. -
Task-specific linguistic subspaces, compared directly to each other rather than only via their own probe accuracies, first share information broadly and later disentangle into distinct subspaces at identifiable “critical learning phases” of pretraining. Müller-Eberstein, van der Goot, Plank & Titov (2023) fit an information-theoretic probing suite for 9 syntax/semantics/reasoning tasks across MultiBERTs’ 2M pretraining steps and 5 seeds, comparing the fitted probes’ subspaces via a subspace-similarity metric: syntax subspaces form within 0.5% of training, while semantic/reasoning subspaces specialize much later. New method
subspace-similarity-probing. Seesubspace-chronicles-tracks-critical-learning-phases-of-linguistic-subspaces-across-multiberts-pretraining. -
Next-token-prediction optimization implicitly performs an SVD factorization of a context/next-token co-occurrence matrix, and real pretrained models’ embeddings’ sign pattern (orthant) within this basis recovers increasingly fine-grained semantic categories as more components are included. Zhao & Thrampoulidis (2025) validate orthant-based clustering on synthetic co-occurrence data and real corpora (TinyStories, WikiText-2), confirming the recovered structure (grammatical categories, NER types, topical clusters) directly on GPT-2, BERT, and Qwen. New method
ntp-svd-orthant-decomposition. Seezhao-thrampoulidis-2025-svd-orthant-decomposition-of-next-token-prediction-recovers-increasingly-fine-grained-real-semantic-categories-in-gpt-2-bert-and-qwen. -
Probe-derived, event-context-reweighted “field” directions for kinematic, contact, and object-permanence variables in purpose-trained toy world models causally increase event-specific prediction loss when ablated, with validated controls. Liu & Chen (2026) train GRU, Transformer-lite, and RSSM-lite transition models on synthetic Kubric-style object-state sequences, finding a 3-class linear probe on hidden states reaches macro-F1=1.00 for event-regime classification and a phase-aware field-readout probe reaches mean macro-F1=0.900 on RSSM hidden states; ablating the contact-aligned direction (Causal Field Effect) increases collision-window prediction loss in 6/6 architecture-seed cases beyond random-direction, random-subspace, and label-shuffle controls (the object-permanence-direction result shows a more qualified, mixed margin against the random-subspace control specifically). New method
causal-field-effect-ablation. Seeliu-chen-2026-probe-derived-field-aligned-directions-in-toy-world-models-causally-increase-event-specific-prediction-loss-when-ablated. -
Foundational: classical (pre-neural) sparse coding on trained word embeddings recovers ~2,000 “atoms of discourse,” and polysemous words decompose as sparse combinations of a handful of them. Arora, Li, Liang, Ma & Risteski (2018) apply k-SVD-style sparse dictionary learning directly to trained word2vec/GloVe embedding matrices, showing individual polysemous word vectors are well-approximated as a sparse linear combination of a few atoms out of an overcomplete ~2,000-atom dictionary — a foundational, pre-neural-SAE demonstration of subspace/superposition structure in real trained embeddings, methodologically ancestral to later sparse-autoencoder dictionary-learning work. New method
sparse-coding-discourse-atoms. Seearora-etal-2018-word-senses-linearly-superpose-as-sparse-combinations-of-about-2000-discourse-atoms-recovered-by-classical-sparse-coding-on-trained-word-vectors. -
PCA-whitening followed by ICA recovers a privileged, sparse, axis-aligned semantic decomposition — unlike PCA’s arbitrary rotation — matchable across languages, models, and modalities. Yamagiwa, Oyama & Shimodaira (2023) apply this to real word2vec/GloVe/fastText embeddings, multilingual embeddings, BERT-family contextual embeddings, and image encoders, finding individually interpretable, sparse independent components whose cross-model correlation supports a “universal geometry” claim. New method
ica-axis-decomposition. Seeyamagiwa-etal-2023-ica-applied-after-pca-whitening-to-real-word-and-contextual-embeddings-recovers-a-sparse-axis-aligned-semantic-decomposition-that-matches-across-languages-models-and-modalities. -
A Top-k SAE trained on real E5-large-v2 sentence embeddings yields near-orthogonal decoder directions, and clamping individual latents causally re-ranks retrieval results. Shin & Kim (2026) measure Decoder Orthogonality (mean pairwise cosine similarity 0.0408) at 92.6% explained variance, then zero specific automatically-labeled latents (e.g. “Industrial Safety,” “Bridge Infrastructure”), causally shifting a query’s top retrieval result to a much lower rank. See
shin-kim-2026-a-topk-sae-trained-on-e5-large-v2-sentence-embeddings-yields-near-orthogonal-decoder-directions-and-clamping-individual-latents-causally-re-ranks-retrieval-results. -
Foundational: two independently, monolingually trained real word-embedding spaces are related by a single orthogonal map, recoverable with no parallel data at all. Conneau, Lample, Ranzato, Denoyer & Jégou (2018, MUSE) fit this map adversarially and refine it via iterative orthogonal Procrustes on the map’s own most-confident nearest-neighbor pairs, validating it via real bilingual dictionary induction accuracy rivaling supervised baselines — a foundational precursor to later per-language affine-subspace overlap findings (see “Cross-lingual subspace overlap” above) and to vec2vec-style universal-alignment claims. New method
unsupervised-adversarial-procrustes-alignment. Seeconneau-etal-2018-muse-an-unsupervised-orthogonal-map-fit-with-no-parallel-data-aligns-two-independently-trained-monolingual-word-embedding-spaces-and-achieves-real-word-translation-accuracy. -
A low-dimensional subspace identified via partial least squares, not a single classifier direction, encodes a numeric attribute shared by two compared entities, and intervening along its leading component causally flips the model’s logical comparison answer. El-Shangiti, Hiraoka, AlQuabeh, Heinzerling & Inui (2024) fit a 5-component PLS model per numeric attribute (birth year, death year, latitude) on real LLM last-token activations, reaching R^2 above 0.8, then show the intervention’s causal effect on Yes/No comparison answers is concentrated in roughly the first half of each network’s layers, replicated across Llama-3-8B-Instruct, Mistral-7B-Instruct, and Qwen2.5-7B-Instruct. New method
pls-subspace-probing. Seeel-shangiti-etal-2024-numeric-comparison-subspaces-in-llms-are-linearly-decodable-via-pls-and-causally-control-logical-comparison-answers. -
Foundational: most visual concepts in a real trained CNN require several jointly-fit filters, not one, and individual filters are typically polysemantic. Fong & Vedaldi (2018, Net2Vec) fit each concept as a learned weight vector over multiple AlexNet filter-activation maps, scored against real segmentation masks, quantitatively confirming both multi-filter concept encoding and filter polysemy — a multi-filter subspace generalization of single-unit dissection. New method
multi-filter-concept-vector-fitting. Seefong-vedaldi-2018-net2vec-shows-most-visual-concepts-in-a-trained-cnn-require-multiple-jointly-fit-filters-and-individual-filters-are-typically-polysemantic. -
Foundational, supervised precursor to unsupervised cross-lingual alignment: a linear map fit from a small seed dictionary aligns two independently-trained monolingual embedding spaces. Mikolov, Le & Sutskever (2013) fit this map from real trained monolingual skip-gram embeddings plus a small bilingual dictionary, validating it via real held-out word-translation accuracy (e.g. ~90% precision-at-5 reported for English-Spanish) — five years before Conneau et al.’s unsupervised MUSE removed the seed-dictionary requirement entirely. New method
supervised-bilingual-dictionary-linear-map. Seemikolov-le-sutskever-2013-a-linear-transformation-fit-from-a-small-bilingual-dictionary-maps-one-monolingual-word-embedding-space-onto-another-with-high-real-translation-accuracy. -
A formal necessary-and-sufficient condition connecting within-language analogy preservation to cross-lingual map linearity, empirically confirmed across 12 real trained monolingual embeddings. Peng, Stevenson, Lin & Li (2020) prove word-analogy preservation is necessary and sufficient for the ground-truth cross-lingual mapping to be linear, then test this against real trained embeddings across 12 languages using a new cross-lingual analogy dataset, measuring how mapping-linearity quality tracks analogy-preservation quality. See
peng-etal-2020-cross-lingual-embedding-map-linearity-is-proven-necessary-and-sufficient-with-word-analogy-preservation-and-empirically-confirmed-across-12-real-trained-monolingual-embeddings. -
Real pretrained mBERT’s own representation space supports nearest-neighbor cross-lingual translation-pair retrieval with no fitted map at all, alongside strong zero-shot cross-lingual transfer. Pires, Schlinger & Garrette (2019) show translation pairs are retrievable via direct nearest-neighbor search in mBERT’s own shared representation space (no additional linear map fit required), complementing this map’s other multilingual-BERT geometry findings, and demonstrate strong zero-shot cross-lingual transfer for NER/POS tagging between typologically similar languages. New method
nearest-neighbor-cross-lingual-retrieval. Seepires-etal-2019-mbert-representation-space-supports-real-nearest-neighbor-cross-lingual-translation-pair-retrieval-and-strong-zero-shot-cross-lingual-transfer. -
A single unconstrained (non-orthogonal) linear map transfers real vision-encoder embeddings into a frozen language model’s token space, causally driving its generation. Merullo, Castricato, Eickhoff & Pavlick (2023) fit a linear projection from three independently pretrained vision encoders (CLIP ResNet-50x16, NFRN50, BEiT-Large) into frozen GPT-J-6B’s embedding space, training only the map itself, and use the mapped vectors as soft prompts that causally drive zero-shot image captioning and few-shot VQA — evidence both that a simple linear map suffices to bridge two independently-trained modalities’ representation spaces (criterion a) and that this mapping is causally usable to steer real generation (criterion b), while an RSA appendix explicitly leaves a fuller geometric-similarity characterization to future work. See
merullo-etal-2023-a-single-unconstrained-linear-map-transfers-real-vision-encoder-embeddings-into-a-frozen-gpt-j-token-space-and-causally-drives-captioning. -
Additive binding-ID vectors occupy a continuous subspace whose pairwise distances predict real behavioral confusability, not just decodability. Feng & Steinhardt (2023) show binding-ID vectors that solve the variable-binding problem in real Pythia and LLaMA-family models form a genuine geometric subspace in which distance between two binding vectors predicts how often the model confuses the corresponding entity-attribute bindings, and causally validate the vectors’ functional role via patching/removal experiments that change which attribute is retrieved for which entity. See
feng-steinhardt-2023-binding-id-vectors-form-a-continuous-subspace-whose-pairwise-distances-predict-binding-confusability-and-patching-or-removing-them-causally-changes-which-attribute-is-retrieved-for-which-entity. -
A behaviorally-inferred, rotation-invariant relational isomorphism between real LLM representations and an external grounded space, strengthening with scale. Patel & Pavlick (2022) test whether GPT-2/GPT-3/BERT’s internal representations of color, cardinal-direction, and spatial-grid terms carry the same relational structure as external grounded spaces, via few-shot performance under the true grounding vs. a structure-preserving rotation of it vs. a structure-destroying random reassignment — GPT-3 (175B) matches its own Original-condition accuracy under rotation while collapsing under randomization, with the effect (and raw color-grounding accuracy) strengthening markedly with scale, no explicit activation-to-space map ever fit. See
patel-pavlick-2022-behavioral-performance-survives-rotation-of-grounded-space-but-collapses-under-random-reassignment. -
A word’s true polysemy count is recoverable purely from where its many context-embedding subspaces intersect on the Grassmannian, with no lexicographic annotation involved. Mu, Bhat & Viswanath (2016) build one linear (Grassmannian) subspace per word from the top singular directions of its many context-window word2vec embeddings, and find genuinely monosemous words’ many context-subspaces intersect tightly near a single shared direction in real Wikipedia-trained word2vec, while polysemous words’ context-subspaces disperse — a purely geometric-shape measurement (no causal intervention) that recovers WordNet-annotated sense counts without ever consulting WordNet during fitting. See
mu-etal-2016-monosemous-word-vectors-sit-near-the-grassmannian-intersection-of-their-many-context-subspaces-in-real-word2vec-embeddings. -
A provably graph-Laplacian-equivalent spectral subspace, learned by a real deep encoder from real environment transitions, is frozen and causally determines downstream RL sample efficiency. Farebrother, Greaves, Agarwal, Le Lan, Goroshin, Castro & Bellemare (2023, Proto-Value Networks) train a real Impala-CNN encoder on real Atari transitions (RL Unplugged, 46 games) to estimate the successor measure, proving the resulting features span the top- singular vectors of the successor-measure matrix (graph-Laplacian eigenvectors/proto-value functions under a symmetric transition structure); freezing this subspace and training only a linear RL head online matches or exceeds DQN using ~4M interactions versus DQN’s 200M frames, with quantified per-game score deltas (e.g. Asterix 15,401 vs. 2,953). See
farebrother-etal-2023-a-frozen-laplacian-eigenvector-subspace-learned-from-real-atari-transitions-supports-linear-rl-that-matches-dqn-using-50x-fewer-environment-interactions. -
Real pretrained MoE experts are strongly functionally decorrelated via near-zero cross-expert Jacobian alignment, while their PCA subspaces show only partial, non-maximal Grassmannian separation. Liu (2026) measures Mistral-8x7B and Qwen1.5-MoE-A2.7B, finding cross-expert Jacobian cosine similarity clusters tightly near zero (Mistral middle-layer mean 0.062; Qwen ~0.000-0.001) while the same experts’ routed-representation PCA subspaces sit at Grassmannian distances (2.061-2.689) well below the theoretical maximum (~3.51) — decorrelated function, only partially separated geometry. A controlled ablation shows top-k routing itself causes much larger subspace separation (mean distance 2.463) than fully-soft routing (0.480) in an otherwise-identical custom Transformer. See
liu-2026-real-pretrained-moe-experts-are-strongly-functionally-decorrelated-via-near-zero-cross-expert-jacobian-alignment-while-their-pca-subspaces-show-only-partial-non-maximal-grassmannian-separation. -
Real Qwen and Llama models bind character-object-state triples via low-rank Ordering-ID subspaces that interchange-intervention patching localizes to specific layer ranges. Prakash, Shapira, Sharma, Riedl, Belinkov, Rott Shaham, Bau & Geiger (2025) show real Qwen2.5-14B-Instruct, Llama-3-70B-Instruct, and Llama-3.1-405B-Instruct bind belief-tracking triples by co-locating “Ordering ID” reference information in low-rank residual-stream subspaces, with a separate visibility-ID subspace for observed/observing-character relations; interchange-intervention patching localizes different bound variables to distinct layer ranges (e.g. “Answer Payload” present only after layer 31 in all n=80 test cases). See
prakash-etal-2025-real-qwen-llama-models-bind-character-object-state-triples-via-low-rank-ordering-id-subspaces-that-interchange-intervention-patching-localizes-to-specific-layer-ranges. -
A real trained in-context-RL transformer linearly decodes XY position by layer 2 and aligns its representations across differently-cued environments, supporting emergent shortcut-taking. Fang & Rajan (2026) train a custom 3-layer Transformer from scratch via decision-pretraining meta-RL on gridworld/tree-maze tasks, finding XY position is linearly decodable from layer-2 representations and kernel alignment between the model’s representations and the latent environment structure increases with context length; memory-token ablation causally reduces the model’s shortcut-path selection, observed in over 60% of held-out test simulations at baseline. See
fang-rajan-2026-a-real-trained-in-context-rl-transformer-linearly-decodes-xy-position-by-layer-2-and-aligns-its-representations-across-differently-cued-environments-supporting-emergent-shortcut-taking. -
A cross-lingually adapted Backpack LM’s per-word sense-vector manifold preserves a measurable, above-control amount of its English cosine-similarity topology and orthogonal-Procrustes alignment. Cruz, Adelani & Aji (2026) adapt a GPT-2-based Backpack model’s multi-sense-vector-per-word representation from English to Estonian, Turkish, Indonesian and Swahili, finding sense-vector cosine-Gram-matrix topology (rho~0.25-0.30 vs. control ~0.16-0.21) and Procrustes-aligned cosine similarity (0.35-0.44 vs. control 0.26-0.33) both exceed a matched control by ~0.09-0.11 across all four languages; ablating the model’s own soft sense-mixture weights (full mixture vs. top-1 vs. uniform) raises cross-entropy on FLORES devtest by roughly +6 in all four languages, tying the geometry-bearing mixture mechanism to a measured translation-quality effect. See
sensia-sense-vector-topology-partially-transfers-across-languages-via-procrustes-alignment-and-ablating-the-sense-mixture-degrades-translation. -
Refusal in real Gemma-2-2B-IT and Llama-3.1-8B-IT is implemented by a causally-minimal SET of SAE latents, not a single direction, with redundant “hydra” features that reactivate on system-prompt tokens after the primary set is ablated. Prakash, Yeo, Abdullah, Satapathy, Cambria & Lee (2026, AAAI 2026) extend single-direction refusal ablation (Arditi et al.) into a structured multi-latent SAE decomposition, finding ablating the identified latent set shifts jailbreak attack success rate from 4% to 33% (Gemma) / 71% to 57-70% (Llama), while ~74% of dormant redundant features reactivate on system/BOS tokens after ablation — a genuinely multi-dimensional, redundant causal subspace. See
a-causally-minimal-sae-latent-set-not-a-single-direction-implements-refusal-with-redundant-hydra-features-that-reactivate-after-ablation. -
A global spatial coordinate map, matching true geographic relational structure, emerges in real continually-pretrained Qwen2.5-0.5B hidden states purely from local relational training data. Xia, Chen, Wang, Zhu, Zhang, Chen & Xiao (2025) show absolute (x,y) coordinates are probe-recoverable with R-squared=1.00, and latent-vector distances/angles directly correlate with true geographic distances/angles, despite training data only ever describing local (nearby-point) relationships in a simulated 100x100-grid city — a genuinely emergent global map from local training signal, with no activation-level causal intervention performed. See
continually-pretrained-qwen2.5-0.5b-hidden-states-recover-a-perfect-r2-global-coordinate-map-from-purely-local-relational-training. -
Edited facts’ associative-memory key vectors overlap in a whitened subspace with a heavy-tailed, high-kurtosis distribution, and sequential real-model editing causally forgets unrelated facts as this overlap accumulates. Hu, Cao, Chen, Liu & Zhao (2025, AAAI 2025) extend ROME’s closed-form single-edit solution to the -edit case, showing the interference term reduces to a normalized key-vector dot product after whitening by the key covariance; measuring this across 11 real LLMs (GPT-2 family, GPT-J-6B, Pythia family, Llama-2/3 family) finds reliably heavy-tailed, zero-mean overlap distributions specifically in the whitened space, and sequential ROME editing on GPT-J shows continual edits progressively erode confidence in held-out unrelated facts until they are forgotten. See
edited-facts-key-vectors-overlap-in-a-whitened-associative-memory-space-with-a-heavy-tailed-high-kurtosis-distribution-and-sequential-rome-editing-causally-forgets-unrelated-facts-as-interference-accumulates. -
Task-recognition and task-learning attention heads project real Llama/Qwen/Yi hidden states onto a label-unembedding task subspace, and injecting their summed outputs into zero-shot prompts causally recovers most of the in-context-learning behavioral gain. Yang, Cho & Inoue (2026) show a projection-based logit attribution (TSLA) reveals two dissociable head roles whose outputs align with the span of label-token unembeddings, with strong layerwise correlation (rho=0.94) between hidden-state-update alignment and task-recognition-head alignment; patching the summed top-3% head outputs into zero-shot (no-demonstration) prompts raises classification accuracy from a 9.2% baseline to 40.4%, and ablating each head type collapses a distinct causal signature (task-recognition ratio or accuracy respectively). See
task-recognition-and-task-learning-attention-heads-in-icl-project-hidden-states-onto-a-label-unembedding-task-subspace-and-injecting-their-summed-outputs-into-zero-shot-prompts-recovers-most-of-the-icl-behavioral-gain. -
A real, custom-trained transformer develops separate low-dimensional residual-stream subspaces for numerical constants and variable names, causally validated via interchange interventions. Wu, Geiger & Millière (2025) train a 12-layer, 8-head GPT-2-style transformer from scratch on synthetic variable-assignment programs to >99.9% test accuracy; PCA plus L1-regularized linear probing identifies a 10-component numerical-constant subspace and a 26-component variable-name subspace, with UMAP showing increasing cluster separation across training, and interchange interventions swapping only the selected subspace between original and counterfactual programs causally validate each subspace’s role. See
wu-geiger-milliere-2025-a-real-custom-trained-transformer-develops-separate-low-dimensional-residual-stream-subspaces-for-numerical-constants-and-variable-names-causally-validated-via-interchange-interventions. -
Hierarchical hypernym/hyponym concept relations in real Llama and Qwen3 are encoded in domain-specific, 150-250-dimensional subspaces with similar cross-domain structure, causally validated via concept-direction steering. Sakata, Heinzerling, Ito, Yokoi & Inui (2026) extend Linear Relational Concepts/Embeddings into a depth- and domain-specific “Linear Hierarchical Encoding” () fit from real Llama-3.2-3B, Llama-3.1-8B, Qwen3-8B and Qwen3-14B hidden states: hierarchical information lives in relatively low-dimensional subspaces (150-250 dims for 3000-5000-dim hidden states), the relevant subspace is domain-specific, and domain-specific subspaces share similar hierarchical structure across domains. Steering by adding a scaled concept-direction difference to a child representation at every layer causally flips next-token prediction toward the target parent (Causality up to 0.93). See
sakata-etal-2026-hierarchical-concept-relations-in-real-llama-and-qwen3-are-encoded-in-domain-specific-150-to-250-dimensional-subspaces-and-steering-along-concept-direction-differences-causally-flips-predictions. -
A Procrustes-fitted linear map between composed-subword and whole-word embedding spaces reveals family-dependent structural isometry. Peng, Chai & Søgaard (2025, EMNLP 2025) fit an orthogonal Procrustes alignment between real models’ composed-subword and whole-word embedding spaces across layers of Llama3-8B/3.1-8B-Instruct, Aya-expanse-8B, Gemma2-9B-it and Qwen2.5-7B-Instruct: simple vector addition of subword embeddings consistently best approximates whole-word embeddings, but the degree of structural isometry itself splits into three family-dependent patterns (high for Aya-expanse/Gemma, very low for Llama 3/3.1, moderate-then-dropping for others) — a genuine geometric-alignment-quality claim (not mere retrieval accuracy), purely observational. See
peng-chai-sogaard-2025-a-procrustes-fitted-linear-map-between-composed-subword-and-whole-word-embedding-spaces-shows-family-dependent-isometry-in-real-instruction-tuned-llms. -
Concept-aligned-token SAE feature subgroups in a real safety-tuned LLM localize jailbreak susceptibility to mid-to-late layers, causally confirmed via targeted feature amplification. Das & Gaur (2026) extract concept-aligned tokens from harmful prompts in real Gemma-2-2B-IT (BeaverTails, 14 harm categories) via cosine similarity to a ReFT-derived harm-concept subspace, then identify Gemma-Scope SAE feature subgroups for those tokens across all 26 layers using three independent grouping strategies (agglomerative clustering, hierarchical-linkage, single-token-driven); all three convergently implicate layers approximately 16-25 as the most steerable, and causally amplifying only the top features from an identified subgroup measurably raises an LLM-judged harmfulness score relative to baseline, per-category and per-layer — a causal, feature-subgroup-resolved localization of jailbreak vulnerability within the SAE-feature basis, complementing coarser diff-of-means jailbreak-direction findings elsewhere on the map with a finer within-layer, within-subspace picture. See
das-gaur-2026-concept-aligned-token-sae-feature-subgroups-in-real-gemma-2-2b-it-localize-jailbreak-susceptibility-to-mid-to-late-layers-causally-confirmed-via-targeted-feature-amplification. -
Real tabular in-context-learning foundation models build class-conditional prototype/vote geometry in activation space, causally distinct from — and going beyond — mere linear separability. Biloš, Wilson, Schneider & Nevmyvaka (2026) study three real pretrained tabular foundation models (TabPFNv2, TabICLv2, Mitra): TabICLv2 reads out predictions via a nearest-prototype rule (per-class centroid of context-row activations, nearest-neighbor assignment), while TabPFNv2/Mitra instead use an attention-weighted vote at a specific layer; a linear probe alone under-explains the readout (0.859 acc) and a bounding nonlinear-MLP probe adds only marginal accuracy, but causal interventions are decisive — forcing uniform attention drops TabPFNv2 accuracy from 0.87 to 0.49, and transplanting one model’s readout rule onto another’s activations (mismatched mechanism) drops accuracy 30-40 percentage points, while zeroing TabPFNv2’s positional-parameter matrix yields exact permutation invariance at no accuracy cost. A genuinely class-conditional centroid/vote geometry, causally confirmed via mechanism transplantation rather than probing alone. See
bilos-etal-2026-real-tabpfnv2-tabiclv2-and-mitra-build-class-conditional-prototype-vote-geometry-in-activation-space-causally-confirmed-via-attention-forcing-and-cross-model-mechanism-transplantation. -
Causal activation patching — not probing — localizes the transfer between vocalized, mimed, and imagined speech in a real brain-to-speech decoder to a compact, layer-specific subspace, with smooth interpolation across speech modes evidencing a shared continuous manifold. Maghsoudi & Mishra (2026) apply cross-mode activation patching, causal scrubbing, and coarse-to-fine causal tracing to a Conv1D-encoder + 3-layer bidirectional-GRU + HiFi-GAN decoder trained on real human sEEG (VOCALMIND dataset, vocalized/mimed/imagined speech). Patching vocalized-mode activations into the imagined-mode pathway raises reconstruction PCC from 0.725 to 0.954; the reverse direction collapses PCC to 0.177, establishing sufficiency and necessity. Causal scrubbing localizes the transfer to a 16-channel convolutional subspace (channels 32-48) and a specific RNN time window (steps 21-84) — KEEP-Conv (0.666 PCC) beats size-matched RAND-Conv (0.564) — while tri-modal linear interpolation between vocalized and imagined activations produces smooth, monotonic transitions with mimed speech landing intermediate, consistent with a shared continuous causal manifold across speech modes. See
maghsoudi-mishra-2026-causal-patching-localizes-vocalized-mimed-imagined-speech-transfer-to-a-compact-subspace-in-a-real-brain-to-speech-decoder.
Exercises
Base
- Let and . Compute .
Solution
are already orthonormal. .
- For the same , compute the residual and verify it is orthogonal to both and .
Solution
. Check: and ✓ — orthogonal to both basis vectors, hence to all of .
Middle
- Prove that is idempotent: for any .
Solution
. Since is already a linear combination of the ‘s, applying again: . Since is orthonormal, (1 if , else 0), collapsing the inner sum to just the term: . So .
- Prove the Pythagorean identity .
Solution
Write with . Then . The cross term vanishes since , , and vectors in and are orthogonal by definition of orthogonal complement. So .
Pro
- Prove that (as defined via an orthonormal basis) does not depend on the choice of orthonormal basis for — i.e. two different orthonormal bases of the same produce the same projection matrix.
Solution
can be characterized basis-independently as the unique linear map satisfying: for all , and for all (the defining property of the orthogonal projection onto , which exists and is unique by the projection theorem for closed — here, finite-dimensional, automatically closed — subspaces of an inner product space). Any orthonormal basis of , by construction, produces a map satisfying both properties (checked directly: the output is a linear combination of the ; and for any , using orthonormality). Since the defining properties pin down a unique map, any two orthonormal bases must yield the identical map .
- Let be two -dimensional subspaces representing two different papers’ independently-fitted estimates of “the same” concept subspace, with principal angles between them (defined via , the singular values of for orthonormal basis matrices ). If all , what can you conclude about ? If some , what does that indicate?
Solution
If all principal angles are , then exactly (every basis direction of one subspace has a perfectly aligned counterpart in the other, forcing the subspaces to coincide) — the two independent estimates agree completely. If some , there exists a direction in (a combination of its basis vectors) that is completely orthogonal to all of — i.e. the two estimated subspaces disagree on at least one entire independent direction, indicating the two fitting procedures found genuinely different (not just noisily perturbed versions of the same) subspaces along at least that one dimension. Principal angles between and quantify partial, graded (dis)agreement between the two estimates dimension-by-dimension, generalizing the single-direction case (where the only available comparison is for one angle).