Operational Abstractions of Neural Network Concepts via Topological Representations
Not on the map. Why?
Abstract (arXiv)
Concept-based methods provide a semantic level for interpreting and manipulating learned representations, but existing editing approaches are typically specialized to particular interventions and do not provide a common and editable representation of concept organization. To achieve this, we introduce Topological Concept Representations (TCR), a post-hoc operational abstraction that jointly characterizes the concepts encoded in a learned representation and their relationships. TCR constructs an intermediate concept space from concept recoverability and interaction scores, and compactly encodes its organization through topology. Interventions are expressed through modifications of this abstraction that are propagated back to the underlying learned representation. This allows different concept-level operations to share the same optimization framework and separates the desired concept organization from the mechanism to achieve it. We establish stability and reparameterization-invariance properties of TCR and its connections to existing concept-editing formulations. We use TCR to disentangle concepts as a preprocessing step for existing erasure methods, improving worst-group accuracy by 21.89 on average at comparable concept leakage. We further use TCR to transfer concepts from teacher to student models, improving concept recoverability by up to 5.54 while also improving or maintaining competitive test top-1 accuracy.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 42 of its 59 references that are in the map. First posted on arXiv 4 Oct 2026.
Builds on
42 of 59 references.
References · 42
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2014FitNets: Hints for Thin Deep Netscited by 1,653
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
- 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,319
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2019Contrastive Representation Distillationcited by 748
- 2017Network Dissection: Quantifying Interpretability of Deep Visual Representationscited by 708
30 more
- 2019Similarity-Preserving Knowledge Distillationcited by 516
- 2020Null It Out: Guarding Protected Attributes by Iterative Nullspace Projectioncited by 455
- 2019Nuanced Metrics for Measuring Unintended Bias with Real Data for Text Classificationcited by 404
- 2019Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Settingcited by 349
- 2019Intrinsic dimension of data representations in deep neural networkscited by 282
- 2023LEACE: Perfect linear concept erasure in closed formcited by 267
- 2016Demographic Dialectal Variation in Social Media: A Case Study of African-American Englishcited by 196
- 2022CRAFT: Concept Recursive Activation FacTorization for Explainabilitycited by 178
- 2018Adversarial Removal of Demographic Attributes from Text Datacited by 170
- 2019Topological Autoencoderscited by 127
- 2023A Holistic Approach to Unifying Automatic Concept Extraction and Concept Importance Estimationcited by 109
- 2022Linear Adversarial Concept Erasurecited by 101
- 2018A Topological Regularizer for Classifiers via Persistent Homologycited by 63
- 2023Multi-dimensional concept discovery (MCD): A unifying framework with completeness guaranteescited by 50
- 2019Connectivity-Optimized Representation Learning via Persistent Homologycited by 44
- 2016Geometry Helps to Compare Persistence Diagramscited by 39
- 2022Topological Optimization with Big Stepscited by 16
- 2023Robust Concept Erasure via Kernelized Rate-Distortion Maximizationcited by 11
- 2023Concept Distillation: Leveraging Human-Centered Explanations for Model Improvementcited by 10
- 2018Lifted Wasserstein Matcher for Fast and Robust Topology Trackingcited by 9
- 2020Topologically Densified Distributionscited by 8
- 2023Removing Spurious Concepts from Neural Network Representations via Joint Subspace Estimationcited by 6
- 2025Topological Autoencoders++: Fast and Accurate Cycle-Aware Dimensionality Reductioncited by 4
- 2025Preserving Task-Relevant Information Under Linear Concept Removalcited by 4
- 2025Nonlinear Concept Erasure: a Density Matching Approachcited by 3
- 2019Universality of persistence diagrams and the bottleneck and Wasserstein distancescited by 2
- 2024A Practical Solver for Scalar Data Topological Simplificationcited by 2
- 2026Obliviator Reveals the Cost of Nonlinear Guardedness in Concept Erasurecited by 2
- 2026A framework for analyzing concept representations in neural modelscited by 2
- 2025Region-Aware Wasserstein Distances of Persistence Diagrams and Merge Treescited by 1
Built on by
Not cited yet.