Pith. sign in

REVIEW 2 cited by

Discover-then-Name: Task-Agnostic Concept Bottlenecks via Automated Concept Discovery

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.14499 v2 pith:CLHFW3LK submitted 2024-07-19 cs.CV cs.AIcs.LG

classification cs.CVcs.AIcs.LG
keywords conceptsconceptclassificationfirsttaskthemthencbms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Concept Bottleneck Models (CBMs) have recently been proposed to address the 'black-box' problem of deep neural networks, by first mapping images to a human-understandable concept space and then linearly combining concepts for classification. Such models typically require first coming up with a set of concepts relevant to the task and then aligning the representations of a feature extractor to map to these concepts. However, even with powerful foundational feature extractors like CLIP, there are no guarantees that the specified concepts are detectable. In this work, we leverage recent advances in mechanistic interpretability and propose a novel CBM approach -- called Discover-then-Name-CBM (DN-CBM) -- that inverts the typical paradigm: instead of pre-selecting concepts based on the downstream classification task, we use sparse autoencoders to first discover concepts learnt by the model, and then name them and train linear probes for classification. Our concept extraction strategy is efficient, since it is agnostic to the downstream task, and uses concepts already known to the model. We perform a comprehensive evaluation across multiple datasets and CLIP architectures and show that our method yields semantically meaningful concepts, assigns appropriate names to them that make them easy to interpret, and yields performant and interpretable CBMs. Code available at https://github.com/neuroexplicit-saar/discover-then-name.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. When, How Long and How Much? Interpretable Neural Networks for Time Series Regression by Learning to Mask and Aggregate

    cs.LG 2025-12 conditional novelty 7.0 of 10

    MAGNETS learns unsupervised, mask-based concepts to make time-series regression predictions additively interpretable, recovering ground-truth temporal rules on synthetic tasks and beating interpretable baselines on mo...

  2. AIM: Amending Inherent Interpretability via Self-Supervised Masking

    cs.CV 2025-08 unverdicted novelty 6.0 of 10

    AIM uses multi-stage feature guidance for self-supervised masking to improve both interpretability (EPG) and accuracy on vision benchmarks.

Pith tools