Definition
Two sets are linearly separable if there exist , such that
The hyperplane is the decision boundary. This is the strict form; for finite sets it is equivalent to . For general (infinite) sets, guaranteeing a strict gap needs a topological condition (e.g. one set compact and the other closed, or positive distance between them); disjoint convex sets alone give only weak (non-strict) separation.
Homogeneous vs. affine. With this is affine separability (the boundary is an affine hyperplane ). Strictly linear (homogeneous) separability requires a boundary through the origin, . The ML term “linear classifier” usually allows a bias, but for a mathematical taxonomy the distinction is worth keeping — one can separately track homogeneous-linear-separability, affine-separability, margin-separability, and approximate-linear-decodability.
What it does and does not guarantee. Separability is a property of a labeled sample: it guarantees a perfect linear classifier exists on that sample, but not causality, out-of-sample stability, uniqueness of the direction , localization of the concept into one dimension, or independence from confounders. It is necessary — not sufficient — for a clean single Linear Direction.
Intuition
In : can you draw a single straight line with all of class on one side and all of class on the other? In : the same question with a flat hyperplane instead of a line.
Properties
-
Margin. The quality of a separation is — the smallest distance from any point to the hyperplane. A larger margin means the classes are more robustly, not just technically, separated.
-
Not scale-invariant in the naive sense, but the boundary is. Scaling for leaves the decision boundary and the sign of unchanged, but changes the raw margin formula’s numerator and denominator by the same factor , so the margin itself (as defined above) is also scale-invariant.
-
Convex-hull characterization. are linearly separable if and only if the convex hulls of and are disjoint — this is a consequence of the separating hyperplane theorem for disjoint convex sets. Zhou & Srikumar (2021) operationalize this directly on real contextualized embeddings (BERT, RoBERTa, ELMo): Convex-hull clustering (DirectProbe) finds the fewest convex, single-label regions consistent with a task’s labels without ever fitting a classifier, and shows the resulting cluster count and inter-cluster margin predict classifier accuracy — see the
directprobe-convex-clustersObservation. A follow-up (Zhou & Srikumar, arXiv:2106.14282) tracks this same convex-cluster geometry across fine-tuning: fine-tuning consistently widens the minimum inter-cluster margin between labels (the direct geometric driver of improved classification), while a new Spatial similarity (inter-cluster distance correlation) metric shows this widening largely preserves, rather than replaces, the pre-fine-tuning cluster arrangement — seefinetuning-preserves-cluster-geometry. -
A property of a dataset, not a claim about internal computation. Linear separability describes whether a hyperplane exists for the given points; it says nothing about whether a system that produced those points uses that hyperplane’s normal direction in its own computations. Establishing that requires an intervention (e.g. checking that moving a point along changes the system’s behavior), not just fitting a classifier.
-
Necessary, not sufficient, for a clean single Linear Direction. Separability only requires some hyperplane to exist; a single well-defined feature direction additionally requires that the same (up to scale) continues to work as the “value” of a graded, not just binary, feature — a stronger requirement.
-
Direction-to-vocabulary alignment can be quantitatively imprinted by training data composition. Kim & Lee (2026) probe language identity across all 268 layers of six multilingual LLMs, finding near-universal linear separability (99.8±0.1% average accuracy, emerging with a +76.4±8.2 percentage-point jump in the first transformer block) and introducing Token-Language Alignment — cosine similarity between a probe-learned language direction and every vocabulary/unembedding token embedding. The resulting alignment (Match@Peak) is not uniform across languages sharing a script: Chinese-inclusive-pretrained models reach 16.43% Chinese alignment versus 3.90% for English-centric models (a 4.21x ratio), while Latin-script languages stay uniformly low regardless of pretraining mix — evidence that a language direction’s alignment with the model’s own vocabulary geometry, not just its separability, is a data-dependent structural property. See
kim-lee-2026-language-directions-are-linearly-separable-from-layer-1-and-their-vocabulary-alignment-is-structurally-imprinted-by-pretraining-language-mix. -
Compounds with low intrinsic dimensionality, and can carry real causal weight. Saglam et al. (2025) measure both properties independently across 11 autoregressive models (GPT-2 through Mistral Small 3 24B): topic-cluster separability (hard-margin SVM) rises toward the final layers while the PCA-measured intrinsic dimensionality of the same activations stays low (“often under 10%” of the ambient dimension needed to explain 90% of variance) — separability and low dimensionality are two distinct, mutually reinforcing measurements of the same underlying geometry, not one implying the other. They also show the separating hyperplane’s normal is not just descriptive: adding the centroid-difference direction between chain-of-thought-framed and plain prompts to a hidden state causally induces CoT-style responses, and a probe built on the same final-layer separability substantially improves refusal rates against jailbreak prompts — see
topic-subspaces-separability-sharpens-with-depth-and-reasoning-framing. -
Sparse-autoencoder features causally editable at the patch level reveal a contrastive-vs-self-supervised split: CLIP’s activation geometry encodes abstract, style-invariant concepts absent or fragmented in DINOv2’s more visually granular feature geometry. Stevens, Chao, Berger-Wolf & Su (2025) train SAEs (24K-width) on frozen CLIP ViT-B/16 and DINOv2 ViT-B/14 patch activations, pairing discovered features with real-image exemplars and decoding vectors; editing a patch’s SAE features causally flips its predicted classification/segmentation class on ImageNet-1K and ADE20K, without retraining the ViT or task heads. See
sae-features-reveal-clip-encodes-abstract-style-invariant-concepts-while-dinov2-encodes-fragmented-visually-granular-features-and-are-causally-editable. -
A parameter-free Nearest Class-Mean clustering measure, applied at both the sample level and the semantic-class level, shows self-supervised training drives emergent clustering by semantic class beyond the augmentation-invariance objective it was designed to optimize. Ben-Shaul, Galanti, Shwartz-Ziv, Dekel & LeCun (2023) train VICReg/SimCLR objectives from scratch on custom ResNet and ViT backbones (CIFAR-100, FOOD101), finding NCC accuracy against true semantic classes rises with both training time and network depth, and exceeds NCC accuracy against random label partitions of equal size. See
reverse-engineering-self-supervised-learning-shows-ssl-training-drives-emergent-semantic-class-clustering-beyond-its-designed-augmentation-invariance-objective. -
Linear separability of an abstract concept emerges only above a hidden-dimension threshold, and this exact same emergent structure is what direction-based jailbreaks exploit — making dimension-reduction a defense. Teo, Abdullaev & Nguyen (2025) show via PCA across Qwen0.5B, GPT2-XL, Qwen7B, and Llama2-7B that final-layer emotion clusters become “distinct, separable” only “in models with more than 3,000 dimensions,” with linear-probe accuracy showing “an obvious distinction between models below and above 2,000 hidden dimensions.” Because white-box jailbreaks (ActAdd/Ablation) work by exploiting exactly this emergent linear safety direction, compressing the ambient dimension back down — via a random Fast Johnson-Lindenstrauss projection on attention Q/K matrices, or a learned linear bottleneck autoencoder on the residual stream — restores collapsed refusal/safety scores (e.g. Llama2-7B-Chat 0.03/0.14 under attack to 0.94-0.96 defended) while retaining most benign helpfulness, backed by a Rademacher-complexity bound tying steering-vector sample complexity to . See
teo-etal-2025-blessing-and-curse-of-dimensionality-in-safety-alignment-linear-safety-separability-emerges-with-scale-and-subspace-compression-defends-against-it. -
Graph-theoretic properties are linearly decodable from GNN embeddings at both node and graph level, with a scale-dependent collapse of global/size-related properties in task-specialized final layers. Pelletreau-Duris, van Bakel & Cochez (2024) fit linear-regression diagnostic classifiers () mapping GCN/GAT/GIN layer activations to dozens of local (degree, centrality measures, clustering coefficient) and global (density, diameter, #cliques, spectral radius, algebraic connectivity, small-world index) graph properties, on synthetic Grid-House graphs and the ClinTox molecular dataset. On ClinTox, size-correlated properties (#nodes/#edges) are near-perfectly linear early in a GIN ( at layers x1-x3) but collapse to - by the final pre-classification layer (x8), alongside a milder but consistent decay of node-level degree (0.99 to 0.85) while node-level betweenness centrality stays flat (0.49-0.59) across all layers — mirroring the general pattern of task-irrelevant linear structure being compressed away in later, more task-specialized layers. A correlation of 0.992 between task accuracy and maximum probing score across architectures links probe-recoverable graph-property information directly to downstream performance. See
pelletreau-duris-etal-2024-graph-theoretic-properties-are-linearly-decodable-from-gnn-embeddings-with-global-size-properties-collapsing-in-task-specialized-final-layers. -
A single dominant PCA axis orders protein sequences from well-modeled to poorly-modeled, and viral proteins remain linearly separable from cellular proteins beyond what that axis alone predicts. Bigot, Bhasin, Park, Shakhnovich & Wang (2026) run PCA on mean-pooled final-layer embeddings from five architecturally distinct pretrained protein language models (ESM2 8M-15B, ESMC 300M-6B, ESM3 1.4B-98B, autoregressive ProGen2-base, diffusion-based EvoDiff), finding the top component — a “nativeness axis” — explains 54.3-73.1% of variance and correlates with masked-reconstruction perplexity at - (replicated within each of 10 biological groups separately, Table 3). Independently, linear probes trained on the same mean-pooled embeddings separate viral from cellular proteins at AUC 0.97-1.00 even under a homology-controlled train/test split (leave-one-family-out mean AUC ), with low-false-positive-rate sensitivity (88.3-96.7% TPR at 1% FPR) far exceeding a perplexity-only classifier (26.9-39.2%) — showing the linearly separable viral signal exceeds what the dominant nativeness axis (itself tied to perplexity) alone would predict. See
bigot-etal-2026-viral-proteins-reveal-a-dominant-nativeness-axis-in-protein-language-model-embedding-space. -
A linear probe fit on SAE-decomposed, PCA-reduced residual-stream activations detects reward-hacking behavior token-by-token during generation, agreeing with an LLM judge at F1 up to 1.00 on held-out control data. Wilhelm, Wittkopp & Kao (2026) train a per-layer sparse autoencoder on the last four layers of Qwen2.5-Instruct-7B, LLaMA-3.1-8B, and Falcon3-7B (each LoRA-finetuned via GRPO on a mix of control and reward-hacking data), then fit a logistic-regression classifier on PCA-reduced, standardized SAE features to produce a per-token hack probability, averaged into a prompt-level score. Agreement with a GPT-4o judge reaches F1=1.000 on all three models’ control-only data, and F1=0.903 (Falcon), 0.961 (Llama), 0.784 (Qwen) on hack-adapter data, with mixed-ratio adapters (5-90% hack data) ranging F1=0.760-0.946 — a quantified linear-separability claim (no causal steering/ablation is performed). See
wilhelm-wittkopp-kao-2026-a-linear-probe-on-sae-decomposed-pca-reduced-activations-detects-reward-hacking-token-by-token-with-up-to-perfect-agreement-with-an-llm-judge. -
The first 1-3 components of a fixed, shared PCA basis cleanly separate figure from ground pixels across multiple architecturally distinct real pretrained vision models, validated against ground-truth segmentation masks rather than a behavioral proxy alone. Li, Wen, Song, Liu, Jing & Lee (2025) project internal activations of ViT-MAE, CLIP ViT-H/14, DINOv2, and ConvNeXt-MAE onto a shared low-dimensional PCA basis and show this axis separates figure from ground on 1,495 PASCAL VOC images checked against ground-truth masks; a complementary Top-K activation-sparsity intervention raises a texture-synthesis oddity-detection benchmark from 69.8 to 94.6 (MAE ViT) and 62.1 to 88.1 (ConvNeXt-V1). See
li-etal-2025-the-first-1-3-shared-pca-components-of-self-supervised-vision-model-activations-cleanly-separate-figure-from-ground-pixels-across-vit-clip-dinov2-and-convnext-checkpoints. -
The full Gram matrix of pairwise patch-token cosine similarities in self-supervised ViTs clusters patches by object identity, with self-supervised training producing substantially more human-aligned grouping than supervised training at matched architecture. Adeli, Ahn, Luo, Zhang, Kriegeskorte & Zelinsky (2026) compute patch-affinity/Gram-matrix structure in DINOv3, DINOv2, DINO, MAE, supervised ViT-B, and ConvNeXt-B, quantifying object-centricity via AUC against ground-truth boundaries and a grouping-accuracy benchmark: DINOv3 91.9%, DINOv2 89.0%, DINO 76.5%, MAE 80.7%, versus supervised ViT-B 70.6-72.2% and supervised ConvNeXt-B 60.0-67.4% (DINOv3-distilled ConvNeXt-B 86.7%). See
adeli-etal-2026-patch-token-cosine-affinity-and-gram-matrix-structure-in-self-supervised-vits-clusters-patches-by-object-identity-with-dinov3-reaching-91-9-percent-human-aligned-grouping-accuracy. -
MLP probes on a real pretrained generative music model’s internal activations decode seven synthetic music-theory concepts at up to 0.984 mean accuracy, varying systematically by which processing stage (audio codec vs. language-model decoder) is probed. Wei, Freeman, Donahue & Sun (2024, SynTheory) probe Jukebox and MusicGen small/medium/large, finding mean decodability of 0.984 (Jukebox LM), 0.914-0.950 (MusicGen decoder stage across sizes), but only 0.701 at the MusicGen audio-codec stage alone. See
wei-freeman-etal-2024-mlp-probes-on-jukebox-and-musicgen-internal-activations-decode-seven-music-theory-concepts-at-up-to-0-984-mean-accuracy. -
Inflectional morphology stays linearly separable across every layer of 25 real pretrained models, while lexical identity (lemma) starts linearly separable but becomes increasingly non-linearly encoded toward final layers — a depth-dependent dissociation confirmed by control-task selectivity. Li & Subramani (2025) probe BERT-Base/Large, DeBERTa-v3-Large, GPT-2 Small/Large/XL, Pythia-6.9B, OLMo-2-7B, Gemma-2-2B, Qwen2.5-1.5B, and Llama-3.1-8B (base and instruct variants), finding inflection stays linearly separable at 0.9-1.0 accuracy uniformly across depth (MLP probes add no benefit) while lemma decodability’s linear accuracy declines toward final layers even as MLP-probe accuracy declines much less; control-task selectivity confirms inflection reflects generalizable abstraction (0.4-0.6) versus lemma’s near-zero-selectivity memorization. See
li-subramani-2025-inflectional-morphology-stays-linearly-separable-across-all-layers-of-25-models-while-lexical-identity-becomes-increasingly-nonlinearly-encoded-toward-the-final-layers. -
Linear probes on hidden states substantially outperform output-level uncertainty signals at detecting when an LLM’s internal state distinguishes knowledge-recall failure from genuine truthfulness failure, and the same dissociation replicates across two model families. Cheang, Chan, Zhang & Deng (2026) probe LLaMA-3-8B and Mistral-7B-v0.3 subject-token/attention/last-layer hidden states, finding last-token-probe AUROC 0.69±0.03 (unrecognized-vs-familiar hallucination) rising to 0.93±0.01 (unfamiliar-vs-familiar), while output confidence and self-reported certainty stay far lower — accompanied by cosine-similarity and cluster-separability (Silhouette/Davies-Bouldin) evidence that “knowing” and “truthfulness” occupy measurably different regions of hidden-state space. See
cheang-etal-2026-linear-probes-on-llm-hidden-states-separate-knowledge-recall-familiarity-from-truthfulness-far-better-than-output-level-confidence-signals. -
A linear probe on hidden states detects question-unanswerability far better than a model’s own output confidence, and this “blind spot” — the model represents unanswerability internally without reporting it — does not shrink with scale, across five instruction-tuned models from three families. Wagner (2026) fits logistic-regression probes on final-prompt-token hidden states of Gemma-2-2B-it, Qwen2.5-3B/7B/14B-Instruct and Llama-3.1-8B-Instruct, finding hidden-state answerability-readout AUROC 0.97-0.99 versus only 0.54-0.67 for output-confidence-based readouts, with the gap worst on naturally occurring false-premise questions (CREPE: confidence-based signals near chance, hidden-state probe 0.69-0.77 AUROC); routing a premise-check instruction through the probe roughly triples challenge precision over the same instruction alone. See
wagner-2026-a-linear-probe-on-llm-hidden-states-detects-question-unanswerability-far-better-than-output-confidence-and-this-blind-spot-does-not-shrink-with-scale. -
Layer-wise linear probes on real pretrained VLM hidden states decode scientific-chart signal far above the model’s own end-to-end decision accuracy, quantifying an “encoded but not routed” dissociation. Kumar, Ho, Schopf, Greiner-Petter, Boudin & Aizawa (2026) find a mean-pool probe on InternVL3-8B reaches 79.0% accuracy on basic charts versus only 56.2% for the model’s own decision, and probe AUROC exceeds last-token AUROC by up to 17 points on Qwen2.5-VL-32B-Instruct (both McNemar-significant, p<0.01); the analysis is explicitly diagnostic, not causal. See
kumar-etal-2026-linear-probes-on-vlm-hidden-states-decode-chart-signal-at-79-percent-accuracy-while-the-model-itself-only-reaches-56-2-percent-a-quantified-encoded-but-not-routed-dissociation. -
Linear probes on per-head attention-contribution features decode relation type more accurately than probes on the full pooled attention state, across four real instruction-tuned LLMs. Popović & Färber (2026) decompose each attention head’s residual-stream contribution via a Direct-Logit-Attribution-style attribution and fit probes on FewRel relation classification, reaching 90.26-91.09% accuracy versus 83.65-86.79% for a full-attention-state baseline across Llama-3.2-1B/3B-Instruct, Llama-3.1-8B-Instruct and Qwen3-4B-Instruct. See
popovic-farber-2026-per-head-attention-contribution-linear-probes-decode-relation-type-at-90-91-percent-accuracy-across-four-instruction-tuned-llms-exceeding-full-attention-state-probes. -
Layer-wise linear probing of periodic-table/chemistry facts shows middle layers encode element attributes continuously and overlapping, while deeper layers sharpen the same attributes into more categorically separated clusters — alongside a 3D-PCA spiral trajectory tracking atomic-number ordering. Lei & Cooper (2025) probe Llama-3-8B and Llama-3.1-70B-Instruct, reporting per-property spiral-fit consistency scores up to 0.90 for the PCA trajectory and confirming the continuous-to-categorical depth transition via cosine-similarity analysis of learned attribute directions. See
lei-cooper-2025-a-3d-pca-spiral-in-llama-hidden-states-aligns-with-the-periodic-tables-conceptual-structure-and-linear-probes-show-middle-layers-superimpose-related-attributes-while-deeper-layers-separate-them. -
Linear and MLP probes decode a task-relevant spatial “cognitive map” from a real LLM agent’s pre-reasoning activations, validated behaviorally via policy-agreement rather than probe accuracy alone. Arghal, Chen, Dalton, Kortukov, McNamara, Nalmpantis, Nirvaan, Sarti & Giulianelli (2026, ICML) probe GPT-OSS-20B’s layer-15 activations in a 2D grid-world navigation task, finding 82.5% average policy-agreement between the agent’s action and the decoded cognitive map, with post-reasoning activations reorganized away from this spatial code. See
arghal-etal-2026-linear-and-mlp-probes-decode-a-grid-position-cognitive-map-from-gpt-oss-20bs-pre-reasoning-activations-and-policy-agreement-with-the-decoded-map-averages-82-5-percent. -
Linear probing classifiers on real pretrained protein language model embeddings recover contact maps, binding sites and secondary structure, converging with an independent attention-alignment measurement on the same models. Vig, Madani, Varshney, Xiong, Socher & Rajani (2020) analyze TapeBert, TAPE-ALBERT and XLNet, finding individual attention heads concentrate on binding sites far above background frequency (e.g. one head at 49%, Bonferroni-corrected p<0.00001) while a separate embedding-level linear probe quantifies the same structures via precision@L/5, precision@L/20 and F1. See
vig-etal-2020-linear-probes-on-real-pretrained-protein-lm-embeddings-recover-contact-maps-binding-sites-and-secondary-structure-and-individual-attention-heads-align-with-the-same-structures-far-above-background-frequency. -
A middle-layer attention-head group linearly decodes another agent’s belief status above 80% validation accuracy, dissociable from the model’s own belief representation, and manipulating it causally changes Theory-of-Mind task performance. Zhu, Zhang & Wang (2024, ICML) probe Mistral-7B on third-person false-belief narratives, generalizing the causal steering result across social-reasoning tasks with different causal-inference patterns. See
zhu-etal-2024-a-middle-layer-attention-head-group-in-mistral-7b-linearly-decodes-another-agents-belief-status-above-80-percent-validation-accuracy-and-manipulating-it-causally-changes-theory-of-mind-performance. -
A causally-present backdoor trigger signal can occupy a subspace orthogonal to a linearly-probed language-identity direction, so a linear probe fails to detect it even while activation patching confirms it is driving the model’s behavior. Kulumba, Antoun, Lasnier, Sagot & Seddah (2026) show this in Gaperon-8B’s language-switching backdoor: the probe reads “English” throughout mid-to-late layers while the trigger is causally present, only converted to French output by a final-layer MLP accounting for ~63% of the total causal effect — sharpening the general distinction between “linearly probeable” and “causally present” sharper than in most probing papers in this map. See
kulumba-etal-2026-a-backdoor-trigger-signal-in-gaperon-8b-persists-in-a-subspace-orthogonal-to-a-linearly-probed-language-identity-direction-throughout-mid-late-layers-despite-being-causally-present. -
Raw attention matrices from a real pretrained protein language model, read out through a single linear map, recover contact maps at accuracy competitive with a far more expensive combinatorial mutation-sweep method. Thorstenson (2026) shows a learned linear read-out from ESM-2 (35M/150M/650M/3B) and ESMC-600M attention matrices to residue-residue contact maps matches the categorical Jacobian method’s accuracy, despite the categorical Jacobian requiring an expensive per-protein sweep of masked-residue mutations while this read-out needs only a single forward pass — evidence that contact information is already linearly separable within raw attention patterns, rather than requiring nonlinear, mutation-based probing. See
esm-attention-maps-are-linearly-readable-as-protein-contact-maps. -
Attribute-object binding is linearly decodable within a single modality of a real pretrained vision-language model but collapses cross-modally, and a lightweight learned linear map closes the gap. Koishigarina, Uselis & Oh (2026) probe CLIP (ViT-B/32, ViT-B/16, ViT-L/14) for attribute-object binding, finding near-ceiling linear-probe accuracy uni-modally (up to 1.0 train / 0.91 test) but near-chance cross-modal accuracy (0.51-0.52) at baseline, restored to 0.91-1.00 by a 262K-parameter learned linear transform — isolating the deficit to cross-modal alignment rather than missing linear structure in either modality. See
clip-attribute-object-binding-is-linearly-decodable-uni-modally-but-collapses-cross-modally-until-a-linear-map-restores-it. -
A linear probe on reasoning-model hidden states predicts eventual answer correctness, including for answers not yet stated, well above chance across a family of distilled reasoning models. Zhang, Chen, Pan, Zhao, Panda, Li & He (2025) find hidden states at intermediate-answer positions in six reasoning models (DeepSeek-R1-Distill-Llama-8B/70B, DeepSeek-R1-Distill-Qwen-1.5B/7B/32B, QwQ-32B) predict correctness at ROC-AUC above 0.7, with a grid search showing many probes converge to a purely linear one; the effect is much weaker in a non-reasoning baseline (Llama-3.1-8B-Instruct), and the probe deployed as an early-exit verifier cuts inference tokens 24% with no accuracy loss. See
reasoning-model-hidden-states-linearly-encode-answer-correctness-before-the-answer-is-stated. -
Lightweight vision-language models linearly encode object/agent presence from mid-vision-encoder through the final LLM layers, but never linearly encode orientation, and steering the probe direction causally confirms it drives behavior. Theodoridis et al. (2026) probe Ovis2.5-2B, InternVL3.5-2B, and VST-3B on CARLA-generated counterfactual driving scenes, finding presence is explicitly linearly separable at every stage while orientation never is, and validate the presence direction’s causal role via activation steering, distinguishing “perceptual failure” from “cognitive failure” cases. See
lightweight-vlms-linearly-encode-object-presence-but-never-orientation-and-steering-the-probe-direction-causally-confirms-it. -
A linear probe on Qwen3-32B’s residual stream decodes the tool-call dependency graph in an LLM agent’s trajectory at AUROC 0.869, and activation patching shows the representation causally propagates rather than being read out passively. Sun & Kazakov (2026) train an edge probe recovering which earlier tool-call output feeds which later call’s arguments, decisively above random-label, positional-only, and n-gram surface-form controls, with per-layer activation patching shifting later-layer predictions toward a donor trajectory’s structure. See
a-linear-probe-decodes-tool-call-dependency-structure-from-qwen3-32bs-residual-stream-with-auroc-0-869-and-activation-patching-shows-the-representation-causally-propagates. -
A linear probe on pre-generation hidden states predicts whether an LLM agent needs to call a tool at AUROC 0.89-0.96 across six models of varying family and size, including on models whose own generation catastrophically fails to express this knowledge. Sun, Liu, Yan, Wang & Weng (2026) show Reason-then-Act prompting can collapse tool-calling accuracy (Llama-3.1-8B-Instruct 79.5% to 31.2%) while a simple linear probe on the same models’ hidden states still linearly decodes tool necessity at AUROC >0.9, dissociating internal knowledge from expressed behavior. See
linear-probes-decode-whether-a-tool-call-is-needed-at-auroc-0-89-to-0-96-across-six-llms-of-varying-family-and-size-including-models-whose-own-generation-fails-to-express-this-knowledge. -
Language-conditioned linear probes and neighborhood-based mutual information reveal Indic-district geography as linearly decodable structure nested hierarchically inside each language’s embedding subspace. Kumar J et al. (2026) find fine-tuned Whisper-base and Wav2Vec2.0-base achieve mean F1 91.29/87.14 under joint language-district supervision, with a Normalized Conditional Mutual Information analysis showing an asymmetric hierarchical nesting of district clusters inside language-level structure. See
fine-tuned-whisper-and-wav2vec2-encode-indic-dialect-geography-as-a-linearly-decodable-hierarchical-geometry-nested-inside-each-languages-embedding-subspace. -
TCAV-style linear probes detect chess concepts emerging at different points during training in two custom self-play RL chess agents, replicating AlphaZero’s concept-probing methodology at toy scale. Hammersborg & Strumke (2022) show material-advantage and mate-threat concepts are linearly decodable from initialization in a ResNet-based agent (due to skip connections) while plateauing after ~100 iterations in a smaller CNN agent. See
tcav-style-linear-probes-detect-chess-concepts-like-material-advantage-and-mate-threat-emerging-at-different-training-points-in-two-custom-self-play-rl-chess-agents. -
Linear probes on residual-stream activations detect motivated reasoning both before and after chain-of-thought generation, with a U-shaped hint-recovery signal showing the model re-engages a hint internally even when CoT text never mentions it. Mirtaheri & Belkin (2026) find pre-generation probes match a full-CoT-trace external judge, and post-generation probes outperform it, across three models. See
linear-probes-on-residual-stream-activations-detect-motivated-reasoning-both-before-and-after-cot-generation-with-a-u-shaped-hint-recovery-signal-across-cot-tokens. -
A lightweight covariance-pooling probe on forecasting-LLM activations halves calibration error versus verbalized confidence and acts as a “lie detector,” correctly predicting belief-change direction in 83.6% of cases including 107 where CoT text shows no change at all. Sarfati et al. (2026) show this linear/bilinear readout holds up out-of-distribution where verbalized confidence collapses (AUROC 0.587). See
a-linear-covariance-pooling-probe-on-forecasting-llm-activations-halves-calibration-error-versus-verbalized-confidence-and-detects-107-stealth-cases-where-cot-shows-no-change. -
Logistic-regression probes on the residual stream detect parametric-vs-contextual knowledge conflict and predict, before generation, which source the model will rely on. Zhao et al. (2024) find detection AUROC/AUPRC peaks around layer 13-14 of Llama3-8B and Llama2-7B, with source-prediction accuracy improving up to layer 16-17, after the conflict-detection signal peaks. See
logistic-regression-probes-on-the-residual-stream-detect-parametric-vs-contextual-knowledge-conflict-and-predict-which-source-the-model-will-rely-on-before-generation-with-a-distinct-skewness-signature. -
Pretraining-time outlier dimensions persist through GLUE fine-tuning, and a single principal outlier dimension alone completes downstream tasks with minimal accuracy loss, sometimes beating the full fine-tuned classifier head. Rudman, Chen & Eickhoff (2023) show this across eight encoder/decoder models, with accuracy drops as low as 0-3.4% for several models when using only the 1-D outlier subspace. See
pretraining-outlier-dimensions-persist-through-fine-tuning-and-a-single-principal-outlier-dimension-alone-can-complete-glue-tasks-with-minimal-accuracy-loss-across-eight-encoder-and-decoder-models. -
A layer-localized linear probe decodes which moral framework a model is reasoning under mid-trajectory, beating a training-prior baseline by 13.8-22.6% lower KL divergence. Huang, Kwak & An (2026) find this in Llama-3.3-70B and Qwen2.5-72B, cross-referenced from
linear-directionfor its causal steering component. Seea-layer-localized-linear-probe-direction-for-moral-framework-decodes-which-ethical-framework-a-model-is-using-mid-reasoning-and-steering-along-it-shifts-framework-integration-drift. -
Linear probes decode future planning steps in a Blocksworld task from a single forward pass, with decoding accuracy decaying smoothly with prediction distance and tracking a nonlinear-probe control. Men et al. (2024) find a linear probe predicts the 6th-step-ahead decision from the 1st-step representation at 0.51 accuracy in fine-tuned Llama-2-7b-chat and Vicuna-7B, with linear and nonlinear probes tracking the same decay trend. See
linear-probes-on-fine-tuned-llm-residual-streams-decode-future-planning-steps-in-a-blocksworld-task-with-accuracy-decaying-smoothly-with-prediction-distance-tracking-nonlinear-probes. -
A linear probe direction separates real-world evaluation from deployment prompts, and the same probe classifies artificial safety evaluations as inauthentic. Nguyen, Hoang, Attubato & Hofstätter (2025) demonstrate this in Llama-3.3-70B-Instruct, cross-referenced from
linear-directionfor its causal steering component. Seea-linear-probe-direction-separates-real-world-evaluation-from-deployment-prompts-in-llama-3-3-70b-and-the-model-classifies-artificial-safety-evaluations-as-inauthentic-evidencing-an-internal-eval-deploy-axis. -
Layerwise linear probes on real pretrained video foundation models find intuitive-physics information most decodable in a predictive joint-embedding architecture, competitively decodable in a masked-reconstruction architecture, and weaker but non-trivial in a video-diffusion generator, peaking at intermediate-to-late depth. Punzo, Caselli, Pantelidis, Massafra, Lo Sardo & Salehi (2026) probe V-JEPA, VideoMAE, and LTX-Video on the IntPhys2 and Minimal Video Pairs benchmarks, confirming the probed signal reflects genuine temporal structure via a frame-shuffling control that substantially degrades performance. See
layerwise-linear-probing-shows-video-foundation-models-vary-in-how-linearly-decodable-intuitive-physics-is-with-video-jepa-strongest. -
Approximately inverting a video diffusion transformer’s deterministic sampling process to recover intermediate states makes physical plausibility linearly decodable well above representation-learning baselines probed on their own forward pass. Esmati, Nath, Hofmann, Nowrouzezahrai, Ebrahimi Kahou & Mirmehdi (2026) invert three checkpoints (WAN-1.3B, CogVideoX-2B, LTX-2B) via backward velocity-field integration, reaching ~81.27% average linear-probe accuracy on IntPhys/InfLevel and exceeding V-JEPA2 and VideoMAE baselines — evidence that a diffusion model encodes more physical structure internally than its generated output or ordinary forward-pass activations reveal. New method
diffusion-inversion-probing. Seediffusion-inverted-video-transformer-states-are-linearly-decodable-for-physical-plausibility-and-outperform-representation-learning-baselines. -
Linear probes across 78 molecular substructures, run on both pretrained and randomly-initialized chemical language models, isolate which substructure-encoding is a genuine product of pretraining versus an architecture-driven default. Karnysheva, Klakow & Lee (2026) find pretraining generally improves substructure awareness in upper layers across eight pretrained CLMs, while six randomly-initialized counterparts already encode ring structures well from layer 1. See
linear-probes-across-78-molecular-substructures-show-pretraining-improves-chemical-language-model-substructure-awareness-especially-in-upper-layers. -
A Fisher-discriminant-style inter-to-intra scatter ratio, computed per attention head in a frozen real MLLM, quantifies normal/anomalous representation-manifold entanglement and selects heads for a targeted causal intervention. Cai, Li, Duan, He & Zhai (2026, SteerVAD) apply this Representational Separability Analysis (RSA) score to InternVL3-8B, using it to select the most-entangled heads for anisotropic-scaling steering, reaching 87.15% AUC on UCF-Crime video-anomaly-detection with ~1% of the training data of a fully fine-tuned baseline. New method
rsa-inter-intra-scatter-ratio. Seecai-etal-2026-per-head-fisher-ratio-manifold-entanglement-scores-select-targeted-anisotropic-steering-that-rectifies-frozen-mllm-anomaly-detection-manifolds. -
Foundational: the paper that introduced linear classifier probing, showing linear separability of real trained CNN features increases monotonically with depth. Alain & Bengio (2016) fit an independent linear probe at each layer of trained Inception-v3 and ResNet-50, finding probe accuracy rises monotonically with depth — the origin of the linear-probing methodology used throughout this map, with the authors themselves flagging probe accuracy as only a lower bound on the information actually present. See
alain-bengio-2016-linear-classifier-probes-fit-independently-at-every-layer-of-inceptionv3-and-resnet-50-show-linear-separability-of-learned-features-increases-monotonically-with-depth. -
MLP probes on real LLM hidden states form tight, well-separated emotion clusters that tighten with scale and peak in probe accuracy at 50-75% relative depth, not the final layer. Zhang & Zhong (2025) probe Qwen3 (0.6B-8B) and LLaMA-3 (1B-8B), finding 7-class emotion clusters visualized via PCA+KDE become “tight, well-separated” only for the larger models, with probe accuracy rising from chance at layer 0 to a peak of 0.78-0.80 at 50-75% depth — “the network’s middle layers contain the strongest and most distinct representations of emotion” — and signal persisting, with emotion-specific decay, across up to 400 generated tokens. See
zhang-zhong-2025-mlp-probes-on-real-qwen3-and-llama-3-hidden-states-form-tight-well-separated-emotion-clusters-that-peak-at-50-75-percent-depth-not-the-final-layer. -
A real trained next-state-prediction world model linearly separates “which object changed” from an activation-difference vector, despite having no architecturally imposed per-object slots. Saanum, Schulze Buschoff, Dayan & Schulz (2024) train real CNN-encoder Contrastive World Models on rendered multi-object video (Cubes, 3-body physics, Multi-dSprites, MOVi-simple, MOVi-A) and fit an L1-regularized linear classifier on the difference vector between two consecutive frames’ encodings to predict which single object changed, reaching near-100% held-out accuracy on Cubes/3-body physics and about 70% (well above chance) on the harder Multi-dSprites/MOVi settings, while untrained encoders and a static (non-predictive) contrastive baseline stay near chance — isolating next-state prediction itself, not architecture alone, as what drives the emergent linear decodability. The same representation is not factorized into clean per-object slots the way an explicit slot-based baseline is (shared unit populations encode transformation type across different objects), making this a case of linearly separable-yet-entangled structure rather than either purely distributed or purely modular. See
saanum-etal-2024-a-real-trained-contrastive-world-model-linearly-decodes-which-object-changed-from-difference-vectors-despite-having-no-imposed-object-slots. -
Layerwise linear probes mapping where honesty/deception is decodable in real LLMs drift sharply during real RLVR training, exposing representation drift rather than deliberate evasion. Taufeeque, Heimersheim, Gleave & Cundy (2026, The Obfuscation Atlas) train per-layer logistic-regression probes on residual-stream activations to build a layerwise “atlas” of deception decodability, then run real LoRA+GRPO RLVR training (MBPP-Honeypot coding environment, where reward hacking naturally emerges) on real Llama-3-8B-Instruct, Gemma-3-12B/27B-IT, and Llama-3-70B-Instruct. Pre-RL probe AUC is near-ceiling (0.991-1.000); after RLVR training without any detector penalty, AUC on off-domain deception probes collapses (e.g. 0.991->0.376, 0.996->0.655) while on-domain MBPP-probe AUC stays at 1.000 — the decodability the probe relied on for out-of-domain generalization drifts away under real training, not because the model learns to evade detection (with a detector penalty added, genuinely evasive deceptive behavior instead reaches 96.4% of seeds). See
taufeeque-etal-2026-layerwise-linear-probes-for-honesty-decodability-in-real-llms-drift-sharply-off-domain-under-real-rlvr-training-while-on-domain-decodability-stays-near-ceiling. -
A single frozen linear classifier trained on one astronomical survey’s embeddings transfers zero-shot to a different telescope’s images with no accuracy loss, evidencing survey-invariant structure in a real omnimodal foundation model. Parker, Lanusse, Shen et al. (2025, AION-1) train a 10-way linear/softmax morphology classifier on frozen AION-1 embeddings of Legacy Survey galaxy images (Galaxy Zoo-10 classes) and apply the identical, un-fine-tuned head to Hyper Suprime-Cam images from a different telescope, filter set and pixel scale (overlapping galaxies excluded to prevent leakage): zero-shot HSC accuracy (84.15-85.91%) matches or exceeds native-domain training accuracy (83.95-87.16%) across three model sizes (Table 6). No causal intervention is performed, and the paper is otherwise benchmark-dominated across many tasks; this cross-survey linear transfer is the one genuine emergent-structure finding. See
parker-etal-2025-a-frozen-linear-morphology-classifier-fit-on-aion-1-embeddings-transfers-zero-shot-across-telescope-surveys. -
Environmental variables never used during pretraining are linearly decodable from frozen geospatial self-supervised encoders, with the strength of decodability depending on which self-supervised objective was used, not just on downstream task accuracy. Mocharla & Patel (2026) fit ridge-regression (linear) and MLP (nonlinear) probes for five ERA5 environmental variables (temperature, precipitation, solar radiation, pressure, soil water) on real DINO/MAE/MoCo ViT-S/16 encoders trained identically on SSL4EO Sentinel-1/2 imagery, plus several public geospatial foundation models. DINO shows the strongest ERA5 decodability (linear , MLP ) versus MAE/MoCo near-random despite similar downstream segmentation mIoU; linear-probe correlates more strongly with downstream agricultural-task utility than MLP ( vs. ). Intrinsic geometry metrics (effective rank, uniformity) correlate with probe performance (-); purely associative, the authors explicitly state the analysis is not causal. See
mocharla-patel-2026-environmental-variables-never-seen-in-pretraining-are-linearly-decodable-from-frozen-geospatial-ssl-encoders-with-architecture-dependent-strength. -
A real self-supervised speech model trained on longitudinal dolphin recordings organizes its learned quantization codebook by whistle category and individual identity, with a temporal-shuffling ablation confirming dependence on genuine temporal structure. Semenzin, Mustun, Dessì, Orhan, Emanuelli, Lakretz, de Polavieja & Sumbre (2026) train Dolph2Vec, a Wav2Vec2.0-architecture model adapted for 44.1kHz audio, on ~180,000 whistles (100 hours) from 5 known bottlenose dolphins recorded over 5 real years. The codebook’s specialization for signature-whistle categories is quantified via conditional entropy and mutual information (training reduces entropy 2.13->1.85 and raises MI 0.43->0.70 vs. a random-init baseline); UMAP-projected, GMM-clustered embeddings score ARI=0.3565 and NMI=0.4226 against ground-truth whistle labels, beating AVES-bio/BioLingual baselines. A temporal-shuffling ablation on the feature-encoder output drops downstream classification accuracy from 82.0% to 75.1%. See
semenzin-etal-2026-a-real-wav2vec2-style-model-trained-on-longitudinal-dolphin-recordings-organizes-its-codebook-by-whistle-category-and-individual-identity. -
Frozen real genomic language models show task-dependent linear accessibility of biological signal, quantified by silhouette, kNN and Fisher-separation geometry, not just probe accuracy. Datta, Shatabda & Rahman (2026) probe five real frozen genomic language models (DNABERT-2, Nucleotide Transformer, HyenaDNA, GENERATOR-v2, Omni-DNA) with logistic-regression (linear), RBF-SVM and MLP probes plus quantitative embedding-geometry metrics. Promoter-recognition signal is highly linearly accessible (frozen-probe recovery of fine-tuned performance: 98/95/100/98% for HyenaDNA/NT/GENERATOR-v2/Omni-DNA), while splice-site signal is markedly less accessible (55-88% recovery), with Nucleotide Transformer’s own embedding geometry showing the same split quantitatively (Promoter-All silhouette=0.044/kNN=0.883/linear-separability=0.917 vs. Splice-All silhouette=-0.011/kNN=0.465/linear-separability=0.597). Layer-wise probing shows intermediate layers (layer 20: ACC=0.639) outperform the final layer (layer 24: ACC~0.60); causal validation is via input-level in-silico mutagenesis, not internal activation patching. See
datta-etal-2026-frozen-real-genomic-language-models-show-task-dependent-linear-accessibility-of-biological-signal-quantified-by-silhouette-knn-and-fisher-separation-geometry. -
Sparse-code decomposition of real neural audio codecs splits accent-predictive information between activation magnitude and position, with the split reversing between acoustic- and phonetic-oriented codecs. Wang, Feng, Kommineni, Lertpetchpun, Yi, Shi & Narayanan (2026) train TopK SAEs on real EnCodec, DAC, SpeechTokenizer and Mimi, then fit logistic-regression probes on the full sparse code, its position-only pattern, and its magnitude-only pattern for accent classification. For DAC (acoustic-oriented), magnitude-only features preserve more accent information than position-only (ΔF1 ~-5.0 to -5.1% vs. ~-9.8 to -12.0% at 5% sparsity); for SpeechTokenizer (phonetic-oriented, distilled from HuBERT/WavLM), the pattern reverses (position-only ~-4.5 to -6.3% vs. magnitude-only ~-7.1 to -7.2%). Purely correlational, no steering intervention performed. See
wang-etal-2026-sparse-autoencoder-decompositions-of-real-neural-audio-codecs-encode-accent-in-activation-magnitude-or-position-depending-on-codec-type.
Exercises
Base
- Classes , . Find a that linearly separates them.
Solution
Take , . Check: , (both in , both positive); , (both in , both negative). This separates from .
- Two classes each consist of a single point: , with . Are they always linearly separable?
Solution
Yes — any two distinct points are always separable by the hyperplane perpendicular to passing through the midpoint : take , and , so the hyperplane is , with and strictly on opposite sides since and symmetrically .
Middle
- Prove that if are linearly separable with margin , then every point of is at Euclidean distance at least from every point of … or show this is false with a counterexample.
Solution
False in general — the margin is the distance from each point to the hyperplane, not to points of the other class directly. Counterexample: let the hyperplane be the -axis in (), with and . Both points are at distance from the hyperplane (so margin if these are the closest points), but the distance between the two points themselves is only — actually in this example distance between points () does happen to be close to margin; to see a genuine failure, consider points nearly on the hyperplane but far apart along it: , , margin still , but the two points are enormously far apart (distance ) — so margin lower-bounds nothing about upper distance, and more importantly margin does not claim to be a lower bound on cross-class point distances in general either, since points from and near the same location along the hyperplane but on opposite sides can be as close as (in the limit) twice the margin — margin is fundamentally about proximity to the boundary, not a pairwise-distance guarantee between the classes.
- Prove the “only if” direction of the convex-hull characterization: if are linearly separable, their convex hulls are disjoint.
Solution
Suppose separate as in the definition. For any point in the convex hull of , with , , . Then … more directly: using to distribute . Since each and with at least one , the weighted sum is . So every point of satisfies ; symmetrically every point of satisfies . Since no point can satisfy both, .
Pro
- Prove that linear separability is preserved under any invertible affine transformation ( invertible) applied to both classes — i.e. if are separable, so are .
Solution
Given separating : for , . We want such that for all such , i.e. . Matching to the original condition, set , i.e. (using invertibility of , hence of ), and , i.e. . Then exactly, which is for and for by assumption — so separates .
- Let , , in . Verify are pairwise linearly separable, then show is not linearly separable from by any hyperplane through the origin — pairwise separability of three classes does not imply any one of them is separable from the union of the other two.
Solution
Pairwise: vs — take : gives on , on . vs — both points of have , so gives … more simply : on , ; on , — same sign, wrong; instead take : : ; : . Separated (labels swapped, which is immaterial). vs : symmetric, gives : , : . Separated. So all three pairs are separable.
Now suppose, for contradiction, a hyperplane through the origin ( WLOG for this construction, though the argument below in fact works for general too) with normal separates from . Say is on the negative side and on the positive side (the other labeling is symmetric). Then:
- From : .
- From : .
- From : .
- From : .
From the first two: . From the last two: . Combining: , i.e. — a contradiction. So no such exists: cannot be separated from , even though every pair among is separable. Geometrically, ‘s two points straddle the segment (one above the -axis, one below), so any line separating them from would have to keep both and on one side while keeping points just above and just below the axis on the other — impossible once sit on the axis itself, between ‘s two points in the relevant sense.