Word Embedding Visualization Via Dictionary Learning
Not on the map. Why?
Abstract (arXiv)
Co-occurrence statistics based word embedding techniques have proved to be very useful in extracting the semantic and syntactic representation of words as low dimensional continuous vectors. In this work, we discovered that dictionary learning can open up these word vectors as a linear combination of more elementary word factors. We demonstrate many of the learned factors have surprisingly strong semantic or syntactic meaning corresponding to the factors previously identified manually by human inspection. Thus dictionary learning provides a powerful visualization tool for understanding word embedding representations. Furthermore, we show that the word factors can help in identifying key semantic and syntactic differences in word analogy tasks and improve upon the state-of-the-art word embedding techniques in these tasks by a large margin.
Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 3; 2025: 6; 2026: 1.
12 papers.
- 2026Scaling Monosemanticity: Extracting Interpretable Features from Claude 3 Sonnetcited by 191
- 2021Transformer visualization via dictionary learning: contextualized embedding as a linear superposition of transformer factorscited by 108
- 2024The Geometry of Concepts: Sparse Autoencoder Feature Structurecited by 52
- 2024Dictionary Learning Improves Patch-Free Circuit Discovery in Mechanistic Interpretability: A Case Study on Othello-GPTcited by 29
- 2025Interpretable and Testable Vision Features via Sparse Autoencoderscited by 25
- 2024Automatically Identifying Local and Global Circuits with Linear Computation Graphscited by 24
- 2025Dense SAE Latents Are Features, Not Bugscited by 17
- 2025From superposition to sparse codes: interpretable representations in neural networkscited by 16
- 2022Minimalistic Unsupervised Learning with the Sparse Manifold Transformcited by 6
- 2025Geometry of Semantics in Next-Token Prediction: How Optimization Implicitly Organizes Linguistic Representationscited by 2
- 2025Dictionary Learning: The Complexity of Learning Sparse Superposed Features with Feedbackcited by 0
- 2025Analysis of Variational Sparse Autoencoderscited by 0
- 2026Scaling Monosemanticity: Extracting Interpretable Features from Claude 3 Sonnet28 May 2026
- 2025Analysis of Variational Sparse Autoencoders26 Sep 2025
- 2025Dense SAE Latents Are Features, Not Bugs18 Jun 2025
- 2025Geometry of Semantics in Next-Token Prediction: How Optimization Implicitly Organizes Linguistic Representations13 May 2025
- 2025From superposition to sparse codes: interpretable representations in neural networks3 Mar 2025
- 2025Interpretable and Testable Vision Features via Sparse Autoencoders10 Feb 2025
- 2025Dictionary Learning: The Complexity of Learning Sparse Superposed Features with Feedback8 Feb 2025
- 2024The Geometry of Concepts: Sparse Autoencoder Feature Structure10 Oct 2024
- 2024Automatically Identifying Local and Global Circuits with Linear Computation Graphs22 May 2024
- 2024Dictionary Learning Improves Patch-Free Circuit Discovery in Mechanistic Interpretability: A Case Study on Othello-GPT19 Feb 2024
- 2022Minimalistic Unsupervised Learning with the Sparse Manifold Transform30 Sep 2022
- 2021Transformer visualization via dictionary learning: contextualized embedding as a linear superposition of transformer factors29 Mar 2021