Sparse Autoencoders Are a Shared Coordinate System for Symbolic Matching
On the map: Mechanistic interpretability → SAE features and their applications
Abstract (arXiv)
Large language models (LLMs) hold broad knowledge in one set of weights, but lack interpretability and trustworthy reasoning, especially in high-stakes use cases. A neuro-symbolic model, with its interpretable architecture and System 2 reasoning capacity, is a promising alternative if built at the scale of LLMs; however, its symbolic backbone is usually constructed with human effort, so existing neuro-symbolic models are bottlenecked by the scope of the symbol component and usually domain-specific. A data-driven method could instead build a larger symbolic system by aligning and merging existing ones. We target its first, foundational step: matching units across these heterogeneous systems. Our method, SAE-IDF, encodes a symbol in its native context into a sparse code with a sparse autoencoder (SAE), re-weights each dimension by its rarity and matches across systems. On 12 tasks across 6 kinds of symbolic system, SAE-IDF outperforms the same LLM's dense baseline on all tasks with Gemma-2-9B and all but one with Llama-3.1-8B, by up to 45 points, consistently across SAE layers and configurations. SAE-IDF is also interpretable: every dimension of the sparse code has a human-readable meaning, so each match decomposes into named concepts (features). Our work paves the way to a universal symbolic backbone.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in SAE features and their applications, one of 13 directions in Mechanistic interpretability. Builds on 37 of its 67 references that are in the map. First posted on arXiv 14 Oct 2026.
Builds on
37 of 67 references.
Closest ancestors · 5
Same direction, newest first
- 2025Are Sparse Autoencoders Useful? A Case Study in Sparse Probing23 Feb
- 2024Llama Scope: Extracting Millions of Features from Llama-3.1-8B with Sparse Autoencoders27 Oct
- 2024Disentangling Dense Embeddings with Sparse Autoencoders1 Aug
- 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoders19 Jul
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Models15 Sep
Other references · 32
- 2017Attention Is All You Needcited by 60,361
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
- 2020CodeBERT: A Pre-Trained Model for Programming and Natural Languagescited by 1,310
- 2024M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillationcited by 1,073
- 2019How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddingscited by 784
- 2019Neural Probabilistic Logic Programming in DeepProbLogcited by 394
- 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2cited by 394
- 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 391
- 2023Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoningcited by 391
- 2019The Neuro-Symbolic Concept Learner: Interpreting Scenes, Words, and Sentences From Natural Supervisioncited by 372
20 more
- 2022UniXcoder: Unified Cross-Modal Pre-training for Code Representationcited by 361
- 2020Inductive Biases for Deep Learning of Higher-Level Cognitioncited by 275
- 2019Deep Learning for Symbolic Mathematicscited by 270
- 2023Reasoning or Reciting? Exploring the Capabilities and Limitations of Language Models Through Counterfactual Taskscited by 246
- 2017All-but-the-Top: Simple and Effective Postprocessing for Word Representationscited by 212
- 2017Learning Explanatory Rules from Noisy Datacited by 211
- 2017Learning to Plan Chemical Synthesescited by 179
- 2017End-to-End Differentiable Provingcited by 161
- 2019The Lean mathematical librarycited by 134
- 2020A Benchmarking Study of Embedding-based Entity Alignment for Knowledge Graphscited by 120
- 2020Thinking Fast and Slow in AIcited by 70
- 2025Large Language Models Share Representations of Latent Grammatical Concepts Across Typologically Diverse Languagescited by 59
- 2022XLCoST: A Benchmark Dataset for Cross-lingual Code Intelligencecited by 56
- 2023Introduction to Latent Variable Energy-Based Models: A Path Towards Autonomous Machine Intelligencecited by 56
- 2021BERTMap: A BERT-based Ontology Alignment Systemcited by 46
- 2019NLProlog: Reasoning with Weak Unification for Question Answering in Natural Languagecited by 37
- 2020Valentine: Evaluating Matching Techniques for Dataset Discoverycited by 35
- 2023Agent-OM: Leveraging LLM Agents for Ontology Matchingcited by 27
- 2022Machine Learning-Friendly Biomedical Datasets for Equivalence and Subsumption Ontology Matchingcited by 22
- 2024Learning by Analogy: Enhancing Few-Shot Prompting for Math Word Problem Solving with Computational Graph-Based Retrievalcited by 5
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025A Comparative Analysis of Sparse Autoencoder and Activation Difference in Language Model Steering
- 2025A Survey on Sparse Autoencoders: Interpreting the Internal Mechanisms of Large Language Models
- 2025Unveiling Language-Specific Features in Large Language Models via Sparse Autoencoders
- 2025I Have Covered All the Bases Here: Interpreting Reasoning Features in Large Language Models via Sparse Autoencoders
- 2025SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretability
- 2025Neuro-Symbolic Artificial Intelligence: Towards Improving the Reasoning Abilities of Large Language Models
- 2026When Can We Trust the Sparse Lens? A Certification Framework for SAE Faithfulness
- 2025Evaluating Sparse Autoencoders for Monosemantic Representation