Pith

open record

sign in

arxiv: 2209.02535 · v3 · pith:QBCNCIAD · submitted 2022-09-06 · cs.CL · cs.LG

Analyzing Transformers in Embedding Space

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:QBCNCIADrecord.jsonopen to challenge →

classification cs.CL cs.LG
keywords parametersspaceembeddingmodelsinterpretedanalysisattentionclassifier
0
0 comments X
read the original abstract

Understanding Transformer-based models has attracted significant attention, as they lie at the heart of recent technological advances across machine learning. While most interpretability methods rely on running models over inputs, recent work has shown that a zero-pass approach, where parameters are interpreted directly without a forward/backward pass is feasible for some Transformer parameters, and for two-layer attention networks. In this work, we present a theoretical analysis where all parameters of a trained Transformer are interpreted by projecting them into the embedding space, that is, the space of vocabulary items they operate on. We derive a simple theoretical framework to support our arguments and provide ample evidence for its validity. First, an empirical analysis showing that parameters of both pretrained and fine-tuned models can be interpreted in embedding space. Second, we present two applications of our framework: (a) aligning the parameters of different models that share a vocabulary, and (b) constructing a classifier without training by ``translating'' the parameters of a fine-tuned classifier to parameters of a different model that was only pretrained. Overall, our findings open the door to interpretation methods that, at least in part, abstract away from model specifics and operate in the embedding space only.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 small

    cs.LG 2022-11 conditional novelty 8.0

    GPT-2 small solves indirect object identification via a circuit of 26 attention heads organized into seven functional classes discovered through causal interventions.

  2. From Mechanistic to Compositional Interpretability

    cs.LG 2026-05 unverdicted novelty 7.0

    Compositional interpretability defines explanations as commuting syntactic-semantic mapping pairs grounded in compositionality and minimum description length, with compressive refinement and a parsimony theorem guaran...

  3. From Mechanistic to Compositional Interpretability

    cs.LG 2026-05 unverdicted novelty 7.0

    The paper introduces compositional interpretability as a category-theoretic framework that casts mechanistic explanations as commuting syntactic-semantic mappings optimized under faithfulness and complexity constraint...

  4. Improving Dictionary Learning with Gated Sparse Autoencoders

    cs.LG 2024-04 unverdicted novelty 7.0

    Gated SAEs decouple which features to use from how large their activations should be, applying the L1 penalty only to selection and thereby eliminating shrinkage while halving the number of firing features needed for ...

  5. Eliciting Latent Predictions from Transformers with the Tuned Lens

    cs.LG 2023-03 accept novelty 7.0

    Training per-layer affine probes on frozen transformers yields more reliable latent predictions than the logit lens and enables detection of malicious inputs from prediction trajectories.

  6. Mass-Editing Memory in a Transformer

    cs.CL 2022-10 conditional novelty 7.0

    MEMIT scales direct memory editing in transformers from single facts to thousands of associations by optimizing MLP weight updates.

  7. Analysis-by-Proxy: Localization Signals in VLMs Operating as Condition Encoders

    cs.CV 2026-07 conditional novelty 6.0

    A lightweight Q-Former proxy trained on VLM hidden states reveals that localization signals peak in input-dependent intermediate layers, not the final layers used by standard editing pipelines.

  8. Correcting Influence: Unboxing LLM Outputs with Orthogonal Latent Spaces

    cs.LG 2026-05 unverdicted novelty 6.0

    A latent mediation framework with sparse autoencoders enables non-additive token-level influence attribution in LLMs by learning orthogonal features and back-propagating attributions.

  9. Friends and Grandmothers in Silico: Localizing Entity Cells in Language Models

    cs.CL 2026-04 conditional novelty 6.0

    Language models contain localized entity-selective neurons in early layers that causally mediate factual recall for specific entities across surface variations.

  10. Geometric Signatures of Reasoning: A Spectral Perspective on Task Hardness

    cs.LG 2026-07 unverdicted novelty 5.0

    Introduces effective dimension d_ρ from spectral analysis of reasoning trajectories to distinguish task hardness (0.93 AUC on MATH500) and uses kinematic features for early correctness prediction from partial generations.

  11. Geometry of Human Perceptual Domains Emerges Transiently in LLM Representations

    cs.AI 2026-05 unverdicted novelty 4.0

    Perceptual geometry for color, pitch, emotion and taste emerges transiently in intermediate layers of transformer LLMs despite purely textual training.