Concept Component Analysis: A Principled Approach for Concept Extraction in LLMs
On the map: Mechanistic interpretability → SAE features and their applications
Abstract (arXiv)
Developing human understandable interpretation of large language models (LLMs) becomes increasingly critical for their deployment in essential domains. Mechanistic interpretability seeks to mitigate the issues through extracts human-interpretable process and concepts from LLMs' activations. Sparse autoencoders (SAEs) have emerged as a popular approach for extracting interpretable and monosemantic concepts by decomposing the LLM internal representations into a dictionary. Despite their empirical progress, SAEs suffer from a fundamental theoretical ambiguity: the well-defined correspondence between LLM representations and human-interpretable concepts remains unclear. This lack of theoretical grounding gives rise to several methodological challenges, including difficulties in principled method design and evaluation criteria. In this work, we show that, under mild assumptions, LLM representations can be approximated as a {linear mixture} of the log-posteriors over concepts given the input context, through the lens of a latent variable model where concepts are treated as latent variables. This motivates a principled framework for concept extraction, namely Concept Component Analysis (ConCA), which aims to recover the log-posterior of each concept from LLM representations through a {unsupervised} linear unmixing process. We explore a specific variant, termed sparse ConCA, which leverages a sparsity prior to address the inherent ill-posedness of the unmixing problem. We implement 12 sparse ConCA variants and demonstrate their ability to extract meaningful concepts across multiple LLMs, offering theory-backed advantages over SAEs.
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 68 of its 86 references that are in the map. First posted on arXiv 28 Jan 2026.
Builds on
68 of 86 references.
Closest ancestors · 9
Same direction, newest first
- 2025Are Sparse Autoencoders Useful? A Case Study in Sparse Probing23 Feb
- 2024BatchTopK Sparse Autoencoders9 Dec
- 2024Llama Scope: Extracting Millions of Features from Llama-3.1-8B with Sparse Autoencoders27 Oct
- 2024A is for Absorption: Studying Feature Splitting and Absorption in Sparse Autoencoders22 Sep
- 2024Measuring Progress in Dictionary Learning for Language Model Interpretability with Board Game Models31 Jul
- 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoders19 Jul
- 2024Scaling and evaluating sparse autoencoders6 Jun
- 2024Improving Dictionary Learning with Gated Sparse Autoencoders24 Apr
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Models15 Sep
Other references · 59
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
- 2025Gemma 3 Technical Reportcited by 1,824
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
- 2018Group Normalizationcited by 1,524
- 2023Inference-Time Intervention: Eliciting Truthful Answers from a Language Modelcited by 1,302
- 2015Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)cited by 1,070
- 2020Concept Bottleneck Modelscited by 1,032
- 2022Toy Models of Superpositioncited by 971
- 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 716
- 2023A Comprehensive Overview of Large Language Modelscited by 648
- 2017Self-Normalizing Neural Networkscited by 598
38 more
- 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 503
- 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2cited by 394
- 2023Finding Neurons in a Haystack: Case Studies with Sparse Probingcited by 334
- 2023Emergent Linear Representations in World Models of Self-Supervised Sequence Modelscited by 319
- 2021Self-Supervised Learning with Data Augmentations Provably Isolates Content from Stylecited by 312
- 2022Language in a Bottle: Language Model Guided Concept Bottlenecks for Interpretable Image Classificationcited by 312
- 2023Label-Free Concept Bottleneck Modelscited by 285
- 2018Nonlinear ICA Using Auxiliary Variables and Generalized Contrastive Learningcited by 282
- 2016Unsupervised Feature Extraction by Time-Contrastive Learning and Nonlinear ICAcited by 273
- 2022Relative representations enable zero-shot latent space communicationcited by 191
- 2023Linear Representations of Sentiment in Large Language Modelscited by 163
- 2022Interventional Causal Representation Learningcited by 142
- 2022Weakly supervised causal representation learningcited by 140
- 2024Rethinking Interpretability in the Era of Large Language Modelscited by 111
- 2023Nonparametric Identifiability of Causal Representations from Unknown Interventionscited by 106
- 2020On Linear Identifiability of Learned Representationscited by 105
- 2023Concept-based Explainable Artificial Intelligence: A Surveycited by 98
- 2023Learning Linear Causal Representations from Interventions under General Nonlinear Mixingcited by 92
- 2024Towards Principled Evaluations of Sparse Autoencoders for Interpretability and Controlcited by 86
- 2022Linear Causal Disentanglement via Interventionscited by 84
- 2024On the Origins of Linear Representations in Large Language Modelscited by 79
- 2023Eight Things to Know about Large Language Modelscited by 73
- 2020Weakly Supervised Disentangled Generative Causal Representation Learningcited by 68
- 2024Identifying Functionally Important Features with End-to-End Sparse Dictionary Learningcited by 67
- 2021Learning latent causal graphs via mixture oraclescited by 55
- 2023Score-based Causal Representation Learning with Interventionscited by 49
- 2023Bridging the Human-AI Knowledge Gap: Concept Discovery and Transfer in AlphaZerocited by 42
- 2024Efficient Dictionary Learning with Switch Sparse Autoencoderscited by 39
- 2015Simple, Efficient, and Neural Algorithms for Sparse Codingcited by 37
- 2022Identifying Weight-Variant Latent Causal Modelscited by 34
- 2023Leveraging sparse and shared feature activations for disentangled representation learningcited by 32
- 2024Learning Interpretable Concepts: Unifying Causal Representation Learning and Foundation Modelscited by 29
- 2016A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionariescited by 26
- 2022Causal Abstraction with Soft Interventionscited by 23
- 2023Identifiable Latent Polynomial Causal Models Through the Lens of Changecited by 23
- 2013New Algorithms for Learning Incoherent and Overcomplete Dictionariescited by 22
- 2023Interpretability is in the Mind of the Beholder: A Causal Framework for Human-interpretable Representation Learningcited by 22
- 2022Concept Embedding Analysis: A Reviewcited by 20
50 most cited of 59 All 59 (JSON)
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025A Survey on Sparse Autoencoders: Interpreting the Internal Mechanisms of Large Language Models
- 2025Interpreting Language Models Through Concept Descriptions: A Survey
- 2025Sparse Shift Autoencoders for Identifying Concepts from Large Language Model Activations
- 2025Unveiling Decision-Making in LLMs for Text Classification : Extraction of influential and interpretable concepts with Sparse Autoencoders
- 2025ConceptViz: A Visual Analytics Approach for Exploring Concepts in Large Language Models
- 2025Interpreting and Steering LLMs with Mutual Information-based Explanations on Sparse Autoencoders
- 2025Temporal Sparse Autoencoders: Leveraging the Sequential Nature of Language for Interpretability
- 2026Sparse Autoencoders for Mechanistic Interpretability in NLP: A Critical Survey of Recoverability, Interpretability, and Utility