Research map / Architectures and efficiency / Attention and transformers
Linear Decoding of Morphology Relations in Language Models (Student Abstract)
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Shows that a pure linear map Ws (Jacobian of an LM's computation from an early subject state) suffices and is necessary to approximate morphological derivation in GPT-J and Llama-7b on BATS.
Problem
Prior work found affine Taylor approximations (LRE) model factual relations in transformer LMs, but it is unclear whether morphological relations are truly linear and how they are encoded.
Approach
Drops the bias and scaling terms of the affine linear relational embedding and tests the pure Jacobian approximation Ws (plus bias-only s+b as a control) on morphological analogies, finding that W alone is sufficient and necessary for morphology, while other relation types need the affine term.
Key results
- The Jacobian approximation Ws achieves above 80% top-1 faithfulness across most morphological tasks in BATS.
- Removing W (bias-only approximation) compromises faithfulness, indicating W is necessary for morphology.
- For non-morphological categories, the affine LRE improves significantly beyond the Jacobian, so those relations are affinely but not truly linearly approximable.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the Jacobian transformation Ws instead of the Bias approximator (s+b) (ablation) | GPT-J · BATS morphological tasks | faithfulness (top-1 match rate) | Helped |
| Remove the Jacobian transformation W (ablation) | GPT-J · BATS morphological tasks | faithfulness (top-1 match rate) | Hurt |
| Use the affine LRE (βWs+b) instead of the Jacobian approximation (Ws) (ablation) | GPT-J · BATS non-morphological categories | faithfulness (top-1 match rate) | Helped |
Surprising findings
- Morphological derivations are better captured by a pure linear transformation than by concept/bias vectors, contrary to the Linear Representational Hypothesis expectations.
Limitations
- Evaluated on only two models (GPT-J and Llama-7b) and a single benchmark (BATS).
- Relies on a fixed in-context prompt with 7 examples per analogy and averaged Jacobians over subjects.
Experimental setup
Datasets: BATS (Bigger Analogy Test Set)
Benchmarks: BATS
Metrics: top-1 faithfulness (match rate of argmax token)
Baselines: affine LRE (βWs+b) Bias approximator (s+b)
Builds on: affine linear relational embedding (LRE) Linear Representational Hypothesis Meng et al. 2022 causal tracing
Closest papers by meaning
- Linearity of Relation Decoding in Transformer Language Models (ICLR 2024 · similarity 0.89)
- The Structure of Relation Decoding Linear Operators in Large Language Models (NeurIPS 2025 · similarity 0.88)
- Emergence of a High-Dimensional Abstraction Phase in Language Transformers (ICLR 2025 · similarity 0.86)
- Transformer Block Coupling and its Correlation with Generalization in LLMs (ICLR 2025 · similarity 0.85)
- Emergence of Linear Truth Encodings in Language Models (NeurIPS 2025 · similarity 0.85)
- Language Models Are Implicitly Continuous (ICLR 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
