Similarity-based representation factorization for revealing interpretable dimensions in representational data
Not on the map. Why?
Abstract (arXiv)
The study of representations is widespread across fields, including neuroscience, psychology, and artificial intelligence. While representations are often studied and compared through similarities between stimuli, current methods provide only limited access to the dimensions that shape these representations and are often limited in interpretability. To overcome these challenges, here we introduce Similarity-Based Representation Factorization (SRF), a general computational method for recovering low-dimensional, non-negative, interpretable embeddings from similarity matrices derived from measured data. Across simulations and many neural, behavioral, and computational datasets, SRF recovers interpretable dimensions from diverse forms of representational data, even for very sparsely sampled, incomplete data. The dimensions derived from these datasets match those obtained by task-specific models, predict independent behavioral properties, improve exploratory analysis, and offer higher power for confirmatory hypothesis testing than comparing similarity matrices. Together, these results establish SRF as a general-purpose method with broad applications for uncovering, understanding, and using the dimensions underlying representations.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 20 of its 71 references that are in the map. First posted on arXiv 26 May 2026.
Builds on
20 of 71 references.
References · 20
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,588
- 2019Similarity of Neural Network Representations Revisitedcited by 1,719
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,391
- 2017Network Dissection: Quantifying Interpretability of Deep Visual Representationscited by 707
- 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 678
- 2019Unmasking Clever Hans Predictors and Assessing What Machines Really Learncited by 361
- 2019Hyperbolic Image Embeddingscited by 219
- 2021Partial success in closing the gap between human and machine visioncited by 185
- 2014SimLex-999: Evaluating Semantic Models with (Genuine) Similarity Estimationcited by 170
- 2023Getting aligned on representational alignmentcited by 142
- 2025Universal Sparse Autoencoders: Interpretable Cross-Model Concept Alignmentcited by 62
- 2025From Flat to Hierarchical: Extracting Sparse Representations with Matching Pursuitcited by 48
8 more
- 2023Don't trust your eyes: on the (un)reliability of feature visualizationscited by 32
- 2021Neural tuning and representational geometrycited by 31
- 2024Human-like object concept representations emerge naturally in multimodal large language modelscited by 24
- 2024Dimensions underlying the representational alignment of deep neural networks with humanscited by 22
- 2025From superposition to sparse codes: interpretable representations in neural networkscited by 16
- 2021Statistical inference on representational geometriescited by 13
- 2016Inexact Block Coordinate Descent Methods For Symmetric Nonnegative Matrix Factorizationcited by 5
- 2026Characterizing Universal Object Representations Across Vision Modelscited by 2
Built on by
Not cited yet.