Sample-efficient Learning of Concepts with Theoretical Guarantees: from Data to Concepts without Interventions
Hidde Fokkema, Tim van Erven, Sara Magliacane
Abstract
Machine learning is a vital part of many real-world systems, but several concerns remain about the lack of interpretability, explainability and robustness of black-box AI systems. Concept Bottleneck Models (CBM) address some of these challenges by learning interpretable concepts from high-dimensional data, e.g. images, which are used to predict labels. An important issue in CBMs are spurious correlation between concepts, which effectively lead to learning"wrong"concepts. Current mitigating strategies have strong assumptions, e.g., they assume that the concepts are statistically independent of each other, or require substantial interaction in terms of both interventions and labels provided by annotators. In this paper, we describe a framework that provides theoretical guarantees on the correctness of the learned concepts and on the number of required labels, without requiring any interventions. Our framework leverages causal representation learning (CRL) methods to learn latent causal variables from high-dimensional observations in a unsupervised way, and then learns to align these variables with interpretable concepts with few concept labels. We propose a linear and a non-parametric estimator for this mapping, providing a finite-sample high probability result in the linear case and an asymptotic consistency result for the non-parametric estimator. We evaluate our framework in synthetic and image benchmarks, showing that the learned concepts have less impurities and are often more accurate than other CBMs, even in settings with strong correlations between concepts.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ace3f5e7-e98d-4344-973e-49c755710960Cited by top-tier papers2
- When Does Closeness in Distribution Imply Representational Similarity? An Identifiability PerspectiveBeatrix M. G. Nielsen, Emanuele Marconato, Andrea Dittadi, Luigi GreseleNeurIPS 2025 · 7 citations
- Low-Sensitivity Matching via Sampling from Gibbs DistributionsYuichi Yoshida, Zihan ZhangSODA 2026
Builds on20
- Concept Bottleneck ModelsPang Wei Koh, Thao Nguyen, Yew Siang Tang, Stephen Mussmann et al.ICML 2020 · 1,233 citations
- Causal Abstractions of Neural NetworksAtticus Geiger, Hanson Lu, Thomas Icard, Christopher PottsNeurIPS 2021 · 516 citations
- Self-Supervised Learning with Data Augmentations Provably Isolates Content from StyleJulius von Kügelgen, Yash Sharma, Luigi Gresele, Wieland Brendel et al.NeurIPS 2021 · 421 citations
- Contrastive Learning Inverts the Data Generating ProcessRoland S. Zimmermann, Yash Sharma, Steffen Schneider, Matthias Bethge et al.ICML 2021 · 264 citations
- Addressing Leakage in Concept Bottleneck ModelsMarton Havasi, Sonali Parbhoo, Finale Doshi-VelezNeurIPS 2022 · 163 citations
Related papers
- There Was Never a Bottleneck in Concept Bottleneck ModelsAntonio Almudévar, José Miguel Hernández-Lobato, Alfonso OrtegaICLR 2026 · 9 citations
- Causally Reliable Concept Bottleneck ModelsGiovanni de Felice, Arianna Casanova Flores, Francesco De Santis, Silvia Santini et al.NeurIPS 2025 · 20 citations
- Counterfactual Concept Bottleneck ModelsGabriele Dominici, Pietro Barbiero, Francesco Giannini, Martin Gjoreski et al.ICLR 2025
- Semi-Supervised Concept Bottleneck ModelsLijie Hu, Tianhao Huang, Huanyi Xie, Xilin Gong et al.ICCV 2025 · 4 citations
- Causal Representation Learning Made Identifiable by Grouping of Observational VariablesHiroshi Morioka, Aapo HyvärinenICML 2024 · 26 citations
