Graph Concept Bottleneck Models

Haotian Xu, Tsui-Wei Weng, Lam M. Nguyen, Tengfei Ma
8/19/2025
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Concept Bottleneck Models (CBMs) provide explicit interpretations for deep neural networks through concepts and allow intervention with concepts to adjust final predictions. Existing CBMs assume concepts are conditionally independent given labels and isolated from each other, ignoring the hidden relationships among concepts. However, the set of concepts in CBMs often has an intrinsic structure where concepts are generally correlated: changing one concept will inherently impact its related concepts. To mitigate this limitation, we propose GraphCBMs: a new variant of CBM that facilitates concept relationships by constructing latent concept graphs, which can be combined with CBMs to enhance model performance while retaining their interpretability. Our experiment results on real-world image classification tasks demonstrate Graph CBMs offer the following benefits: (1) superior in image classification tasks while providing more concept structure information for interpretability; (2) able to utilize latent concept graphs for more effective interventions; and (3) robust in performance across different training and architecture settings.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{xu2025graph,
  title  = {Graph Concept Bottleneck Models},
  author = {Haotian Xu and Tsui-Wei Weng and Lam M. Nguyen and Tengfei Ma},
  year   = {2025},
  eprint = {2508.14255},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.14255v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.14255.svg)](https://codeofpaper.com/paper/2508.14255)

Discussion