用黑盒模型自身学到的概念构建可解释的分类模型
Learning Concept Bottleneck Models from Mechanistic Explanations
- 从黑盒模型中提取概念,通过稀疏自编码器和多模态大模型命名
- 在相同稀疏度下,性能超越已有可解释模型,且解释更简洁
- 适合需要高可解释性又不牺牲性能的研究者
概念瓶颈模型(CBM)通过在决策前引入可解释概念层实现事前可解释性。现有方法通常依赖人工指定、知识图谱或通用模型概念,但这些概念可能预测能力弱或难以从数据中学习,导致性能显著落后于黑盒模型。为此,本文提出机制性概念瓶颈模型(M-CBM),直接从黑盒模型自身学习的概念构建瓶颈层。利用稀疏自编码器(SAEs)提取概念,并通过多模态大模型对部分图像进行命名与标注。为公平比较并控制信息泄露,我们引入贡献概念数量(NCC)这一决策级稀疏度指标,扩展了近期提出的NEC指标。在多个数据集上,M-CBM在相同稀疏度下持续优于先前方法,提升概念预测能力并提供更简洁的解释。代码已开源。
原文摘要 · Abstract (English)
Concept Bottleneck Models (CBMs) aim for ante-hoc interpretability by learning a bottleneck layer that predicts interpretable concepts before the decision. State-of-the-art approaches typically select which concepts to learn via human specification, open knowledge graphs, prompting an LLM, or using general CLIP concepts. However, concepts defined a-priori may not have sufficient predictive power for the task or even be learnable from the available data. As a result, these CBMs often significantly trail their black-box counterpart when controlling for information leakage. To address this, we introduce a novel CBM pipeline named Mechanistic CBM (M-CBM), which builds the bottleneck directly from a black-box model's own learned concepts. These concepts are extracted via Sparse Autoencoders (SAEs) and subsequently named and annotated on a selected subset of images using a Multimodal LLM. For fair comparison and leakage control, we also introduce the Number of Contributing Concepts (NCC), a decision-level sparsity metric that extends the recently proposed NEC metric. Across diverse datasets, we show that M-CBMs consistently surpass prior CBMs at matched sparsity, while improving concept predictions and providing concise explanations. Our code is available at https://github.com/Antonio-Dee/M-CBM.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。