finding
active
finding:pca-analysis-shows-token-embeddings-and-unembeddings-are-concentrated-in-a-relatively-small-fraction-of-residual-stream-dimensions-in-large-modelsPCA analysis shows token embeddings and unembeddings are concentrated in a relatively small fraction of residual stream dimensions in large models
Supporting evidence for the claim that most residual stream dimensions are free for other layers to use
Neighborhood — ranked by edge-count
Claims (1)
claim
- First result in the hierarchy: the simplest possible transformer does nothing more than learn which tokens follow which
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- PCA applied to token embedding and unembedding matrices to understand what fraction of residual stream dimensions they occupy and how they relate
- Shows absence of abstract truth representations in smallest model, supporting scale-dependent emergence claim
- Justifies PCA choice over UMAP or t-SNE for the node-structured RN model.
- Primary visual evidence for linear truth representations in large LLMs
- Statistical method used to analyze neural activity data.
- Architectural observation enabling the entire mathematical framework; the residual stream is purely a sum of linear projections
- Demonstrates RSA's sensitivity issue in embedding layers; attributed partly to Spearman rank handling of RDMs with differing relative extrema.
- Practical finding: the method produces compact fixed-length representations from large volumes of token activations without requiring supervised labels.